DocumentCode :
3170660
Title :
An Implicit Data Structure For The Dictionary Problem That Runs In Polylog Time
Author :
Munro, Ian J.
Author_Institution :
University of Waterloo
fYear :
1984
fDate :
24-26 Oct 1984
Firstpage :
369
Lastpage :
374
Keywords :
Computer science; Costs; Counting circuits; Data structures; Dictionaries; Queueing analysis;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1984. 25th Annual Symposium on
ISSN :
0272-5428
Print_ISBN :
0-8186-0591-X
Type :
conf
DOI :
10.1109/SFCS.1984.715937
Filename :
715937
Link To Document :
بازگشت