{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:18:35Z","timestamp":1740133115413,"version":"3.37.3"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2015,3,1]],"date-time":"2015-03-01T00:00:00Z","timestamp":1425168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["210389"],"award-info":[{"award-number":["210389"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["259085"],"award-info":[{"award-number":["259085"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Alon Fellowship"},{"name":"ATS-WD Career Development Chair"},{"name":"Loewengart Research Fund"},{"name":"Intel ICRI-CI Center"},{"name":"Israel Ministry of Science and Technology"},{"DOI":"10.13039\/501100005386","name":"Israeli Centers of Research Excellence","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005386","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Technion Funds for Security research","award":["4\/11"],"award-info":[{"award-number":["4\/11"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2015,3,1]]},"DOI":"10.1109\/tpds.2014.2314683","type":"journal-article","created":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T14:02:09Z","timestamp":1396360929000},"page":"796-809","source":"Crossref","is-referenced-by-count":13,"title":["Maximizing the Throughput of Hash Tables in Network Devices with Combined SRAM\/DRAM Memory"],"prefix":"10.1109","volume":"26","author":[{"given":"Yossi","family":"Kanizo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Hay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isaac","family":"Keslassy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1142\/6023"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF01858439"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20044"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(80)90172-7","article-title":"Matchings in random regular bipartite digraphs","volume":"31","author":"david","year":"1980","journal-title":"Discrete Math"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0987-0"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/BF02124750"},{"year":"0","key":"ref36"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/0135006"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20259"},{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84882-765-3_9","article-title":"Hash-Based Techniques for High-Speed Packet Processing","author":"kirsch","year":"2010","journal-title":"Algorithms for Next Generation Networks"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010106"},{"key":"ref11","first-page":"255","article-title":"The Power of Two Random Choices: A Survey of Techniques and Results","volume":"1","author":"mitzenmacher","year":"0","journal-title":"Handbook of Randomized Computing"},{"key":"ref12","first-page":"121","article-title":"Cuckoo hashing","author":"pagh","year":"0","journal-title":"Proc of the 9th Annual European Symp on Algorithms"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1063\/1.3051024"},{"year":"0","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2151171.2151174"},{"year":"0","key":"ref17"},{"key":"ref18","first-page":"213","article-title":"Tight thresholds for cuckoo hashing via XORSAT","author":"dietzfelbinger","year":"0","journal-title":"Proc 37th Int Colloq Automata Lang Program"},{"key":"ref19","first-page":"746","article-title":"Why simple hash functions work: Exploiting the entropy in a data stream","author":"mitzenmacher","year":"0","journal-title":"Proc 19th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.29"},{"journal-title":"TCP\/IP Illustrated","year":"0","author":"wright","key":"ref4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.899058"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007921"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.30"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2012.11.007"},{"key":"ref5","first-page":"877","article-title":"Bloom filters via d-left hashing and dynamic bit reassignment","author":"bonomi","year":"0","journal-title":"Proc 44th Annu Allerton Conf Commun Control Comput"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/080728743"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062178"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814585"},{"key":"ref9","first-page":"81","article-title":"A further analysis of cuckoo hashing with a stash and random graphs of excess $r$","volume":"12","author":"kutzelnigg","year":"2010","journal-title":"Discrete Math Theoretical Comput Sci"},{"journal-title":"The Power of Two Choices in Randomized Load Balancing","year":"1996","author":"mitzenmacher","key":"ref1"},{"journal-title":"Combinatorial Species and Tree-Like Structures","year":"1998","author":"bergeron","key":"ref46"},{"key":"ref20","first-page":"593","article-title":"Balanced allocations","author":"azar","year":"0","journal-title":"Proc 26th Annu ACM Symp Theory Comput"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100036173"},{"key":"ref22","first-page":"107","article-title":"De-amortized cuckoo hashing: Provable worst-case performance and experimental results","author":"arbitman","year":"0","journal-title":"Proc 36th Int Colloq Automata Lang Program"},{"key":"ref21","first-page":"631","article-title":"History-independent cuckoo hashing","author":"naor","year":"0","journal-title":"Proc 35th Int Colloq Automata Lang Program"},{"year":"0","key":"ref42"},{"key":"ref24","first-page":"1","article-title":"Some open questions related to cuckoo hashing","author":"mitzenmacher","year":"0","journal-title":"Proc 17th Annu Eur Symp Algorithms"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.131"},{"key":"ref23","first-page":"490","article-title":"An analysis of random-walk cuckoo hashing","author":"frieze","year":"0","journal-title":"Proc Int Workshop Approximation Randomization Combinatorial Optimization Algorithms Tech"},{"journal-title":"Graph Theory","year":"2005","author":"diestel","key":"ref44"},{"key":"ref26","first-page":"43","article-title":"Multilevel adaptive hashing","author":"broder","year":"0","journal-title":"Proc Annu ACM-SIAM Symp Discrete Algorithm"},{"year":"0","key":"ref43"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30045-5_11"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/7036147\/06781627.pdf?arnumber=6781627","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:41:25Z","timestamp":1641987685000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6781627\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,1]]},"references-count":46,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2014.2314683","relation":{},"ISSN":["1045-9219"],"issn-type":[{"type":"print","value":"1045-9219"}],"subject":[],"published":{"date-parts":[[2015,3,1]]}}}