Static dictionaries on AC0 RAMs: Query time Θ(√log n/log log n) is necessary and sufficient

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1996, Pages 441-450

  Andersson, Arne ^a   Miltersen, Peter Bro ^a   Riis, Soren ^a   Thorup, Mikkel ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; MEMBERSHIP FUNCTIONS; PROBLEM SOLVING; QUERY LANGUAGES; RANDOM ACCESS STORAGE; THEOREM PROVING;

MEMBERSHIP QUERIES; STATIC DICTIONARY PROBLEM;

COMPUTATION THEORY;

EID: 0030393772     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)