{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:36:13Z","timestamp":1742916973638,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031435867"},{"type":"electronic","value":"9783031435874"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43587-4_15","type":"book-chapter","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T01:02:10Z","timestamp":1695258130000},"page":"205-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounds for c-Ideal Hashing"],"prefix":"10.1007","author":[{"given":"Fabian","family":"Frei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Wehner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,21]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198522355.001.0001","volume-title":"Poisson Approximation","author":"AD Barbour","year":"1992","unstructured":"Barbour, A.D., Holst, L., Janson, S.: Poisson Approximation. Clarendon Press, Oxford (1992)"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1006\/jcta.1999.3050","volume":"92","author":"SR Blackburn","year":"2000","unstructured":"Blackburn, S.R.: Perfect hash families: probabilistic methods and explicit constructions. J. Comb. Theory Ser. A 92(1), 54\u201360 (2000)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L Carter","year":"1979","unstructured":"Carter, L., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci. 18(2), 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Chi, L., Zhu, X.: Hashing techniques: a survey and taxonomy. 50(1) (2017)","DOI":"10.1145\/3047307"},{"key":"15_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05472-3","volume-title":"Algorithmen und Datenstrukturen","author":"M Dietzfelbinger","year":"2014","unstructured":"Dietzfelbinger, M., Mehlhorn, K., Sanders, P.: Algorithmen und Datenstrukturen. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-05472-3"},{"issue":"5","key":"15_CR6","first-page":"1","volume":"7","author":"M Dietzfelbinger","year":"2017","unstructured":"Dietzfelbinger, M., Mitzenmacher, M., Pagh, R., Woodruff, D.P., Aum\u00fcller, M.: Theory and applications of hashing (dagstuhl seminar 17181). Dagstuhl Rep. 7(5), 1\u201321 (2017)","journal-title":"Dagstuhl Rep."},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/(SICI)1098-2418(199809)13:2<99::AID-RSA1>3.0.CO;2-M","volume":"13","author":"DP Dubhashi","year":"1998","unstructured":"Dubhashi, D.P., Ranjan, D.: Balls and bins: a study in negative dependence. Random Struct. Algorithms 13(2), 99\u2013124 (1998)","journal-title":"Random Struct. Algorithms"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/0605009","volume":"5","author":"ML Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J.: On the size of separating systems and families of perfect hash functions. SIAM J. Alg. Disc. Meth. 5, 61\u201368 (1984)","journal-title":"SIAM J. Alg. Disc. Meth."},{"issue":"2","key":"15_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/322248.322254","volume":"28","author":"GH Gonnet","year":"1981","unstructured":"Gonnet, G.H.: Expected length of the longest probe sequence in hash code searching. J. ACM 28(2), 289\u2013304 (1981)","journal-title":"J. ACM"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Riazanov, A.: Beating Fredman-Koml\u00f3s for perfect k-hashing. J. Comb. Theory, Ser. A 188, 105580 (2022)","DOI":"10.1016\/j.jcta.2021.105580"},{"key":"15_CR11","unstructured":"Hansel, G.: Nombre minimal de contacts de fermeture n\u00e9cessaires pour r\u00e9aliser une fonction bool\u00e9enne sym\u00e9trique de n variables. Comptes Rendus Hebdomadaires des S\u00e9ances de l\u2019Acad\u00e9mie des Sciences, 258 (1964)"},{"issue":"2","key":"15_CR12","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"RM Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249\u2013260 (1987)","journal-title":"IBM J. Res. Dev."},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"Komm, D.: An Introduction to Online Computation - Determinism, Randomization, Advice. Texts in Theoretical Computer Science. An EATCS Series. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-42749-2","DOI":"10.1007\/978-3-319-42749-2"},{"issue":"4","key":"15_CR14","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1137\/0607062","volume":"7","author":"J K\u00f6rner","year":"1986","unstructured":"K\u00f6rner, J.: Fredman-koml\u00f3s bounds and information theory. SIAM J. Algebraic Discrete Methods 7(4), 560\u2013570 (1986)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Luby, M., Wigderson, A.: Pairwise independence and derandomization. Foundations and Trends in Theoretical Computer Science 1(4) (2005)","DOI":"10.1561\/0400000009"},{"key":"15_CR16","doi-asserted-by":"publisher","unstructured":"Mehlhorn, K.: Data Structures and Algorithms 1: Sorting and Searching, volume 1 of EATCS Monographs on Theoretical Computer Science. Springer (1984). https:\/\/doi.org\/10.1007\/978-3-642-69672-5","DOI":"10.1007\/978-3-642-69672-5"},{"key":"15_CR17","doi-asserted-by":"publisher","unstructured":"Mehlhorn, K., Sanders, P.: Algorithms and Data Structures: The Basic Toolbox. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-77978-0","DOI":"10.1007\/978-3-540-77978-0"},{"key":"15_CR18","volume-title":"Probability and Computing","author":"M Mitzenmacher","year":"2017","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing. Cambridge University Press, Cambridge (2017)"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Morris, R.H.: Scatter Storage Techniques. 11(1) (1968)","DOI":"10.1145\/362851.362882"},{"issue":"1","key":"15_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/357980.357996","volume":"26","author":"RH Morris","year":"1983","unstructured":"Morris, R.H.: Scatter storage techniques (reprint). Commun. ACM 26(1), 39\u201342 (1983)","journal-title":"Commun. ACM"},{"key":"15_CR21","unstructured":"Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23\u201325 October 1995, pp. 182\u2013191 (1995)"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Raab, M., Steger, A.: Balls into bins - a simple and tight analysis. In: Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM\u201998, Barcelona, Spain, October 8\u201310, 1998, Proceedings, pp. 159\u2013170 (1998)","DOI":"10.1007\/3-540-49543-6_13"},{"key":"15_CR23","first-page":"26","volume":"62","author":"HE Robbins","year":"1955","unstructured":"Robbins, H.E.: A remark on Stirling\u2019s formula. Am. Math. Mon. 62, 26\u201329 (1955)","journal-title":"Am. Math. Mon."},{"issue":"5","key":"15_CR24","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1137\/0219054","volume":"19","author":"Jeanette P Schmidt","year":"1990","unstructured":"Schmidt, Jeanette P., Siegel, Alan: The spatial complexity of oblivious k-probe hash functions. SIAM J. Comput. 19(5), 775\u2013786 (1990)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43587-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T21:36:30Z","timestamp":1699911390000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43587-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031435867","9783031435874"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43587-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=71937&L=2","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}