This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Burns J (1981) A formal model for message passing systems. Tech. Rep. TR-91, Dept. Comput. Sci., Indiana University
Dolev D, Klawe M, Rodeh M (1983) An O(n log n) unidirectional algorithm for extrema-finding in a circle. J. Algorithms 3: 245–260
Dwork C, Lynch NA, Stockmeyer L (1988) Consensus in the presence of partial synchrony. J. ACM 35: 288–323
Frederickson GN, Lynch NA (1984) The impact of synchronous communication on the problem of electing a leader in a ring. In: Proc. 16th ACM Symp. Theory of Computing, pp 493–503
Frederickson GN, Santoro N (1986) Symmetry breaking in synchronous networks. In: Proc. 2nd Int. Workshop on Parallel Computing and VLSI, pp 26–33
Gafni E. (1985) Improvements in the time complexity of two message-optimal election algorithms. In: Proc. 4th ACM Symp. on Principles of Distributed Computing, pp 175–185
Itai A, Rodeh M (1981) Symmetry breaking in synchronous networks. In: Proc. 22nd IEEE Symp. on Foundations of Computer Science, pp 150–158
van Leeuwen J, Santoro N, Urrutia J, Zaks S (1987) Guessing games and distributed computations in anonymous networks. In: Proc. 14th Int. Coll. on Automata, Languages and Programming, pp 347–356
van Leeuwen J, Tan R (1987) An improved upperbound for distributed election in bidirectional rings of processors. Distributed Computing 2: 149–160
Marchetti A (1987) New protocols for the election of a leader in a ring. Theoretical Computer Science
Moran S, Shalom M, Zaks S (1987) A 1.44...n log n algorithm for distributed leader finding in bidirectional rings of processors. Acta Informatica
Negro A, Santoro N, Urrutia J (1987) On the packet complexity of distributed selection. In: Proc. 2nd Int. Workshop on Distributed Algorithms, pp 108–115
Pachl J, Korach E, Rotem D (1984) Lower bounds for distributed maximum finding algorithms. J. ACM 31: 380–401
Peterson GL (1982) An O(n log n) unidirectional algorithm for the circular extrema problem. ACM Trans. Prog. Lang. Syst. 4: 758–762
Santoro N, Rotem D (1985) On the complexity of distributed elections in synchronous graphs. In: Proc. 11th Int. Workshop on Graphtheoretic Concepts in Computer Science, pp 337–346
Spirakis P, Tampakas B (1988) Efficient distributed algorithms by using the Archimedean time assumption. In: Proc. 5th Symp. on Theoretical Aspects of Computer Science: 248–263
Vitanyi P (1984) Distributed elections in an Archimedean ring of processors. In: Proc. 16th ACM Symp. Theory of Computing, pp 542–547
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Overmars, M., Santoro, N. (1989). Time vs bits. In: Monien, B., Cori, R. (eds) STACS 89. STACS 1989. Lecture Notes in Computer Science, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028992
Download citation
DOI: https://doi.org/10.1007/BFb0028992
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50840-3
Online ISBN: 978-3-540-46098-5
eBook Packages: Springer Book Archive