{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T04:48:49Z","timestamp":1771476529419,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T00:00:00Z","timestamp":1554681600000},"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":[[2019,4,8]]},"DOI":"10.1145\/3297280.3297335","type":"proceedings-article","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:18:47Z","timestamp":1556713127000},"page":"582-589","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Quotient hash tables"],"prefix":"10.1145","author":[{"given":"R\u00e9mi","family":"G\u00e9raud","sequence":"first","affiliation":[{"name":"Research University, Paris, France and Ingenico Labs Advanced Research, Paris, France"}]},{"given":"Marius","family":"Lombard-Platet","sequence":"additional","affiliation":[{"name":"Research University, Paris, France and Be-Studys, Geneva, Switzerland"}]},{"given":"David","family":"Naccache","sequence":"additional","affiliation":[{"name":"Research University, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2019,4,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/977401.978165"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2652524.2652556"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872787"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142477"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536354.2536359"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2750482.2750507"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989289"},{"key":"e_1_3_2_1_12_1","volume-title":"Optimal Lower Bounds for Universal Relation, and for Samplers and Finding Duplicates in Streams","author":"Kapralov Michael","unstructured":"Michael Kapralov, Jelani Nelson, Jakub Pachocki, Zhengyu Wang, David P. Woodruff, and Mobin Yahyazadeh. 2017. Optimal Lower Bounds for Universal Relation, and for Samplers and Finding Duplicates in Streams. In FOCS. IEEE Computer Society, 475--486."},{"key":"e_1_3_2_1_13_1","volume-title":"Securware 2015 - The Ninth International Conference on Emerging Security Information, Systems and Technologies\" (SECURWARE '15)","author":"K\u00f8ien Geir","year":"2015","unstructured":"Geir K\u00f8ien. 2015. A Brief Survey of Nonces and Nonce Usage. In Securware 2015 - The Ninth International Conference on Emerging Security Information, Systems and Technologies\" (SECURWARE '15). IARIA XPS Press, 85--91."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060753"},{"key":"e_1_3_2_1_15_1","unstructured":"Sebastian Nagel. 2018. April 2018 Crawl Archive Now Available. http:\/\/commoncrawl.org\/2018\/05\/april-2018-crawl-archive-now-available\/."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_28"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-008-9192-1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.031611.00024"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/647762.735491"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1685872.1685986"}],"event":{"name":"SAC '19: The 34th ACM\/SIGAPP Symposium on Applied Computing","location":"Limassol Cyprus","acronym":"SAC '19","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"]},"container-title":["Proceedings of the 34th ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297280.3297335","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3297280.3297335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:15Z","timestamp":1750208535000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297280.3297335"}},"subtitle":["efficiently detecting duplicates in streaming data"],"short-title":[],"issued":{"date-parts":[[2019,4,8]]},"references-count":20,"alternative-id":["10.1145\/3297280.3297335","10.1145\/3297280"],"URL":"https:\/\/doi.org\/10.1145\/3297280.3297335","relation":{},"subject":[],"published":{"date-parts":[[2019,4,8]]},"assertion":[{"value":"2019-04-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}