{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:16:57Z","timestamp":1787498217036,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,27]],"date-time":"2004-06-27T00:00:00Z","timestamp":1088294400000},"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,27]]},"DOI":"10.1145\/1007912.1007964","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T11:55:38Z","timestamp":1090324538000},"page":"311-320","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Writing-all deterministically and optimally using a non-trivial number of asynchronous processors"],"prefix":"10.1145","author":[{"given":"Dariusz R.","family":"Kowalski","sequence":"first","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany and Uniwersytet Warszawski, Warszawa, Poland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander A.","family":"Shvartsman","sequence":"additional","affiliation":[{"name":"University of Connecticut, Storrs, CT and MIT CSAIL, Cambridge, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2004,6,27]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. of the 35th IEEE Symp. of Found. of Computer Science, FOCS'1994","author":"Ajtai M.","unstructured":"Ajtai , M. , Aspnes , J. , Dwork , C. , Waarts , O. : A theory of competitive analysis of distributed algorithms . Proc. of the 35th IEEE Symp. of Found. of Computer Science, FOCS'1994 , 401--411.]] Ajtai, M., Aspnes, J., Dwork, C., Waarts, O.: A theory of competitive analysis of distributed algorithms. Proc. of the 35th IEEE Symp. of Found. of Computer Science, FOCS'1994, 401--411.]]"},{"key":"e_1_3_2_1_2_1","volume-title":"Spencer","author":"Alon N.","year":"2000","unstructured":"Alon , N. , Spencer , J. : The probabilistic method. John Wiley , Second Edition ( 2000 ).]] Alon, N., Spencer, J.: The probabilistic method. John Wiley, Second Edition (2000).]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794319126"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. of the 33rd IEEE Symp. on Foundations of Computer Science, FOCS'1992","author":"Aumann Y.","unstructured":"Aumann , Y. , Rabin , M.O. : Clock construction in fully asynchronous parallel systems and PRAM simulation . Proc. of the 33rd IEEE Symp. on Foundations of Computer Science, FOCS'1992 , 147--156.]] Aumann, Y., Rabin, M.O.: Clock construction in fully asynchronous parallel systems and PRAM simulation. Proc. of the 33rd IEEE Symp. on Foundations of Computer Science, FOCS'1992, 147--156.]]"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. of the 34th IEEE Symp. on Foundations of Computer Science, FOCS'1993","author":"Aumann Y.","unstructured":"Aumann , Y. , Kedem , Z.M. , Palem , K.V. , Rabin , M.O. : Highly efficient asynchronous execution of large-grained parallel programs . Proc. of the 34th IEEE Symp. on Foundations of Computer Science, FOCS'1993 , 271--280.]] Aumann, Y., Kedem, Z.M., Palem, K.V., Rabin, M.O.: Highly efficient asynchronous execution of large-grained parallel programs. Proc. of the 34th IEEE Symp. on Foundations of Computer Science, FOCS'1993, 271--280.]]"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0003"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378685"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/97444.97673"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. of the 15th International Conference on Distributed Computing Systems, ICDCS'1995","author":"Dasgupta P.","unstructured":"Dasgupta , P. , Kedem , Z. , Rabin , M. : Parallel processing on networks of workstation: A fault-tolerant, high performance approach . Proc. of the 15th International Conference on Distributed Computing Systems, ICDCS'1995 , 467--474.]] Dasgupta, P., Kedem, Z., Rabin, M.: Parallel processing on networks of workstation: A fault-tolerant, high performance approach. Proc. of the 15th International Conference on Distributed Computing Systems, ICDCS'1995, 467--474.]]"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/197917.198082"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793255527"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. of the 36th IEEE Symp. on Foundations of Computer Science, FOCS'1995","author":"Galil Z.","unstructured":"Galil , Z. , Mayer , A. , Yung , M. : Resolving message complexity of byzantine agreement and beyond . Proc. of the 36th IEEE Symp. on Foundations of Computer Science, FOCS'1995 , 724--733.]] Galil, Z., Mayer, A., Yung, M.: Resolving message complexity of byzantine agreement and beyond. Proc. of the 36th IEEE Symp. on Foundations of Computer Science, FOCS'1995, 724--733.]]"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/72935.72953"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008930"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3271116.3271170"},{"key":"e_1_3_2_1_16_1","volume-title":"Shvartsman","author":"Kanellakis P.C.","year":"1997","unstructured":"Kanellakis , P.C. , Shvartsman , A.A. : Fault-tolerant parallel computation. Kluwer Academic Publishers ( 1997 ).]] Kanellakis, P.C., Shvartsman, A.A.: Fault-tolerant parallel computation. Kluwer Academic Publishers (1997).]]"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129742"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103459"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100231"},{"key":"e_1_3_2_1_20_1","volume-title":": The art of computer programming","author":"Knuth D.E.","year":"1998","unstructured":"Knuth , D.E. : The art of computer programming Vol. 3 ( third edition). Addison-Wesley Pub Co. ( 1998 ).]] Knuth, D.E.: The art of computer programming Vol. 3 (third edition). Addison-Wesley Pub Co. (1998).]]"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872075"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221063"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1017"},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. of the 32d IEEE Symp. on Foundations of Computer Science, FOCS'1990","author":"Martel C.","unstructured":"Martel , C. , Subramonian , R. , Park , A. : Asynchronous PRAMs are (almost) as good as synchronous PRAMs . Proc. of the 32d IEEE Symp. on Foundations of Computer Science, FOCS'1990 , 590--599.]] Martel, C., Subramonian, R., Park, A.: Asynchronous PRAMs are (almost) as good as synchronous PRAMs. Proc. of the 32d IEEE Symp. on Foundations of Computer Science, FOCS'1990, 590--599.]]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1943697.1943702"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791219670"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90156-C"}],"event":{"name":"SPAA04: 16th ACM Symposium on Parallelism in Algorithms and Architectures 2004","location":"Barcelona Spain","acronym":"SPAA04","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007912.1007964","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007912.1007964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:31:15Z","timestamp":1750249875000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007912.1007964"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,27]]},"references-count":27,"alternative-id":["10.1145\/1007912.1007964","10.1145\/1007912"],"URL":"https:\/\/doi.org\/10.1145\/1007912.1007964","relation":{},"subject":[],"published":{"date-parts":[[2004,6,27]]},"assertion":[{"value":"2004-06-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}