Srinivasa Rao Satti

Citée par

	Toutes	Depuis 2020
Citations	4577	1112
indice h	31	16
indice i10	67	28

320

160

240

20022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202515 15 35 58 134 168 188 263 167 183 226 266 294 244 285 274 305 238 240 243 195 209 210 15

Accès public

Tout afficher

10 articles

0 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Venkatesh RamanProfessor, IMSc ChennaiAdresse e-mail validée de imsc.res.in
Rajeev RamanProfessor, Department of Computing and Mathematical Sciences, University of LeicesterAdresse e-mail validée de leicester.ac.uk
Ian MunroUniversity Professor, University of WaterlooAdresse e-mail validée de uwaterloo.ca
Sankardeep ChakrabortyThe University of TokyoAdresse e-mail validée de imsc.res.in
Kunihiko SadakaneProfessor at Department of Mathematical Informatics, The University of TokyoAdresse e-mail validée de mist.i.u-tokyo.ac.jp
Seungbum JoAdresse e-mail validée de cnu.ac.kr
Jérémy BarbayUniversidad de ConcepciónAdresse e-mail validée de barbay.cl
Alexander GolynskiGoogleAdresse e-mail validée de google.com
Pooya DavoodiApple, Machine Learning EngineerAdresse e-mail validée de apple.com
Gerth Stølting BrodalAarhus UniversityAdresse e-mail validée de cs.au.dk
Roberto GrossiProfessor of Computer Science, University of Pisa, ItalyAdresse e-mail validée de unipi.it
Meng HeProfessor, Faculty of Computer Science, Dalhousie UniversityAdresse e-mail validée de cs.dal.ca
Gonzalo NavarroUniversity of ChileAdresse e-mail validée de dcc.uchile.cl
Rasmus PaghProfessor of computer science, University of CopenhagenAdresse e-mail validée de di.ku.dk
Ankur GuptaButler UniversityAdresse e-mail validée de butler.edu
Varunkumar JayapaulAssistant Professor at IIT MandiAdresse e-mail validée de iitmandi.ac.in
Philip BilleTechnical University of DenmarkAdresse e-mail validée de dtu.dk
Oren WeimannUniversity of HaifaAdresse e-mail validée de cs.haifa.ac.il
John IaconoUniversité Libre de BruxellesAdresse e-mail validée de ulb.ac.be
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyAdresse e-mail validée de mit.edu

Suivre

Srinivasa Rao Satti

Professor, NTNU

Adresse e-mail validée de ntnu.no - Page d'accueil

Algorithms and Data structures


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
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	961	2007
Representing trees of higher degree D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao Algorithmica 43 (4), 275-292, 2005	306	2005
An optimal Bloom filter replacement. A Pagh, R Pagh, SS Rao Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005	271	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	241*	2006
Space efficient suffix trees JI Munro, V Raman, SS Rao Journal of Algorithms 39 (2), 205-222, 2001	205	2001
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	147	2011
Succinct dynamic data structures R Raman, V Raman, S Rao Algorithms and Data Structures, 426-437, 2001	140	2001
Succinct representations of permutations JI Munro, R Raman, V Raman, SS Rao Automata, Languages and Programming: 30th International Colloquium, ICALP …, 2003	130	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	124	2015
Succinct dynamic dictionaries and trees R Raman, SS Rao International Colloquium on Automata, Languages, and Programming, 357-368, 2003	122	2003
Succinct representations of permutations and functions JI Munro, R Raman, V Raman, SR Satti Theoretical Computer Science 438, 74-88, 2012	97	2012
A simplified NP-complete MAXSAT problem V Raman, B Ravikumar, SS Rao Information Processing Letters 65 (1), 1-6, 1998	89	1998
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	88	2011
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	78	2007
Succinct representations of functions JI Munro, SS Rao Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004	67	2004
On space efficient two dimensional range minimum data structures G Brodal, P Davoodi, S Rao Algorithms–ESA 2010, 171-182, 2010	66	2010
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	52	2009
On the redundancy of succinct data structures A Golynski, R Raman, SS Rao Scandinavian Workshop on Algorithm Theory, 148-159, 2008	47	2008
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

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs