{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:51Z","timestamp":1750219851230,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T00:00:00Z","timestamp":1686960000000},"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":[[2023,6,17]]},"DOI":"10.1145\/3558481.3591312","type":"proceedings-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T22:22:03Z","timestamp":1685571723000},"page":"291-294","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Brief Announcement: A Parallel Architecture for Dynamic Approximate Membership"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5407-330X","authenticated-orcid":false,"given":"Guy","family":"Even","sequence":"first","affiliation":[{"name":"Tel-Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3887-0247","authenticated-orcid":false,"given":"Gabriel","family":"Marques Domingues","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-6340-7761","authenticated-orcid":false,"given":"Parham","family":"Toutian","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.80"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SWAT.2020.11"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-83508-8_11"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804332"},{"key":"e_1_3_2_1_7_1","volume-title":"Rasmus Pagh, and Mihai P\u015ftra\u00e4cu.","author":"Demaine Erik D","year":"2006","unstructured":"Erik D Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, and Mihai P\u015ftra\u00e4cu. 2006. De dictionariis dynamicis pauco spatio utentibus. In Latin American Symposium on Theoretical Informatics. Springer, 349--361."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/3523210.3523211"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00055"},{"volume-title":"Practical PRAM programming","author":"Keller J\u00f6rg","key":"e_1_3_2_1_11_1","unstructured":"J\u00f6rg Keller, Christoph Ke\u00dfler, and Jesper Tr\u00e4ff. 2001. Practical PRAM programming. WileyInterscience, J. Wiley & Sons, Inc."},{"key":"e_1_3_2_1_12_1","volume-title":"Searching and sorting. Reading MA: Addison-Wisley","author":"Knuth Donald E","year":"1973","unstructured":"Donald E Knuth. 1973. The art of computer programming, vol. 3: Searching and sorting. Reading MA: Addison-Wisley (1973)."},{"volume-title":"An optimal Bloom filter replacement","author":"Pagh Anna","key":"e_1_3_2_1_13_1","unstructured":"Anna Pagh, Rasmus Pagh, and S. Srinivasa Rao. 2005. An optimal Bloom filter replacement. In SODA. SIAM, 823--829."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452841"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2220357.2220361"},{"key":"e_1_3_2_1_16_1","first-page":"4","article-title":"Cache-, hash-, and space-efficient Bloom filters","volume":"14","author":"Putze Felix","year":"2010","unstructured":"Felix Putze, Peter Sanders, and Johannes Singler. 2010. Cache-, hash-, and space-efficient Bloom filters. Journal of Experimental Algorithmics (JEA), Vol. 14 (2010), 4--4.","journal-title":"Journal of Experimental Algorithmics (JEA)"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90005-P"},{"key":"e_1_3_2_1_18_1","unstructured":"Xilinx Inc. 2020. Alveo U200 and U250 Data Center Accelerator Cards Data Sheet."}],"event":{"name":"SPAA '23: 35th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Orlando FL USA","acronym":"SPAA '23"},"container-title":["Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591312","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558481.3591312","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:07Z","timestamp":1750178827000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591312"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,17]]},"references-count":18,"alternative-id":["10.1145\/3558481.3591312","10.1145\/3558481"],"URL":"https:\/\/doi.org\/10.1145\/3558481.3591312","relation":{},"subject":[],"published":{"date-parts":[[2023,6,17]]},"assertion":[{"value":"2023-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}