Srinivasa Rao Satti - Concepedia

Author

Srinivasa Rao Satti

Also Known As

Rao S. Srinivasa, Rao, S., Rao, S. Srinivasa, Rao, Sitara, S S S P Rao, S Srinivasa Rao, S. RAO, S. Rao, S. Rao Satti, S. Srinivasa Rao

174

Publications

4.3K

Citations

H-Index

Concepts

All Affiliations

Seoul National University University of Waterloo University of Leicester Institute of Mathematical Sciences University of Chile

About

Srinivasa Rao Satti is an author at Seoul National University specializing in engineering, computer science, and computational complexity.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	17	24	1.8K
2	Computer Engineering	3	3	176
3	Business	1	1	86
4	Education	1	1	13
5	Language Studies	1	1	12

Srinivasa Rao Satti

Publications

2.3K

Citations

H-Index

Page 1

	Year	Citations
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti Symposium on Discrete Algorithms Computational Complexity TheoryEngineeringComputational ComplexityComplexityInformation Retrieval	2002	397
Succinct indexable dictionaries with applications to encoding <i>k</i> -ary trees, prefix sums and multisets Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti ACM Transactions on Algorithms EngineeringComputational ComplexityData StructureCombinatorics On WordInformation Retrieval	2007	372
Representing Trees of Higher Degree David Benoit, Erik D. Demaine, J. Ian Munro, Algorithmica Tree LanguageHigher DegreeGraph TheoryGraph DrawingTree Automaton	2005	232
Rank/select operations on large alphabets: a tool for text indexing Alexander Golynski, J. Ian Munro, Srinivasa Rao Satti Symposium on Discrete Algorithms EngineeringBig Data IndexingRank/select OperationsCorpus LinguisticsText Mining	2006	188
An optimal Bloom filter replacement Anna Pagh, Rasmus Pagh, Srinivasa Rao Satti Symposium on Discrete Algorithms Cluster ComputingEngineeringApproximation SComputational ComplexityStorage Structure	2005	150
Space Efficient Suffix Trees Venkatesh Raman, Srinivasa Rao Satti Journal of Algorithms Tree LanguageEngineeringString-searching AlgorithmData MiningString Processing	2001	103
Random Access to Grammar-Compressed Strings and Trees Philip Bille, Gad M. Landau, Rajeev Raman, SIAM Journal on Computing	2015	98
Succinct indexes for strings, binary relations and multi-labeled trees Jérémy Barbay, Meng He, J. Ian Munro, Symposium on Discrete Algorithms EngineeringInformation RetrievalData ScienceComputational LinguisticsSemi-structured Data	2007	86
Rank/select operations on large alphabets Alexander Golynski, J. Ian Munro, Srinivasa Rao Satti Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 Ranking AlgorithmEngineeringLearning To RankRank/select OperationsText Mining	2006	84
Succinct representations of permutations and functions J. Ian Munro, Rajeev Raman, Venkatesh Raman, Theoretical Computer Science	2012	67

Page 1