## Data Structures

Succinct Representation of Equivalence classes
M. Lewenstein, I. Munro and V. Raman
Proceedings of ISAAC 2013.
Less space: Indexing for Queries with Wildcards
M. Lewenstein, I. Munro, V. Raman and S. Thankacchan
Procedings of ISAAC 2013.
Succinct Representations of Permutations and Functions
J.I. Munro, R. Raman, V. Raman, S. S. Rao.
Theoretical Computer Science (2012) 74-88.
CoRR abs/1108.4501:(2011)
preliminary version in Proceedings of ICALP 2003 (Springer LNCS 2719, 345-.) [pdf]
Succinct ordinal trees with level-ancestor queries [pdf]
R. F. Geary, R. Raman and V. Raman
ACM Transactions on Algorithms 2 (2006), pp. 510-534.
SODA '04 special issue, J. I. Munro and A. Lopez-Ortiz, eds.
A simple optimal representation for balanced parentheses [pdf]
R. F. Geary, N. Rahman, R. Raman and V. Raman
Theoretical Computer Science 368 (2006), pp. 231-246.
CPM '04 special issue, U. Dogrusoz, S. Muthukrishnan and S. C. Sahinalp, eds.
Representing trees of higher degree [pdf]
D. Benoit, E. D. Demaine, J. I. Munro, R. Raman, V. Raman and S. S. Rao
Algorithmica, 43 (2005), pp. 275-292.
Succinct Indexable Dictionaries with Applications to representations of k-ary trees and multisets [pdf]
Rajeev Raman, V. Raman and S. Srinivasa Rao.
in ACM Transactions on Algorithms 3(4) (2007), preliminary version in
Proceedings of ACM-SIAM conference of Discrete Algorithms (SODA) 2002.
Representing Dynamic Trees Succinctly
J. I. Munro, V. Raman and Adam Storm.
Proceedings of ACM-SIAM conference of Discrete Algorithms (SODA) 2001.
A tradeoff between search and update in dictionaries
J. Radhakrishnan and V. Raman.
Information Processing Letter 80 (2001) 243-247.
Succinct Dynamic Data Structures [pdf]
R. Raman, V. Raman, S. S. Rao
Proceedings of WADS 2001.
Explicit Deterministic Construction for Membership in the Bitprobe Model [pdf]
J. Radhakrishnan, V. Raman and S. S. Rao
Proceedings of ESA 2001.
Space Efficient Suffix Trees [pdf]
J.I. Munro, V. Raman and S. Srinivasa Rao.
Journal of Algorithms 39 (2) (2001) 205-222.
Succinct Representation of Balanced Parentheses and Static Trees
J. I. Munro and V. Raman.
1997 IEEE Symposium on Foundations of Computer Science: 118-126
SIAM J. Computing, Vol. 31, No.3 (2001) 762-776.
Static Dictionaries Supporting Rank [pdf]
V. Raman and S. S. Rao.
Proceedings of ISAAC 99 (Springer LNCS 1741) 18-26.
Path Balance Heuristic for Self-Adjusting Binary Search Trees
R. Balasubramanian and Venkatesh Raman
FSTTCS 1995: 338-348.