Dynamic string searching

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 307-308

  Andersson, Arne ^a   Thorup, Mikkel ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Algorithms; Performance; Theory

Indexed keywords

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

References (4)

1. A. Andersson, Faster deterministic sorting and searching in linear space, Proceedings of the 37th Annual Symposium on Foundations of Computer Science, p.135, October 14-16, 1996
2. Arne A. Andersson , Mikkel Thorup, Tight(er) worst-case bounds on dynamic searching and priority queues, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.335-342, May 21-23, 2000, Portland, Oregon, United States [doi>10.1145/335305.335344]
3. Paul Beame , Faith E. Fich, Optimal bounds for the predecessor problem, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.295-304, May 01-04, 1999, Atlanta, Georgia, United States [doi>10.1145/ 301250.301323]
4. K. Mehlhorn. Data Structure8 and Algorithms 1: Sorting and Searching. Springer-Verlag, 1984. ISBN 3-540-13302-X.