{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T09:30:30Z","timestamp":1687167030344},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,11,5]],"date-time":"2010-11-05T00:00:00Z","timestamp":1288915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00224-010-9297-0","type":"journal-article","created":{"date-parts":[[2010,11,4]],"date-time":"2010-11-04T18:05:10Z","timestamp":1288893910000},"page":"279-295","source":"Crossref","is-referenced-by-count":1,"title":["Layered Hashing Algorithm for Real-time Systems"],"prefix":"10.1007","volume":"50","author":[{"given":"Matan","family":"Mandelbrod","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,5]]},"reference":[{"key":"9297_CR1","first-page":"513","volume-title":"Sorting and Searching","author":"D. Knuth","year":"1998","unstructured":"Knuth, D.: The art of computer programming. In: Sorting and Searching, 2nd edn., vol. 3, pp. 513\u2013558. Addison-Wesley, Reading (1998). Sect. 6.4: Hashing","edition":"2"},{"key":"9297_CR2","first-page":"221","volume-title":"Hash Tables","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 21nd edn. In: Hash Tables, pp. 221\u2013252. MIT Press, Cambridge (2001). Chap. 11"},{"issue":"3","key":"9297_CR3","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/JSSC.2005.864128","volume":"41","author":"K. Pagiamtzis","year":"2006","unstructured":"Pagiamtzis, K., Sheikholeslami, A.: Content-addressable memory (CAM) circuits and architectures: a tutorial and survey. IEEE J. Solid-State Circuits 41(3), 712\u2013727 (2006). http:\/\/www.pagiamtzis.com\/pubs\/pagiamtzis-jssc2006.pdf","journal-title":"IEEE J. Solid-State Circuits"},{"key":"9297_CR4","unstructured":"Wimax Forum: http:\/\/www.wimaxforum.org\/"},{"key":"9297_CR5","unstructured":"IEEE Std 802\u20132001. IEEE standard for local and metropolitan area networks: overview and architecture. http:\/\/standards.ieee.org\/getieee802\/download\/802-2001.pdf"},{"key":"9297_CR6","unstructured":"Kirsch, A., Mitzenmacher, M., Varghese, G.: Hash-based techniques for high-speed packet processing. http:\/\/www.eecs.harvard.edu\/~michaelm\/postscripts\/dimacschapter-08.pdf"},{"key":"9297_CR7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/322248.322254","volume":"28","author":"G.H. Gonnet","year":"1981","unstructured":"Gonnet, G.H.: Expected length of the longest probe sequence in hash code searching. J. Assoc. Comput. Mach. 28, 289\u2013304 (1981)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9297_CR8","unstructured":"Broder, A., Mitzenmacher, M.: Using multiple hash functions to improve IP lookups. In: IEEE INFOCOM 2001"},{"issue":"1","key":"9297_CR9","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y. Azar","year":"1999","unstructured":"Azar, Y., Broder, A., Karlin, A.R., Upfal, E.: Balanced allocations. SIAM J. Comput. 29(1), 180\u2013200 (1999)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9297_CR10","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1145\/792538.792546","volume":"50","author":"B. V\u00f6cking","year":"2003","unstructured":"V\u00f6cking, B.: How asymmetry helps load balancing. J. ACM 50(4), 568\u2013589 (2003)","journal-title":"J. ACM"},{"key":"9297_CR11","first-page":"43","volume-title":"Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"A. Broder","year":"1990","unstructured":"Broder, A., Karlin, A.R.: Multilevel adaptive hashing. In: Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 43\u201353 (1990)"},{"key":"9297_CR12","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.tcs.2007.02.054","volume":"380","author":"M. Dietzfelbinger","year":"2007","unstructured":"Dietzfelbinger, M., Weidling, C.: Balanced allocation and dictionaries with tightly packed constant size bins. Theor. Comput. Sci. 380, 47\u201368 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9297_CR13","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0020-0190(02)00500-8","volume":"86","author":"L. Devroye","year":"2003","unstructured":"Devroye, L., Morin, P.: Cuckoo hashing: further analysis. Inform. Process. Lett. 86(4), 215\u2013219 (2003)","journal-title":"Inform. Process. Lett."},{"key":"9297_CR14","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R. Pagh","year":"2004","unstructured":"Pagh, R., Rodler, F.: Cuckoo hashing. J. Algorithms 51, 122\u2013144 (2004)","journal-title":"J. Algorithms"},{"key":"9297_CR15","unstructured":"Lu, Y., Montanari, A., Prabhakar, B., Dharmapurikar, S., Kabbani, A.: Counter braids: a novel counter architecture for per-flow measurement. In: Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), 2008"},{"key":"9297_CR16","unstructured":"Kirsch, A., Mitzenmacher, M.: The power of one move: hashing schemes for hardware. In: Proceedings of the 27th IEEE International Conference on Computer Communications (INFOCOM), 2008"},{"key":"9297_CR17","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/1080091.1080114","volume-title":"Proceedings of ACM SIGCOMM","author":"H. Song","year":"2005","unstructured":"Song, H., Dharmapurikar, S., Turner, J., Lockwood, J.: Fast hash table lookup using extended Bloom filter: an aid to network processing. In: Proceedings of ACM SIGCOMM, pp. 181\u2013192 (2005)"},{"issue":"5","key":"9297_CR18","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1038\/scientificamerican0573-15","volume":"228","author":"H. Feistel","year":"1973","unstructured":"Feistel, H.: Cryptography and computer privacy. Sci. Am. 228(5), 15\u201323 (1973)","journal-title":"Sci. Am."},{"key":"9297_CR19","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W. Feller","year":"1968","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications, vol.\u00a01, 3rd edn. Wiley, New York (1968), pp. 31\u201332","edition":"3"},{"key":"9297_CR20","volume-title":"Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. 9th printing","year":"1972","unstructured":"Abramowitz, M., Stegun, I.A. (eds.): Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. 9th printing. Dover, New York (1972), p. 260"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-010-9297-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-010-9297-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-010-9297-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T03:39:35Z","timestamp":1685849975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-010-9297-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,5]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["9297"],"URL":"https:\/\/doi.org\/10.1007\/s00224-010-9297-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,5]]}}}