{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:05:05Z","timestamp":1725674705918},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642293436"},{"type":"electronic","value":"9783642293443"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29344-3_43","type":"book-chapter","created":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T14:19:29Z","timestamp":1334067569000},"page":"506-517","source":"Crossref","is-referenced-by-count":3,"title":["Independence of Tabulation-Based Hash Classes"],"prefix":"10.1007","author":[{"given":"Toryn Qwyllyn","family":"Klassen","sequence":"first","affiliation":[]},{"given":"Philipp","family":"Woelfel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"43_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. Carter","year":"1979","unstructured":"Carter, J., Wegman, M.: Universal classes of hash functions. Journal of Computer and System Sciences\u00a018(2), 143\u2013154 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"43_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-642-02927-1_30","volume-title":"Automata, Languages and Programming","author":"M. Dietzfelbinger","year":"2009","unstructured":"Dietzfelbinger, M., Rink, M.: Applications of a Splitting Trick. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 354\u2013365. Springer, Heidelberg (2009)"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Dietzfelbinger, M., Woelfel, P.: Almost random graphs with simple hash functions. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), pp. 629\u2013638 (2003)","DOI":"10.1145\/780542.780634"},{"key":"43_CR4","unstructured":"Klassen, T.Q., Woelfel, P.: Independence of tabulation-based hash classes. E-print arXiv:1112.3323 (2011), \n                  \n                    http:\/\/arxiv.org\/abs\/1112.3323"},{"issue":"3","key":"43_CR5","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1137\/070702278","volume":"39","author":"A. Pagh","year":"2009","unstructured":"Pagh, A., Pagh, R., Ru\u017ei\u0107, M.: Linear probing with constant independence. SIAM Journal on Computing\u00a039(3), 1107\u20131120 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"P\u01cetra\u015fcu, M., Thorup, M.: The power of simple tabulation hashing. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC), pp. 1\u201310 (2011)","DOI":"10.1145\/1993636.1993638"},{"issue":"4\/5","key":"43_CR7","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/BF01940876","volume":"16","author":"R. Seidel","year":"1996","unstructured":"Seidel, R., Aragon, C.R.: Randomized search trees. Algorithmica\u00a016(4\/5), 464\u2013497 (1996)","journal-title":"Algorithmica"},{"issue":"3","key":"43_CR8","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/S0097539701386216","volume":"33","author":"A. Siegel","year":"2004","unstructured":"Siegel, A.: On universal classes of extremely random constant-time hash functions. SIAM Journal on Computing\u00a033(3), 505\u2013543 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"43_CR9","unstructured":"Thorup, M., Zhang, Y.: Tabulation based 4-universal hashing with applications to second moment estimation. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 615\u2013624 (2004)"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zhang, Y.: Tabulation based 5-universal hashing and linear probing. In: Proceedings of the 12th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 62\u201376 (2010)","DOI":"10.1137\/1.9781611972900.7"}],"container-title":["Lecture Notes in Computer Science","LATIN 2012: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29344-3_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:35:40Z","timestamp":1620128140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29344-3_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642293436","9783642293443"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29344-3_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}