팔로우
Srinivasa Rao Satti
Srinivasa Rao Satti
Professor, NTNU
ntnu.no의 이메일 확인됨 - 홈페이지
제목
인용
인용
연도
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
9392007
Representing trees of higher degree
D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao
Algorithmica 43 (4), 275-292, 2005
2992005
An optimal Bloom filter replacement.
A Pagh, R Pagh, SS Rao
Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005
2612005
Rank/Select Operations on Large Alphabets: a Tool for Text
A Golynski, I Munro, SR Satti
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete …, 2006
234*2006
Space efficient suffix trees
JI Munro, V Raman, SS Rao
Journal of Algorithms 39 (2), 205-222, 2001
2022001
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
1452011
Succinct dynamic data structures
R Raman, V Raman, S Rao
Algorithms and Data Structures, 426-437, 2001
1402001
Succinct representations of permutations
JI Munro, R Raman, V Raman, SS Rao
Automata, Languages and Programming: 30th International Colloquium, ICALP …, 2003
1292003
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
1202015
Succinct dynamic dictionaries and trees
R Raman, SS Rao
International Colloquium on Automata, Languages, and Programming, 357-368, 2003
1192003
Succinct representations of permutations and functions
JI Munro, R Raman, V Raman, SR Satti
Theoretical Computer Science 438, 74-88, 2012
942012
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
882011
A simplified NP-complete MAXSAT problem
V Raman, B Ravikumar, SS Rao
Information Processing Letters 65 (1), 1-6, 1998
881998
On the size of succinct indices
A Golynski, R Grossi, A Gupta, R Raman, SS Rao
Algorithms–ESA 2007: 15th Annual European Symposium, Eilat, Israel, October …, 2007
762007
Succinct representations of functions
JI Munro, SS Rao
Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004
672004
On space efficient two dimensional range minimum data structures
G Brodal, P Davoodi, S Rao
Algorithms–ESA 2010, 171-182, 2010
662010
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
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
522009
On the redundancy of succinct data structures
A Golynski, R Raman, SS Rao
Scandinavian Workshop on Algorithm Theory, 148-159, 2008
442008
Longest increasing subsequences in sliding windows
MH Albert, A Golynski, AM Hamel, A López-Ortiz, SS Rao, MA Safari
Theoretical Computer Science 321 (2-3), 405-414, 2004
442004
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20