{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:25Z","timestamp":1763467945020,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,8,10]],"date-time":"2009-08-10T00:00:00Z","timestamp":1249862400000},"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":[[2009,8,10]]},"DOI":"10.1145\/1582716.1582728","type":"proceedings-article","created":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T13:29:27Z","timestamp":1249997367000},"page":"36-45","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Max registers, counters, and monotone circuits"],"prefix":"10.1145","author":[{"given":"James","family":"Aspnes","sequence":"first","affiliation":[{"name":"Yale University, New Haven, CT, USA"}]},{"given":"Hagit","family":"Attiya","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Keren","family":"Censor","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]}],"member":"320","published-online":{"date-parts":[[2009,8,10]]},"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\/1496770.1496819"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700366000"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(76)90071-5"},{"issue":"2","key":"e_1_3_2_1_5_1","first-page":"194","article-title":"Universal codeword sets and representations of the integers. Information Theory","volume":"21","author":"Elias P.","year":"1975","journal-title":"IEEE Transactions on"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.47"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/645951.675482"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797317299"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/645467.654122"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.24"}],"event":{"name":"PODC '09: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Calgary AB Canada","acronym":"PODC '09"},"container-title":["Proceedings of the 28th ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1582716.1582728","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1582716.1582728","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:57Z","timestamp":1750249077000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1582716.1582728"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,10]]},"references-count":10,"alternative-id":["10.1145\/1582716.1582728","10.1145\/1582716"],"URL":"https:\/\/doi.org\/10.1145\/1582716.1582728","relation":{},"subject":[],"published":{"date-parts":[[2009,8,10]]},"assertion":[{"value":"2009-08-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}