Succinct Dynamic Data Structures
Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti · Lecture notes in computer science · 2001
Cited by 106 works. doi:10.1007/3-540-44634-6_39
Authors
References
- Proceedings of the 30th IEEE symposium on Foundations of computer science
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Space-efficient static trees and graphs
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- The cell probe complexity of dynamic data structures
- Space Efficient Suffix Trees
- Compact pat trees
- Membership in Constant Time and Almost-Minimum Space
- Succinct representation of balanced parentheses, static trees and planar graphs