{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T15:13:16Z","timestamp":1649085196341},"reference-count":17,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1989]]},"DOI":"10.1051\/ita\/1989230101131","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T15:38:27Z","timestamp":1486049907000},"page":"113-128","source":"Crossref","is-referenced-by-count":1,"title":["Efficient distributed algorithms by using the archimedean time assumption"],"prefix":"10.1051","volume":"23","author":[{"given":"Paul","family":"Spirakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Basil","family":"Tampakas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. ANGLUIN D., Local and Global Properties in Networks of processes, Proc. 12th A.C.M. Symp. on Theory of Computing, April 1980, pp. 82-93.","DOI":"10.1145\/800141.804655"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. ATTIYA C., SNIR M. and WARMINTH M., Computing on an Anonymous Ring, Proc. 4th A.C.M. Symp. on Principles of Distributed Computing, Aug. 1985, pp. 196-204.","DOI":"10.1145\/323596.323614"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. COURTOIS P. J., HEYMANS F. and PARNAS D. L., Concurrent Control with Readers and Writers, C.A.C.M., Vol. 14, No. 10, pp. 667-668.","DOI":"10.1145\/362759.362813"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. FREDERICKSON G. and LYNCH N., 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.","DOI":"10.1145\/800057.808719"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. FREDERICKSON G. and SANTORO N., 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.8619550599.68049","DOI":"10.1007\/3-540-16766-8_3"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. GAFNI E., 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.","DOI":"10.1145\/323596.323612"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. ITAI A. and RODEH M., Symmetry Breaking in Distributive Networks, Proc. 22nd I.E.E.E. Symp. on Foundations of Computer Science, Oct. 1981, pp. 150-158.","DOI":"10.1109\/SFCS.1981.41"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. LAMPORT L., Concurrent Reading and Writing, C.A.C.M., Vol. 20, No. 11, 1977, pp. 806-811.4646460361.68091","DOI":"10.1145\/359863.359878"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. LAMPORT L., Time Clocks and the Ordering of Events in a Distributed System, C.A.C.M., Vol. 21, No. 7, 1978, pp. 558-565.0378.68027","DOI":"10.1145\/359545.359563"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. LEEUWEN J. VAN, SANTORO N., URRUTIA J. and ZAKS S., 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.9127200643.68020","DOI":"10.1007\/3-540-18088-5_29"},{"key":"R11","unstructured":"11. OVERMARS M. and SANTORO N., An Improved Election Algorithm for Synchronous Rings, preliminary draft, Carleton University, March 1986."},{"key":"R12","unstructured":"12. RAYNAL M., Algorithms for Mutual Exclusion, The M.I.T. Press, 1986."},{"key":"R13","unstructured":"13. REIF J. and SPIRAKIS P., Real Time Synchronization of Interprocess Communication, A.C.M. Transactions of Programming Languages and Systems, April 1984.0536.68021"},{"key":"R14","unstructured":"14. REIF J. and SPIRAKIS P., Unbounded Speed Variability in Distributed Systems, S.I.A.M. Journal of Computing, February 1985.7749280552.68025"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"15. RICART G. and AGRAWALA A., An Optimal Algorithm for Mutual Exclusion in Computer Networks, C.A.C.M., Vol. 24, No. 1, Jan., 1981.600729","DOI":"10.1145\/358527.358537"},{"key":"R16","unstructured":"16. SANTORO N. and ROTEM D., On the Complexity of Distributed Elections is synchronous graphs, Proc. 11th Int. Workshop on Graphtheoretic Concepts in Computer Science, June 1985, pp. 337-346."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"17. VIT\u00c1NYI P., Distributed Elections in an Archimedean Ring of Processors, Proc. 16th A.C.M. Symp. on Theory of Computing, April 1984, pp. 542-547.","DOI":"10.1145\/800057.808725"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1989230101131\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T06:04:35Z","timestamp":1568786675000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1989230101131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"references-count":17,"journal-issue":{"issue":"1"},"alternative-id":["ita1989230101131"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1989230101131","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]}}}