This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Abelson, H. Lower Bounds on Information Transfer in Distributed Computation. Symposium on Foundation of Computer Science, IEEE, October, 1978, pp. 151–158.
Ajtai M., J. Komlos and E. Szemeredi. An O(n logn) Sorting Network. Symposium on Theory of Computing, ACM, May, 1980, pp. 82–93.
Angluin D. Local and Global Properties in Network of Processors. Symposium on Theory of Computing, ACM, May, 1980, pp. 82–93.
Batcher K. Sorting Networks and their Applications. AFIPS Spring Joint Computer Conference, 32, 1968, pp. 307–314.
Chandra A. K., M. L. Furst and R. J. Lipton. Multi-Party Protocols. Symposium on Theory of Computing, ACM, April, 1983, pp. 94–99.
Gafni E., M.C. Loui, P. Tiwori, D.B. West and S. Zaks. Lower Bounds on Common Knowledge in Distributed Algorithms, with Applications. University of Illinoi at Urbana-Champaign, March, 1984.
Greenberg A.G. On the Time Complexity of Broadcast Communication Schemes. Symposium on Theory of Computing, ACM, May, 1982, pp. 354–364.
Karp R.M. and M.O. Rabin. Efficient Randomized Pattern-Matching Algorithms. University of California, Berkley, 1981.
Pachl J., E. Korach, and D. Rotem. A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms. Symposium on Theory of Computing, ACM, May, 1982, pp. 378–382.
Papadimitriou C. H., and M. Sipser. Communication Complexity. Symposium on Theory of Computing, ACM, May, 1982, pp. 196–200.
Saltzer, J.H. Naming and Binding of Objects. In Operating Systems: an advanced course, Bayer, R., R. M. Graham, and G. Seegmuller, Ed., Springer-Verlag, 1978, pp. 99–208.
T. Leighton. Tight Bounds on the Complexity of Parallel Sorting. Symposium on Theory of Computing, ACM, May, 1984, pp. 71–80.
Tiwari P. Lower Bounds on Communication Complexity in Distributed Computer Networks. Symposium on Foundation of Computer Science, IEEE, October, 1984, pp. 109–117.
Ullman J. D., Computational Aspects of VLSI. Computer Science Press, Rockville, Maryland, 1984.
Watson, R.W. Identifiers (Naming) in Distributed Systems. In Distributed Systems-Architecture and Implementation: an advanced course Lampson B.W., M. Paul, and H.J. Siegert, Ed., Springer-Verlag, 1983, pp. 191–210.
Willard D. Log-logarithmic Protocol for Resolving Ethernet and Semaphore Conflicts. Symposium on Theory of Computing, ACM, May, 1984, pp. 512–521.
Yao A.C. Some Complexity Questions Related to Distributive Computing. Symposium on Theory of Computing, ACM, May, 1979, pp. 209–213.
Yemini Y. and A. Lazar. Towards Distributed Sensor Networks. Conference on Information Science and Systems, Princton University, March, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Landau, G.M., Yung, M.M., Galil, Z. (1985). Distributed algorithms in synchronous broadcasting networks. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015762
Download citation
DOI: https://doi.org/10.1007/BFb0015762
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15650-5
Online ISBN: 978-3-540-39557-7
eBook Packages: Springer Book Archive