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 | 938 | 2007 |
Handbook of data structures and applications DP Mehta, S Sahni Chapman and Hall/CRC, 2004 | 347 | 2004 |
Sorting in linear time? A Andersson, T Hagerup, S Nilsson, R Raman Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995 | 308 | 1995 |
Representing trees of higher degree D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao Algorithmica 43, 275-292, 2005 | 299 | 2005 |
String-matching techniques for musical similarity and melodic recognition T Crawford Melodic Similarity: Concepts, Procedures, and Application, 1998 | 203 | 1998 |
Succinct ordinal trees with level-ancestor queries RF Geary, R Raman, V Raman ACM Transactions on Algorithms (TALG) 2 (4), 510-534, 2006 | 176 | 2006 |
A simple optimal representation for balanced parentheses RF Geary, N Rahman, R Raman, V Raman Theoretical Computer Science 368 (3), 231-246, 2006 | 144 | 2006 |
Succinct dynamic data structures R Raman, V Raman, SS Rao Algorithms and Data Structures: 7th International Workshop, WADS 2001 …, 2001 | 140 | 2001 |
Priority queues: Small, monotone and trans-dichotomous R Raman Algorithms—ESA'96: Fourth Annual European Symposium Barcelona, Spain …, 1996 | 134 | 1996 |
Succinct representations of permutations JI Munro, R Raman, V Raman, SS Rao Automata, Languages and Programming: 30th International Colloquium, ICALP …, 2003 | 126 | 2003 |
Succinct dynamic dictionaries and trees R Raman, SS Rao International Colloquium on Automata, Languages, and Programming, 357-368, 2003 | 119 | 2003 |
Recent results on the single-source shortest paths problem R Raman ACM SIGACT News 28 (2), 81-87, 1997 | 118 | 1997 |
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 | 117 | 2015 |
Buffer minimization using max-coloring. SV Pemmaraju, R Raman, KR Varadarajan SODA 4, 562-571, 2004 | 111 | 2004 |
Engineering the LOUDS succinct tree representation ON Delpratt, N Rahman, R Raman Experimental Algorithms: 5th International Workshop, WEA 2006, Cala Galdana …, 2006 | 103 | 2006 |
Succinct representations of permutations and functions JI Munro, R Raman, V Raman Theoretical Computer Science 438, 74-88, 2012 | 94 | 2012 |
Mining sequential patterns from probabilistic databases M Muzammal, R Raman Knowledge and Information Systems 44, 325-358, 2015 | 93 | 2015 |
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 | 88 | 2011 |
Persistence, amortization and randomization P Dietz, R Raman | 88 | 1991 |
Cpt+: Decreasing the time/space complexity of the compact prediction tree T Gueniche, P Fournier-Viger, R Raman, VS Tseng Advances in Knowledge Discovery and Data Mining: 19th Pacific-Asia …, 2015 | 83 | 2015 |