✦ LIBER ✦

A polynomial time generator for minimal perfect hash functions

✍ Scribed by Sager, Thomas J.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal perfect hashing in polynomial ti

✍ Vincent G. Winters 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 684 KB

An optimal algorithm for generating mini

✍ Zbigniew J. Czech; George Havas; Bohdan S. Majewski 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 645 KB

A scheme for constructing ordered minima

✍ C.C. Chang 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 469 KB

A faster strongly polynomial time algori

✍ James B. Orlin 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 212 KB

A backtracking method for constructing p

✍ W. P. Yang; M. W. Du 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 710 KB

A Polynomial-Time Algorithm for Near-Per

✍ Fernández-Baca, David; Lagergren, Jens 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 178 KB