@article{ITA_1989__23_1_113_0,
author = {Spirakis, Paul and Tampakas, Basil},
title = {Efficient distributed algorithms by using the archimedean time assumption},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {113--128},
publisher = {EDP-Sciences},
volume = {23},
number = {1},
year = {1989},
mrnumber = {990071},
zbl = {0665.68032},
language = {en},
url = {http://archive.numdam.org/item/ITA_1989__23_1_113_0/}
}
TY - JOUR AU - Spirakis, Paul AU - Tampakas, Basil TI - Efficient distributed algorithms by using the archimedean time assumption JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1989 SP - 113 EP - 128 VL - 23 IS - 1 PB - EDP-Sciences UR - http://archive.numdam.org/item/ITA_1989__23_1_113_0/ LA - en ID - ITA_1989__23_1_113_0 ER -
%0 Journal Article %A Spirakis, Paul %A Tampakas, Basil %T Efficient distributed algorithms by using the archimedean time assumption %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1989 %P 113-128 %V 23 %N 1 %I EDP-Sciences %U http://archive.numdam.org/item/ITA_1989__23_1_113_0/ %G en %F ITA_1989__23_1_113_0
Spirakis, Paul; Tampakas, Basil. Efficient distributed algorithms by using the archimedean time assumption. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, STACS 88, Tome 23 (1989) no. 1, pp. 113-128. http://archive.numdam.org/item/ITA_1989__23_1_113_0/
1. , Local and Global Properties in Networks of processes, Proc. 12th A.C.M. Symp. on Theory of Computing, April 1980, pp. 82-93.
2. , and , Computing on an Anonymous Ring, Proc. 4th A.C.M. Symp. on Principles of Distributed Computing, Aug. 1985, pp. 196-204.
3. , and , Concurrent Control with Readers and Writers, C.A.C.M., Vol. 14, No. 10, pp. 667-668.
4. and , The Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring, Proc. 16th A.C.M. Symp. on Theory of Computing, April 1984, pp. 493-503.
5. and , Breaking Symmetry in Synchronous Networks, V.L.S.I. Algorithms and Architectures, AWOC 1986, Lecture Notes in Computer Science, No. 227, Springer Verlag, pp. 26-33. | MR | Zbl
6. , Improvements in the Time Complexity of two Message-optimal Election Algorithms Proc. 4th A.C.M. Symp. on Principles of Distributed Computing, Aug. 1985, pp. 175-185.
7. and , Symmetry Breaking in Distributive Networks, Proc. 22nd I.E.E.E. Symp. on Foundations of Computer Science, Oct. 1981, pp. 150-158.
8. , Concurrent Reading and Writing, C.A.C.M., Vol. 20, No. 11, 1977, pp. 806-811. | MR | Zbl
9. , Time Clocks and the Ordering of Events in a Distributed System, C.A.C.M., Vol. 21, No. 7, 1978, pp. 558-565. | Zbl
10. , , and , Guessing Games and Distributed Computations in Synchronous Networks, 14th I.C.A.L.R, L.N.C.S., No. 267, 1987, pp. 347-356, Springer-Verlag. | MR | Zbl
11. and , An Improved Election Algorithm for Synchronous Rings, preliminary draft, Carleton University, March 1986.
12. , Algorithms for Mutual Exclusion, The M.I.T. Press, 1986.
13. and , Real Time Synchronization of Interprocess Communication, A.C.M. Transactions of Programming Languages and Systems, April 1984. | Zbl
14. and , Unbounded Speed Variability in Distributed Systems, S.I.A.M. Journal of Computing, February 1985. | MR | Zbl
15. and , An Optimal Algorithm for Mutual Exclusion in Computer Networks, C.A.C.M., Vol. 24, No. 1, Jan., 1981. | MR
16. and , On the Complexity of Distributed Elections is synchronous graphs, Proc. 11th Int. Workshop on Graphtheoretic Concepts in Computer Science, June 1985, pp. 337-346.
17. , Distributed Elections in an Archimedean Ring of Processors, Proc. 16th A.C.M. Symp. on Theory of Computing, April 1984, pp. 542-547.
