{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:31:09Z","timestamp":1781076669595,"version":"3.54.1"},"publisher-location":"Berlin\/Heidelberg","reference-count":17,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540188347","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0035849","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T10:40:10Z","timestamp":1138185610000},"page":"248-263","source":"Crossref","is-referenced-by-count":6,"title":["Efficient distributed algorithms by using the archimedean time assumption"],"prefix":"10.1007","author":[{"given":"Paul","family":"Spirakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Basil","family":"Tampakas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"D. Angluin, \"Local and global properties in networks of processes\", Proc. 12th ACM Symp. on Theory of Computing, April 1980, 82\u201393.","DOI":"10.1145\/800141.804655"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"C. Attiya, M. Snir, M. Warminth, \"Computing on an anonymous ring\", Proc. 4th ACM Symp. on Principles of Distributed Computing, Aug. 1985, 196\u2013204.","DOI":"10.1145\/323596.323614"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Courtois P.J., Heymans F. and Parnas D.L., \"Concurrent Control with Readers and Writers\" CACM Vol. 14, No 10, 66\u2013668.","DOI":"10.1145\/362759.362813"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"G. Frederickson, N. Lynch, \"The impact of synchronous communication on the problem of electing a leader in a ring\", Proc. 16th ACM Symp. on Theory of Computing, April 1984, 493\u2013503.","DOI":"10.1145\/800057.808719"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"G. Frederickson, N. Santoro, \"Breaking Symmetry in Synchronous Networks\", VLSI Algorithms and Architectures, AWOC 1986, Lecture Notes in Computer Science, No 227, Springer-Verlag, pp. 26\u201333.","DOI":"10.1007\/3-540-16766-8_3"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"E. Gafni, \"Improvements in the time complexity of two message-optimal election algorithms\", Proc. 4th ACM Symp. on Principles of Distributed Computing, Aug. 1985, pp. 175\u2013185.","DOI":"10.1145\/323596.323612"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"A. Itai, M. Rodeh, \"Symmetry breaking in distributive networks\", Proc. 22nd IEEE Symp. on Foundations of Computer Science, Oct. 1981, 150\u2013158.","DOI":"10.1109\/SFCS.1981.41"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Lamport L., \"Concurrent reading and writing\", CACM Vol. 20, No. 11, 806\u2013811.","DOI":"10.1145\/359863.359878"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Lamport L., \"Time clocks and the ordering of events in a distributed system\", CACM Vol. 21, No. 7, 558\u2013565.","DOI":"10.1145\/359545.359563"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"J. van Leeuwen, N. Santoro, J. Urrutia and S. Zaks, \"Guessing Games and Distributed Computations in Synchronous Networks\", 14th ICALP, LNCS No. 267, pp. 347\u2013356, Springer-Verlag, 1987.","DOI":"10.1007\/3-540-18088-5_29"},{"key":"24_CR11","unstructured":"M. Overmars, N. Santoro, \"An improved election algorithm for synchronous rings\", preliminary draft, Carleton University, March 1986."},{"key":"24_CR12","unstructured":"M. Raynal, \"Algorithms for Mutual Exclusion\", The MIT Press, 1986."},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"J. Reif, P. Spirakis, \"Real Time Synchronization of Interprocess Communication\", ACM Transactions of Programming Languages and Systems, April 1984.","DOI":"10.1145\/2993.357244"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"J. Reif, P. Spirakis, \"Unbounded Speed Variability in Distributed Systems\", SIAM Journal of Computing, February 1985.","DOI":"10.1137\/0214005"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"G. Ricart, A. Agrawala, \"An Optimal Algorithm for Mutual Exclusion in Computer Networks\", CACM, Vol. 24, No. 1, Jan. 1981.","DOI":"10.1145\/358527.358537"},{"key":"24_CR16","unstructured":"N. Santoro, D. Rotem, \"On the Complexity of distributed elections is synchronous graphs\", Proc. 11th Int. Workshop on Graphtheoretic Concepts in Computer Science, June 1985, 337\u2013346."},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"P. Vit\u00e1nyi, \"Distributed elections in an Archimedean ring of processors\", Proc. 16th ACM Symp. on Theory of Computing, April 1984, 542\u2013547.","DOI":"10.1145\/800057.808725"}],"container-title":["Lecture Notes in Computer Science","STACS 88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035849.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T17:15:41Z","timestamp":1607534141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035849"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540188347"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0035849","relation":{},"subject":[]}}