Minimal perfect hashing in polynomial time

From MaRDI portal

DOI10.1007/BF02017345zbMATH Open0696.68078OpenAlexW2040532663MaRDI QIDQ911304FDOQ911304


Authors: Vincent G. Winters Edit this on Wikidata


Publication date: 1990

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02017345




Recommendations




Cites Work


Cited In (17)





This page was built for publication: Minimal perfect hashing in polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911304)