{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:04:22Z","timestamp":1725559462713},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259206"},{"type":"electronic","value":"9783540320784"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427186_42","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T17:38:24Z","timestamp":1279042704000},"page":"488-500","source":"Crossref","is-referenced-by-count":15,"title":["A Practical Minimal Perfect Hashing Method"],"prefix":"10.1007","author":[{"given":"Fabiano C.","family":"Botelho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiharu","family":"Kohayakawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nivio","family":"Ziviani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","series-title":"Cambridge Studies in Advanced Mathematics","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random graphs","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random graphs, 2nd edn. Cambridge Studies in Advanced Mathematics, vol.\u00a073. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"42_CR2","unstructured":"Bollob\u00e1s, B., Pikhurko, O.: Integer sets with prescribed pairwise differences being distinct. European Journal of Combinatorics (to appear)"},{"key":"42_CR3","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"issue":"5","key":"42_CR4","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0020-0190(92)90220-P","volume":"43","author":"Z.J. Czech","year":"1992","unstructured":"Czech, Z.J., Havas, G., Majewski, B.S.: An optimal algorithm for generating minimal perfect hash functions. Information Processing Letters\u00a043(5), 257\u2013264 (1992)","journal-title":"Information Processing Letters"},{"key":"42_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(96)00146-6","volume":"182","author":"Z.J. Czech","year":"1997","unstructured":"Czech, Z.J., Havas, G., Majewski, B.S.: Fundamental study perfect hashing. Theoretical Computer Science\u00a0182, 1\u2013143 (1997)","journal-title":"Theoretical Computer Science"},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/3-540-44676-1_9","volume-title":"Algorithms - ESA 2001","author":"M. Dietzfelbinger","year":"2001","unstructured":"Dietzfelbinger, M., Hagerup, T.: Simple minimal perfect hashing in less space. In: Meyer auf der Heide, F. (ed.) ESA 2001, vol.\u00a02161, pp. 109\u2013120. Springer, Heidelberg (2001)"},{"key":"42_CR7","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs I. Pub. Math. Debrecen\u00a06, 290\u2013297 (1959)","journal-title":"Pub. Math. Debrecen"},{"key":"42_CR8","first-page":"17","volume":"5","author":"P. Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl.\u00a05, 17\u201361 (1960)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Fox, E.A., Chen, Q.F., Heath, L.S.: A faster algorithm for constructing minimal perfect hash functions. In: Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 266\u2013273 (1992)","DOI":"10.1145\/133160.133209"},{"issue":"3","key":"42_CR10","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M.L. Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a sparse table with O(1) worst case access time. J. ACM\u00a031(3), 538\u2013544 (1984)","journal-title":"J. ACM"},{"key":"42_CR11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/3-540-57899-4_49","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G. Havas","year":"1994","unstructured":"Havas, G., Majewski, B.S., Wormald, N.C., Czech, Z.J.: Graphs, hypergraphs and hashing. In: van Leeuwen, J. (ed.) WG 1993, vol.\u00a0790, pp. 153\u2013165. Springer, Heidelberg (1994)"},{"key":"42_CR12","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random graphs. Wiley-Inter., Chichester (2000)"},{"key":"42_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02066689","volume":"12","author":"P. Erd\u0151s","year":"1961","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the strength of connectedness of a random graph. Acta Mathematica Scientia Hungary\u00a012, 261\u2013267 (1961)","journal-title":"Acta Mathematica Scientia Hungary"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Pagh, R.: Hash and displace: Efficient evaluation of minimal perfect hash functions. In: Workshop on Algorithms and Data Structures, pp. 49\u201354 (1999)","DOI":"10.1007\/3-540-48447-7_5"},{"key":"42_CR15","unstructured":"Pittel, B., Wormald, N.C.: Counting connected graphs inside-out. Journal of Combinatorial Theory (to appear)"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427186_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T22:28:32Z","timestamp":1685658512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427186_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259206","9783540320784"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11427186_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}