A Simple, Fast, and Compact Static Dictionary
From MaRDI portal
Publication:3652272
DOI10.1007/978-3-642-10631-6_86zbMath1273.68102OpenAlexW1546583251MaRDI QIDQ3652272
Scott Schneider, Michael Spertus
Publication date: 17 December 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_86
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
This page was built for publication: A Simple, Fast, and Compact Static Dictionary