Title :
An Implicit Data Structure For The Dictionary Problem That Runs In Polylog Time
Author_Institution :
University of Waterloo
Keywords :
Computer science; Costs; Counting circuits; Data structures; Dictionaries; Queueing analysis;
Conference_Titel :
Foundations of Computer Science, 1984. 25th Annual Symposium on
Print_ISBN :
0-8186-0591-X
DOI :
10.1109/SFCS.1984.715937