{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:00Z","timestamp":1750307460239,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T00:00:00Z","timestamp":1280016000000},"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":[[2010,7,25]]},"DOI":"10.1145\/1835698.1835730","type":"proceedings-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:11Z","timestamp":1280239811000},"page":"122-123","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief announcement"],"prefix":"10.1145","author":[{"given":"Benito","family":"van der Zander","sequence":"first","affiliation":[{"name":"Heinrich Heine University, D\u00fcsseldorf, Germany"}]},{"given":"Egon","family":"Wanke","sequence":"additional","affiliation":[{"name":"Heinrich Heine University, D\u00fcsseldorf, Germany"}]},{"given":"Wolfgang","family":"Kiess","sequence":"additional","affiliation":[{"name":"Heinrich Heine University, D\u00fcsseldorf, Germany"}]},{"given":"Bj\u00f6rn","family":"Scheuermann","sequence":"additional","affiliation":[{"name":"Heinrich Heine University, D\u00fcsseldorf, Germany"}]}],"member":"320","published-online":{"date-parts":[[2010,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Computers and Intractability: Guide to the Theory of NP-Completeness","author":"Garey M.","year":"1979","unstructured":"M. Garey and D. Johnson . Computers and Intractability: Guide to the Theory of NP-Completeness . W. H. Freeman and Company , 1979 . M. Garey and D. Johnson. Computers and Intractability: Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159923"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1639562.1639564"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.925946"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1023646.1023660"}],"event":{"name":"PODC '10: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Zurich Switzerland","acronym":"PODC '10"},"container-title":["Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835698.1835730","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1835698.1835730","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:23Z","timestamp":1750248503000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835698.1835730"}},"subtitle":["complexity and solution of the send-receive correlation problem"],"short-title":[],"issued":{"date-parts":[[2010,7,25]]},"references-count":6,"alternative-id":["10.1145\/1835698.1835730","10.1145\/1835698"],"URL":"https:\/\/doi.org\/10.1145\/1835698.1835730","relation":{},"subject":[],"published":{"date-parts":[[2010,7,25]]},"assertion":[{"value":"2010-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}