Srinivasa Rao Satti

Cited by

	All	Since 2018
Citations	4328	1431
h-index	30	18
i10-index	65	40

300

150

225

200220032004200520062007200820092010201120122013201420152016201720182019202020212022202315 15 36 58 133 169 193 253 163 184 221 277 296 246 268 270 288 237 239 236 206 223

Public access

View all

10 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Venkatesh RamanProfessor, IMSc ChennaiVerified email at imsc.res.in
Rajeev RamanProfessor, Department of Computing and Mathematical Sciences, 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 BarbayUniversidad de ConcepciónVerified email at barbay.cl
Kunihiko SadakaneProfessor at Department of Mathematical Informatics, The University of TokyoVerified email at mist.i.u-tokyo.ac.jp
Seungbum JoVerified email at cnu.ac.kr
Alexander GolynskiGoogleVerified email at google.com
Pooya DavoodiApple, Machine Learning EngineerVerified email at apple.com
Meng HeAssociate Professor, Faculty of Computer Science, Dalhousie UniversityVerified email at cs.dal.ca
Roberto GrossiProfessor of Computer Science, University of Pisa, ItalyVerified email at unipi.it
Gerth Stølting BrodalAarhus UniversityVerified email at cs.au.dk
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
Varunkumar JayapaulAssistant Professor at IIT MandiVerified email at iitmandi.ac.in
John IaconoUniversité Libre de BruxellesVerified email at ulb.ac.be
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerified email at mit.edu
Alessio OrlandiUniversity of PisaVerified email at di.unipi.it

Srinivasa Rao Satti

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	926	2007
Representing trees of higher degree D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao Algorithmica 43 (4), 275-292, 2005	295	2005
An optimal Bloom filter replacement. A Pagh, R Pagh, SS Rao Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005	253	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	235*	2006
Space efficient suffix trees JI Munro, V Raman, SS Rao Journal of Algorithms 39 (2), 205-222, 2001	195	2001
Succinct dynamic data structures R Raman, V Raman, S Rao Algorithms and Data Structures, 426-437, 2001	139	2001
Succinct representations of permutations JI Munro, R Raman, V Raman, SS Rao Automata, Languages and Programming: 30th International Colloquium, ICALP …, 2003	128	2003
Succinct dynamic dictionaries and trees R Raman, SS Rao International Colloquium on Automata, Languages, and Programming, 357-368, 2003	113	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	106	2015
Succinct indexes for strings, binary relations and multi-labeled trees J Barbay, M He, JI Munro, SS Rao SODA, 680-689, 2007	91	2007
Succinct representations of permutations and functions JI Munro, R Raman, V Raman, SR Satti Theoretical Computer Science 438, 74-88, 2012	89	2012
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	85	1998
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	75	2007
Succinct representations of functions JI Munro, SS Rao Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004	65	2004
On space efficient two dimensional range minimum data structures G Brodal, P Davoodi, S Rao Algorithms–ESA 2010, 171-182, 2010	62	2010
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	60	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	56	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	53	2009
On the redundancy of succinct data structures A Golynski, R Raman, SS Rao Scandinavian Workshop on Algorithm Theory, 148-159, 2008	43	2008

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

Cited by

Co-authors