Follow
Rajeev Raman
Rajeev Raman
Professor, Department of Informatics, University of Leicester
Verified email at leicester.ac.uk - Homepage
Title
Cited by
Cited by
Year
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
R Raman, V Raman, SR Satti
ACM Transactions on Algorithms (TALG) 3 (4), 43-es, 2007
8852007
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
R Raman, V Raman, SR Satti
ACM Transactions on Algorithms (TALG) 3 (4), 43, 2007
8852007
Handbook of data structures and applications
DP Mehta, S Sahni
Chapman and Hall/CRC, 2004
3142004
Sorting in linear time?
A Andersson, T Hagerup, S Nilsson, R Raman
Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995
2911995
Representing trees of higher degree
D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao
Algorithmica 43, 275-292, 2005
2872005
String-matching techniques for musical similarity and melodic recognition
T Crawford
Melodic Similarity: Concepts, Procedures, and Application, 1998
2031998
Succinct ordinal trees with level-ancestor queries
RF Geary, R Raman, V Raman
ACM Transactions on Algorithms (TALG) 2 (4), 510-534, 2006
1722006
A simple optimal representation for balanced parentheses
RF Geary, N Rahman, R Raman, V Raman
Theoretical Computer Science 368 (3), 231-246, 2006
1402006
Succinct dynamic data structures
R Raman, V Raman, SS Rao
Algorithms and Data Structures: 7th International Workshop, WADS 2001 …, 2001
1342001
Priority queues: Small, monotone and trans-dichotomous
R Raman
Algorithms—ESA'96: Fourth Annual European Symposium Barcelona, Spain …, 1996
1271996
Succinct representations of permutations
JI Munro, R Raman, V Raman, SS Rao
ICALP 2033, 345-356, 2003
1212003
Buffer minimization using max-coloring.
SV Pemmaraju, R Raman, KR Varadarajan
SODA 4, 562-571, 2004
1112004
Succinct dynamic dictionaries and trees
R Raman, SS Rao
Automata, Languages and Programming: 30th International Colloquium, ICALP …, 2003
1072003
Recent results on the single-source shortest paths problem
R Raman
ACM SIGACT News 28 (2), 81-87, 1997
1071997
Random access to grammar-compressed strings and trees
P Bille, GM Landau, R Raman, K Sadakane, SR Satti, O Weimann
SIAM Journal on Computing 44 (3), 513-539, 2015
992015
Engineering the LOUDS succinct tree representation
ON Delpratt, N Rahman, R Raman
Experimental Algorithms: 5th International Workshop, WEA 2006, Cala Galdana …, 2006
982006
Mining sequential patterns from probabilistic databases
M Muzammal, R Raman
Knowledge and Information Systems 44, 325-358, 2015
872015
Random Access to Grammar-Compressed Strings
P Bille, GM Landau, R Raman, K Sadakane, SR Satti, O Weimann
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011
862011
Persistence, amortization and randomization
P Dietz, R Raman
841991
Exponential structures for efficient cache-oblivious algorithms
MA Bender, R Cole, R Raman
Automata, Languages and Programming: 29th International Colloquium, ICALP …, 2002
822002
The system can't perform the operation now. Try again later.
Articles 1–20