Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
PREPRINT. In Proc. 37th IEEE Symposium on Foundations ofComputer Science, 1996.
 

Summary: PREPRINT. In Proc. 37th IEEE Symposium on Foundations
ofComputer Science, 1996.
Static Dictionaries on AC 0 RAMs: Query time \Theta(
q
log n= log log n) is necessary
and sufficient \Lambda
Arne Andersson
Lund University
arne@dna.lth.se
Peter Bro Miltersen y
University of Toronto
pbmilter@cs.toronto.edu
Søren Riis y
University of Leeds
pmtsr@amsta.leeds.ac.uk
Mikkel Thorup
University of Copenhagen
mthorup@diku.dk
Abstract
In this paper we consider solutions to the static dictio­

  

Source: Andersson, Arne - Department of Information Technology, Uppsala Universitet

 

Collections: Computer Technologies and Information Sciences