{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:29:43Z","timestamp":1725618583658},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,23]]},"DOI":"10.1145\/1146381.1146388","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"16-25","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Quorum placement in networks"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Golovin","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]},{"given":"Anupam","family":"Gupta","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]},{"given":"Bruce M.","family":"Maggs","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA and Akamai Technologies, Cambridge, MA"}]},{"given":"Florian","family":"Oprea","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]},{"given":"Michael K.","family":"Reiter","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]}],"member":"320","published-online":{"date-parts":[[2006,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00017-9"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676860"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777418"},{"key":"e_1_3_2_1_4_1","first-page":"185","volume-title":"SODA '99: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Chekuri Chandra","year":"1999","unstructured":"Chandra Chekuri and Sanjeev Khanna . On multi-dimensional packing problems . In SODA '99: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms , pages 185 -- 194 , 1999 . Chandra Chekuri and Sanjeev Khanna. On multi-dimensional packing problems. In SODA '99: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 185--194, 1999."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.180609"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930050043"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00535-2"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.569655"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/800215.806583"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11516798_23"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073829"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777419"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384014"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0164-1212(01)00023-1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.1993.287710"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/72935.72970"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/214438.214445"},{"key":"e_1_3_2_1_19_1","first-page":"284","volume-title":"IEEE Symposium on Foundations of Computer Science","author":"Maggs B. M.","year":"1997","unstructured":"B. M. Maggs , F. Meyer auf~der Heide, B. Vocking, and M. Westermann. Exploiting locality for data management in systems of limited bandwidth . In IEEE Symposium on Foundations of Computer Science , pages 284 -- 293 , 1997 . B. M. Maggs, F. Meyer auf~der Heide, B. Vocking, and M. Westermann. Exploiting locality for data management in systems of limited bandwidth. In IEEE Symposium on Foundations of Computer Science, pages 284--293, 1997."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797325235"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3054"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795281232"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1169"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050027"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652152"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22154"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875563"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/320071.320076"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.762814"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211027"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802479"},{"key":"e_1_3_2_1_32_1","volume-title":"Heinz Nixdorf Institut","author":"Westermann M.","year":"2001","unstructured":"M. Westermann . Caching in Networks : Non-Uniform Algorithms and Memory Capacity Constraints. Dissertation, Universit\u00e4t Paderborn , Heinz Nixdorf Institut , Theoretische Informatik , 2001 . M. Westermann. Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints. Dissertation, Universit\u00e4t Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, 2001."}],"event":{"name":"PODC06: ACM Symposium on Principles of Distributed Computing 2006","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":"Denver Colorado USA","acronym":"PODC06"},"container-title":["Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1146381.1146388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T00:00:08Z","timestamp":1673481608000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1146381.1146388"}},"subtitle":["minimizing network congestion"],"short-title":[],"issued":{"date-parts":[[2006,7,23]]},"references-count":32,"alternative-id":["10.1145\/1146381.1146388","10.1145\/1146381"],"URL":"https:\/\/doi.org\/10.1145\/1146381.1146388","relation":{},"subject":[],"published":{"date-parts":[[2006,7,23]]},"assertion":[{"value":"2006-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}