Srinivasa Rao Satti
Srinivasa Rao Satti
Associate Professor, Seoul National University
Bestätigte E-Mail-Adresse bei cse.snu.ac.kr - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
8172007
Handbook of data structures and applications
DP Mehta, S Sahni
Taylor & Francis, 2018
2842018
Representing trees of higher degree
D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao
Algorithmica 43 (4), 275-292, 2005
2732005
Rank/select operations on large alphabets: a tool for text indexing
A Golynski, JI Munro, SS Rao
SODA 6, 368-373, 2006
2192006
An optimal Bloom filter replacement.
A Pagh, R Pagh, SS Rao
Soda 5, 823-829, 2005
1942005
Space efficient suffix trees
JI Munro, V Raman, SS Rao
Journal of Algorithms 39 (2), 205-222, 2001
1802001
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
155*2015
Succinct representations of permutations
JI Munro, R Raman, V Raman, SS Rao
International Colloquium on Automata, Languages, and Programming, 345-356, 2003
1222003
Succinct dynamic data structures
R Raman, V Raman, S Rao
Algorithms and Data Structures, 426-437, 2001
1212001
Succinct indexes for strings, binary relations and multi-labeled trees
J Barbay, M He, JI Munro, SS Rao
SODA, 680-689, 2007
902007
Succinct dynamic dictionaries and trees
R Raman, SS Rao
International Colloquium on Automata, Languages, and Programming, 357-368, 2003
902003
A simplified NP-complete MAXSAT problem
V Raman, B Ravikumar, SS Rao
Information Processing Letters 65 (1), 1-6, 1998
771998
Succinct representations of permutations and functions
JI Munro, R Raman, V Raman
Theoretical Computer Science 438, 74-88, 2012
702012
On the size of succinct indices
A Golynski, R Grossi, A Gupta, R Raman, SS Rao
European Symposium on Algorithms, 371-382, 2007
672007
On space efficient two dimensional range minimum data structures
G Brodal, P Davoodi, S Rao
Algorithms–ESA 2010, 171-182, 2010
612010
Succinct representations of functions
JI Munro, SS Rao
International Colloquium on Automata, Languages, and Programming, 1006-1015, 2004
602004
Adaptive searching in succinctly encoded binary relations and tree-structured documents
J Barbay, A Golynski, JI Munro, SS Rao
Theoretical Computer Science 387 (3), 284-297, 2007
562007
Succinct indexes for strings, binary relations and multilabeled trees
J Barbay, M He, JI Munro, SR Satti
ACM Transactions on Algorithms (TALG) 7 (4), 52, 2011
522011
More haste, less waste: Lowering the redundancy in fully indexable dictionaries
R Grossi, A Orlandi, R Raman, SS Rao
arXiv preprint arXiv:0902.2648, 2009
502009
On the redundancy of succinct data structures
A Golynski, R Raman, SS Rao
Scandinavian Workshop on Algorithm Theory, 148-159, 2008
44*2008
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20