Srinivasa Rao Satti

Cited by

	All	Since 2017
Citations	4052	1399
h-index	31	18
i10-index	60	42

300

150

225

20022003200420052006200720082009201020112012201320142015201620172018201920202021202215 14 34 61 131 165 192 248 167 195 215 280 292 248 284 268 282 234 238 256 119

Public access

View all

10 articles

0 articles*

available

not available

Based on funding mandates

Co-authors

Rajeev RamanProfessor, Department of Informatics, University of LeicesterVerified email at leicester.ac.uk
Ian MunroUniversity Professor, University of WaterlooVerified email at uwaterloo.ca
Sankardeep ChakrabortyNational Institute of InformaticsVerified email at imsc.res.in
Jérémy BarbayUniversity of ChileVerified email at barbay.cl
Alexander GolynskiGoogleVerified email at google.com
Seungbum JoVerified email at cnu.ac.kr
Kunihiko SadakaneProfessor at Department of Mathematical Informatics, The University of TokyoVerified email at mist.i.u-tokyo.ac.jp
Pooya DavoodiApple, Machine Learning EngineerVerified email at apple.com
Meng HeAssociate Professor, Dalhousie UniversityVerified email at cs.dal.ca
Gerth Stølting BrodalAarhus UniversityVerified email at cs.au.dk
Roberto GrossiProfessor of Computer Science, University of Pisa, ItalyVerified email at di.unipi.it
Gonzalo NavarroUniversity of ChileVerified email at dcc.uchile.cl
Rasmus PaghProfessor of computer science, University of CopenhagenVerified email at di.ku.dk
Philip BilleTechnical University of DenmarkVerified email at dtu.dk
Oren WeimannUniversity of HaifaVerified email at cs.haifa.ac.il
Alessio OrlandiUniversity of PisaVerified email at di.unipi.it
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerified email at mit.edu
John IaconoUniversité Libre de BruxellesVerified email at ulb.ac.be
Varunkumar JayapaulVerified email at cmi.ac.in
Jonathan SorensonProfessor of Computer Science and Software Engineering, Butler UniversityVerified email at butler.edu

Srinivasa Rao Satti

Associate Professor, NTNU

Verified email at ntnu.no - Homepage

Algorithms and Data structures


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	873	2007
Representing trees of higher degree D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao Algorithmica 43 (4), 275-292, 2005	287	2005
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	227	2006
An optimal bloom filter replacement A Pagh, R Pagh, SS Rao Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005	216	2005
Space efficient suffix trees JI Munro, V Raman, SS Rao Journal of Algorithms 39 (2), 205-222, 2001	189	2001
Succinct dynamic data structures R Raman, V Raman, S Rao Algorithms and Data Structures, 426-437, 2001	132	2001
Succinct representations of permutations JI Munro, R Raman, V Raman, SS Rao International Colloquium on Automata, Languages, and Programming, 345-356, 2003	126	2003
Succinct dynamic dictionaries and trees R Raman, SS Rao International Colloquium on Automata, Languages, and Programming, 357-368, 2003	99	2003
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	95	2015
Succinct indexes for strings, binary relations and multi-labeled trees J Barbay, M He, JI Munro, SS Rao SODA, 680-689, 2007	93	2007
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	87	2011
A simplified NP-complete MAXSAT problem V Raman, B Ravikumar, SS Rao Information Processing Letters 65 (1), 1-6, 1998	81	1998
On the size of succinct indices A Golynski, R Grossi, A Gupta, R Raman, SS Rao European Symposium on Algorithms, 371-382, 2007	80	2007
Succinct representations of permutations and functions JI Munro, R Raman, V Raman, SR Satti Theoretical Computer Science 438, 74-88, 2012	74	2012
On space efficient two dimensional range minimum data structures G Brodal, P Davoodi, S Rao Algorithms–ESA 2010, 171-182, 2010	62	2010
Succinct representations of functions JI Munro, SS Rao International Colloquium on Automata, Languages, and Programming, 1006-1015, 2004	62	2004
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	58	2011
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	58	2007
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	54	2009
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	45	2004

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow this author

Cited by

Co-authors