Rajeev Raman
Rajeev Raman
Professor, Department of Informatics, University of Leicester
Email verificata su leicester.ac.uk - Home page
TitoloCitata daAnno
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
R Raman, V Raman, SS Rao
Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete …, 2002
4622002
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
3322007
Representing trees of higher degree
D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao
Algorithmica 43 (4), 275-292, 2005
2582005
Sorting in linear time?
A Andersson, T Hagerup, S Nilsson, R Raman
Journal of Computer and System Sciences 57 (1), 74-93, 1998
2531998
Handbook of data structures and applications
DP Mehta, S Sahni
Chapman and Hall/CRC, 2004
2412004
String matching techniques for musical similarity and melodic recognition
T Crawford
Computing in musicology 11, 73-100, 1998
1881998
Succinct ordinal trees with level-ancestor queries
RF Geary, R Raman, V Raman
ACM Transactions on Algorithms (TALG) 2 (4), 510-534, 2006
1582006
A simple optimal representation for balanced parentheses
RF Geary, N Rahman, R Raman, V Raman
Theoretical Computer Science 368 (3), 231-246, 2006
1412006
Succinct representations of permutations
JI Munro, R Raman, V Raman, SS Rao
International Colloquium on Automata, Languages, and Programming, 345-356, 2003
1202003
Priority queues: Small, monotone and trans-dichotomous
R Raman
European Symposium on Algorithms, 121-137, 1996
1181996
Succinct dynamic data structures
R Raman, V Raman, SS Rao
Workshop on Algorithms and Data Structures, 426-437, 2001
1082001
Buffer minimization using max-coloring
SV Pemmaraju, R Raman, K Varadarajan
Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete …, 2004
1032004
Recent results on the single-source shortest paths problem
R Raman
ACM SIGACT News 28 (2), 81-87, 1997
901997
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
Succinct dynamic dictionaries and trees
R Raman, SS Rao
International Colloquium on Automata, Languages, and Programming, 357-368, 2003
862003
Engineering the LOUDS succinct tree representation
N Rahman, R Raman
International Workshop on Experimental and Efficient Algorithms, 134-145, 2006
812006
Exponential structures for efficient cache-oblivious algorithms
MA Bender, R Cole, R Raman
International Colloquium on Automata, Languages, and Programming, 195-207, 2002
782002
Succinct representations of permutations and functions
JI Munro, R Raman, V Raman, S Rao
Theoretical Computer Science 438, 74-88, 2012
662012
Persistence, amortization and randomization
P Dietz, R Raman
651991
On the size of succinct indices
A Golynski, R Grossi, A Gupta, R Raman, SS Rao
European Symposium on Algorithms, 371-382, 2007
642007
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20