{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:27Z","timestamp":1750306647328,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T00:00:00Z","timestamp":1405382400000},"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":[[2014,7,15]]},"DOI":"10.1145\/2611462.2611485","type":"proceedings-article","created":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T12:20:56Z","timestamp":1405426856000},"page":"124-133","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Estimation for monotone sampling"],"prefix":"10.1145","author":[{"given":"Edith","family":"Cohen","sequence":"first","affiliation":[{"name":"Microsoft Research, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,7,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247504"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-842X.1972.tb00899.x"},{"key":"e_1_3_2_1_3_1","first-page":"21","volume-title":"Proceedings of the Compression and Complexity of Sequences","author":"Broder A. Z.","year":"1997","unstructured":"A. Z. Broder . On the resemblance and containment of documents . In Proceedings of the Compression and Complexity of Sequences , pages 21 -- 29 . IEEE, 1997 . A. Z. Broder. On the resemblance and containment of documents. In Proceedings of the Compression and Complexity of Sequences, pages 21--29. IEEE, 1997."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/647819.736184"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.836103"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1534"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594546"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512944"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.10.016"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281133"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453884"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555379"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989288"},{"key":"e_1_3_2_1_16_1","volume-title":"RANDOM","author":"Cohen E.","year":"2013","unstructured":"E. Cohen and H. Kaplan . What you can do with coordinated samples . In RANDOM , 2013 . http:\/\/arxiv.org\/abs\/1206.5637. E. Cohen and H. Kaplan. What you can do with coordinated samples. In RANDOM, 2013. http:\/\/arxiv.org\/abs\/1206.5637."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687701"},{"key":"e_1_3_2_1_18_1","first-page":"66","volume-title":"Proc. Pacific Rim International Symposium on Fault-Tolerant Systems","author":"Cohen E.","year":"1995","unstructured":"E. Cohen , Y.-M. Wang , and G. Suri . When piecewise determinism is almost true . In Proc. Pacific Rim International Symposium on Fault-Tolerant Systems , pages 66 -- 71 , December 1995 . E. Cohen, Y.-M. Wang, and G. Suri. When piecewise determinism is almost true. In Proc. Pacific Rim International Symposium on Fault-Tolerant Systems, pages 66--71, December 1995."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242610"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1314690.1314696"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378687"},{"key":"e_1_3_2_1_22_1","volume-title":"VLDB","author":"Gibbons P. B.","year":"2001","unstructured":"P. B. Gibbons . Distinct sampling for highly-accurate answers to distinct values queries and event reports . In VLDB 2001 . P. B. Gibbons. Distinct sampling for highly-accurate answers to distinct values queries and event reports. In VLDB 2001."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453883"},{"key":"e_1_3_2_1_24_1","volume-title":"Sampling from a finite population","author":"H\u00e1jek J.","year":"1981","unstructured":"J. H\u00e1jek . Sampling from a finite population . Marcel Dekker , New York , 1981 . J. H\u00e1jek. Sampling from a finite population. Marcel Dekker, New York, 1981."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1952.10483446"},{"key":"e_1_3_2_1_26_1","volume-title":"Vol 2, Seminumerical Algorithms","author":"Knuth D. E.","year":"1968","unstructured":"D. E. Knuth . The Art of Computer Programming , Vol 2, Seminumerical Algorithms . Addison-Wesley , 1 st edition, 1968 . D. E. Knuth. The Art of Computer Programming, Vol 2, Seminumerical Algorithms. Addison-Wesley, 1st edition, 1968.","edition":"1"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01893822"},{"key":"e_1_3_2_1_28_1","volume-title":"NIPS","author":"Li P.","year":"2008","unstructured":"P. Li , , K. W. Church , and T. Hastie . One sketch for all: Theory and application of conditional random sampling . In NIPS , 2008 . P. Li, , K. W. Church, and T. Hastie. One sketch for all: Theory and application of conditional random sampling. In NIPS, 2008."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146401"},{"key":"e_1_3_2_1_30_1","volume-title":"Theory and Methods of Survey Sampling. PHI learning","author":"Mukhopandhyay P.","year":"2008","unstructured":"P. Mukhopandhyay . Theory and Methods of Survey Sampling. PHI learning , New Delhi , 2 edition, 2008 . P. Mukhopandhyay. Theory and Methods of Survey Sampling. PHI learning, New Delhi, 2 edition, 2008."},{"issue":"2","key":"e_1_3_2_1_31_1","first-page":"149","article-title":"Sequential poisson sampling","volume":"14","author":"Ohlsson E.","year":"1998","unstructured":"E. Ohlsson . Sequential poisson sampling . J. Official Statistics , 14 ( 2 ): 149 -- 162 , 1998 . E. Ohlsson. Sequential poisson sampling. J. Official Statistics, 14(2):149--162, 1998.","journal-title":"J. Official Statistics"},{"key":"e_1_3_2_1_32_1","first-page":"255","volume-title":"The 2nd International Conference on Establishment Surveys","author":"Ohlsson E.","year":"2000","unstructured":"E. Ohlsson . Coordination of pps samples over time . In The 2nd International Conference on Establishment Surveys , pages 255 -- 264 . American Statistical Association , 2000 . E. Ohlsson. Coordination of pps samples over time. In The 2nd International Conference on Establishment Surveys, pages 255--264. American Statistical Association, 2000."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177692620"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-3758(96)00185-1"},{"key":"e_1_3_2_1_35_1","first-page":"697","volume-title":"Proc. of the Section on Survey Research Methods, Alexandria VA","author":"Saavedra P. J.","year":"1995","unstructured":"P. J. Saavedra . Fixed sample size pps approximations with a permanent random number . In Proc. of the Section on Survey Research Methods, Alexandria VA , pages 697 -- 700 . American Statistical Association , 1995 . P. J. Saavedra. Fixed sample size pps approximations with a permanent random number. In Proc. of the Section on Survey Research Methods, Alexandria VA, pages 697--700. American Statistical Association, 1995."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"}],"event":{"name":"PODC '14: 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":"Paris France","acronym":"PODC '14"},"container-title":["Proceedings of the 2014 ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2611462.2611485","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2611462.2611485","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:56:05Z","timestamp":1750229765000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2611462.2611485"}},"subtitle":["competitiveness and customization"],"short-title":[],"issued":{"date-parts":[[2014,7,15]]},"references-count":34,"alternative-id":["10.1145\/2611462.2611485","10.1145\/2611462"],"URL":"https:\/\/doi.org\/10.1145\/2611462.2611485","relation":{},"subject":[],"published":{"date-parts":[[2014,7,15]]},"assertion":[{"value":"2014-07-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}