{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T06:43:53Z","timestamp":1648536233340},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,11,1]],"date-time":"1987-11-01T00:00:00Z","timestamp":562723200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9390,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1987,11]]},"DOI":"10.1016\/0890-5401(87)90056-3","type":"journal-article","created":{"date-parts":[[2004,12,2]],"date-time":"2004-12-02T00:24:20Z","timestamp":1101947060000},"page":"162-177","source":"Crossref","is-referenced-by-count":3,"title":["On the bit complexity of distributed computations in a ring with a leader"],"prefix":"10.1016","volume":"75","author":[{"given":"Y.","family":"Mansour","sequence":"first","affiliation":[]},{"given":"S.","family":"Zaks","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(87)90056-3_BIB1","author":"Attiya","year":"1986"},{"key":"10.1016\/0890-5401(87)90056-3_BIB2","series-title":"Proceedings of the 4th ACM Conference on Principles of Distributed Computing","first-page":"196","article-title":"Computing on an anonymous ring","author":"Attiya","year":"1985"},{"key":"10.1016\/0890-5401(87)90056-3_BIB3","series-title":"Proceedings of the 28th IEEE Symposium on Foundations of Computer Science","article-title":"Two lower bounds in asynchronous computation","author":"Duris","year":"1987"},{"key":"10.1016\/0890-5401(87)90056-3_BIB4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","article-title":"An O(n log n) unidirectional distributed algorithm for extrema finding in a circle","volume":"3","author":"Dolev","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0890-5401(87)90056-3_BIB5","author":"Even","year":"1979"},{"issue":"2","key":"10.1016\/0890-5401(87)90056-3_BIB6","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/321450.321464","article-title":"Computational complexity of a one-tape Turing machine computations","volume":"15","author":"Hartmanis","year":"1968","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(87)90056-3_BIB7","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","article-title":"One-tape, off-line Turing machine computations","volume":"8","author":"Hennei","year":"1965","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(87)90056-3_BIB8","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0890-5401(87)90056-3_BIB9","series-title":"Proceedings of the 22nd IEEE Symposium on Foundations of Computer Science","first-page":"150","article-title":"Symmetry breaking in distributed networks","author":"Itai","year":"1981"},{"key":"10.1016\/0890-5401(87)90056-3_BIB10","series-title":"Proceedings of the 5th ACM Symposium on Principles of Distributed Computing","first-page":"131","article-title":"Gap theorems for distributed computations","author":"Moran","year":"1986"},{"key":"10.1016\/0890-5401(87)90056-3_BIB11","series-title":"Proceedings of the 5th ACM Symposium on Principles of Distributed Computing","first-page":"151","article-title":"On the bit complexity of distributed computations in a ring with a leader","author":"Mansour","year":"1986"},{"key":"10.1016\/0890-5401(87)90056-3_BIB12","series-title":"Proceedings of the 14th ACM Symposium on Theory of Computing","first-page":"378","article-title":"A technique for proving lower bounds for distributed maximum-finding algorithms","author":"Pachl","year":"1982"},{"key":"10.1016\/0890-5401(87)90056-3_BIB13","series-title":"Proceedings of the 25nd IEEE Symposium on Foundations of Computer Science","first-page":"109","article-title":"Lower bounds on communication complexity in distributed networks","author":"Tiwari","year":"1984"},{"key":"10.1016\/0890-5401(87)90056-3_BIB14","first-page":"33","article-title":"Turing machine computations with logarithmic delay","volume":"3","author":"Trachtenbrot","year":"1964","journal-title":"Algebra i Logika"},{"key":"10.1016\/0890-5401(87)90056-3_BIB15","series-title":"Proceedings of the 1st International Workshop on Distributed Algorithms on Graphs","first-page":"143","article-title":"Simulation of chaotic algorithms by token algorithms","author":"Tiwari","year":"1985"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540187900563?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540187900563?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T18:28:47Z","timestamp":1549045727000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540187900563"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,11]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,11]]}},"alternative-id":["0890540187900563"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(87)90056-3","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1987,11]]}}}