Author:
Adler Micah,Räcke Harald,Sivadasan Naveen,Sohler Christian,Vöcking Berthold
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovasz, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In Proceedings of the 20th IEEE Symposium on Foundations of Computer Science (FOCS), pages 218–223, 1979.
2. I. Chatzigiannakis, S. Nikoletseas, N. Paspallis, P. Spirakis, and C. Zaroliagis. An experimental study of basic communication protocols in ad-hoc mobile networks. In Proceedings of the 5th Workshop on Algorithmic Engineering, pages 159–171.
3. I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis. Self-organizing ad-hoc mobile networks: The problem of end-to-end communication. In Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (PODC 2001), 2001.
4. A. Efrat, L. J. Guibas, S. Har-Peled, D. C. Lin, J. S. B. Mitchell, and T. M. Murali. Sweeping simple polygons with a chain of guards. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 927–936, 2000.
5. M. K. Franklin, Z. Galil, and M. Yung. Eavesdropping games: a graph-theoretic approach to privacy in distributed systems. Journal of the ACM, 47(2):225–243, 2000.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献