Optimal bounds for the predecessor problem

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1999, Pages 295-304

  Beame, Paul ^a   Fich, Faith E ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GAME THEORY; MATHEMATICAL MODELS; OPTIMIZATION; SET THEORY;

PREDECESSOR PROBLEMS;

COMPUTATIONAL COMPLEXITY;

EID: 0032633728     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/301250.301323     Document Type: Article

References (29)