caa a22 4500 465821561 CHVBK 20180323112137.0 cr unu---uuuuu 170327e19900601xx s 000 0 eng 10.1007/BF02017345 doi (NATIONALLICENCE)springer-10.1007/BF02017345 Winters Vincent Department of Computer Science, University of Cincinnati, 822 Old Chemistry Building, 45221-0008, Cincinnati, Ohio, U.S.A aut Minimal perfect hashing in polynomial time [Elektronische Daten] [Vincent Winters] We present a universally applicable algorithm for generating minimal perfect hashing functions. The method has (worst case) polynomial time complexity in units of bit operations. An adjunct algorithm for reducing parameter magnitudes in the generated hash functions is given. This probabilistic method makes hash function parameter magnitudes independent of argument (input key) magnitudes. BIT Foundations, 1990 E.2.2 nationallicence F.2.1 nationallicence H.3.3 nationallicence Minimal Perfect Hashing nationallicence Hasing nationallicence Searching nationallicence Algorithms nationallicence Complexity nationallicence BIT Kluwer Academic Publishers 30/2(1990-06-01), 235-244 0006-3835 30:2<235 1990 30 10543 https://doi.org/10.1007/BF02017345 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02017345 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Winters Vincent Department of Computer Science, University of Cincinnati, 822 Old Chemistry Building, 45221-0008, Cincinnati, Ohio, U.S.A aut NATIONALLICENCE 773 0- BIT Kluwer Academic Publishers 30/2(1990-06-01), 235-244 0006-3835 30:2<235 1990 30 10543 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer