On the Complexity of a Game Related to the Dictionary Problem

DOI10.1137/0219062zbMath0711.68034OpenAlexW2136696425MaRDI QIDQ3495639

No author found.

Publication date: 1990

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0219062

zbMATH Keywords

lower boundhashingsearch treedictionary problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Data structures (68P05)

Related Items (2)

Adjacency queries in dynamic sparse graphs ⋮ Perfect hashing

This page was built for publication: On the Complexity of a Game Related to the Dictionary Problem