Paolo Boldi
Sebastiano Vigna
ABSTRACT
No abstract available.
- 1.BOLDI, P., AND VIGNA, S. Graph fibrations. Preprint, 1996.Google Scholar
- 2.BOLD1, P., AND VIGNA, S. Self-stabilizing universal a!~ gorithms. In Proc. of the Third Wor~hop on Self-Stabilizing Systems (1997), Carleton University Press. To appear.Google Scholar
- 3.NO~RIS, N. Universal covers of graphs: Isomorphism to depth n - i implies isomorphism to all depths. Discrete Applied Mathematics 56 (1995), 61-74.Google ScholarCross Ref
- 4.YAMASHITA, M., AND KAMEDA, T. Computing functions on asynchronous anonymous networks. Math. Systems Theory 29 (1996), 331-356.Google ScholarCross Ref
Index Terms
- Computing vector functions on anonymous networks
Recommendations
Distributed computing on anonymous hypercube networks
SPDP '91: Proceedings of the 1991 Third IEEE Symposium on Parallel and Distributed ProcessingThe authors consider the bit-complexity (i.e. the total number of bits transmitted) of computing boolean functions on an anonymous canonically labeled n-dimensional hypercube network with N=2/sup n/ nodes and give a characterization of the boolean ...
In search of an anonymous and secure lookup: attacks on structured peer-to-peer anonymous communication systems
CCS '10: Proceedings of the 17th ACM conference on Computer and communications securityThe ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributes hash table lookups to locate relays, but the lack of anonymity in their lookup mechanisms ...
Comments