{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:44:25Z","timestamp":1750308265023,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,13]],"date-time":"2004-06-13T00:00:00Z","timestamp":1087084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,6,13]]},"DOI":"10.1145\/1007352.1007406","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"321-330","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Collective asynchronous reading with polylogarithmic worst-case overhead"],"prefix":"10.1145","author":[{"given":"Bogdan S.","family":"Chlebus","sequence":"first","affiliation":[{"name":"University of Colorado at Denver, Denver, CO"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut fur Informatik, Saarbrucken, Germany and Uniwersytet Warszawski, Warszawa, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander A.","family":"Shvartsman","sequence":"additional","affiliation":[{"name":"University of Connecticut, Storrs, CT and CSAIL, Massachusetts Institute of Technology, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/153724.153741"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796475"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365676"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242703"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794319126"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/97444.97701"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0907"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460100067"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242714"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795279463"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129768"},{"key":"e_1_3_2_1_12_1","volume-title":"Charles Griffin","author":"Bailey N. T. J.","year":"1975","unstructured":"N. T. J. Bailey , The Mathematical Theory of Infectious Diseases and its Applications , Charles Griffin , London , 1975 .]] N. T. J. Bailey, The Mathematical Theory of Infectious Diseases and its Applications, Charles Griffin, London, 1975.]]"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129717"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0003"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/645959.676125"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564908"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378685"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41841"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539790192647"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/164051.164058"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129776"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39989-6_16"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780581"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301362"},{"key":"e_1_3_2_1_25_1","first-page":"371","volume-title":"28th IEEE Symp. Found. of Computer Science","author":"Israeli A.","year":"1987","unstructured":"A. Israeli and M. Li , Bounded time stamps Proc ., 28th IEEE Symp. Found. of Computer Science , 1987 , pp. 371 -- 382 .]] A. Israeli and M. Li, Bounded time stamps Proc., 28th IEEE Symp. Found. of Computer Science, 1987, pp. 371--382.]]"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"P. C. Kanellakis and A. A. Shvartsman Efficient parallel algorithms can be made robust Distributed Computing 5 (1992) 201--217.]]  P. C. Kanellakis and A. A. Shvartsman Efficient parallel algorithms can be made robust Distributed Computing 5 (1992) 201--217.]]","DOI":"10.1007\/BF02277667"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/548729"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796561"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380796"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/234533.234556"},{"key":"e_1_3_2_1_31_1","volume-title":"Morgan Kaufmann","author":"Lynch N. A.","year":"1996","unstructured":"N. A. Lynch , Distributed Algorithms , Morgan Kaufmann , 1996 .]] N. A. Lynch, Distributed Algorithms, Morgan Kaufmann, 1996.]]"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872075"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221063"},{"key":"e_1_3_2_1_34_1","first-page":"1","volume-title":"Proc., 7th Annual Teletraffic Conference","author":"Pinsker M. S.","year":"1973","unstructured":"M. S. Pinsker , On the complexity of a concentrator , in Proc., 7th Annual Teletraffic Conference , 1973 , pp. 318\/ 1 -- 318 \/4.]] M. S. Pinsker, On the complexity of a concentrator, in Proc., 7th Annual Teletraffic Conference, 1973, pp. 318\/1--318\/4.]]"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216066"},{"key":"e_1_3_2_1_36_1","first-page":"157","volume":"155","author":"Reingold O.","year":"2002","unstructured":"O. Reingold , S. P. Vadhan , and A. Wigderson , Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors, Ann. Mathematics , 155 ( 2002 ) 157 -- 187 .]] O. Reingold, S. P. Vadhan, and A. Wigderson, Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors, Ann. Mathematics, 155 (2002) 157--187.]]","journal-title":"Mathematics"},{"key":"e_1_3_2_1_37_1","first-page":"351","volume-title":"Proc. 2nd SIAM--ACM Symp. Discrete Algorithms","author":"Saks M.","year":"1991","unstructured":"M. Saks , N. Shavit , and H. Woll , Optimal time randomized consensus--making resilient algorithms fast in practice , in Proc. 2nd SIAM--ACM Symp. Discrete Algorithms , 1991 , pp. 351 -- 362 .]] M. Saks, N. Shavit, and H. Woll, Optimal time randomized consensus--making resilient algorithms fast in practice, in Proc. 2nd SIAM--ACM Symp. Discrete Algorithms, 1991, pp. 351--362.]]"},{"key":"e_1_3_2_1_38_1","volume-title":"The Hebrew University","author":"Shavit N.","year":"1989","unstructured":"N. Shavit , \" Concurrent Timestamping ,\" Ph. D. Thesis , The Hebrew University , 1989 .]] N. Shavit, \"Concurrent Timestamping,\" Ph. D. Thesis, The Hebrew University, 1989.]]"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90156-C"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380790"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1099"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.11"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/1659232.1659238"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"A. Wigderson and D. Zuckerman Expanders that beat the eigenvalue bound: explicit construction and applications Combinatorica 19 (1999) 125--138.]]  A. Wigderson and D. Zuckerman Expanders that beat the eigenvalue bound: explicit construction and applications Combinatorica 19 (1999) 125--138.]]","DOI":"10.1007\/s004930050049"}],"event":{"name":"STOC04: Symposium of Theory of Computing 2004","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago IL USA","acronym":"STOC04"},"container-title":["Proceedings of the thirty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007406","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007352.1007406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:23:56Z","timestamp":1750267436000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":45,"alternative-id":["10.1145\/1007352.1007406","10.1145\/1007352"],"URL":"https:\/\/doi.org\/10.1145\/1007352.1007406","relation":{},"subject":[],"published":{"date-parts":[[2004,6,13]]},"assertion":[{"value":"2004-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}