Srinivasa Rao Satti

Citado por

	Todos	Desde 2019
Citações	4540	1318
Índice h	31	17
Índice i10	65	37

320

160

240

2002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202415 15 35 58 134 168 188 263 167 183 219 270 294 245 285 272 306 238 240 242 194 208 195

Acesso público

Ver tudo

10 artigos

0 artigos

disponível

não disponível

Com base em autorizações de financiamento

Coautores

Venkatesh RamanProfessor, IMSc ChennaiEmail confirmado em imsc.res.in
Rajeev RamanProfessor, Department of Computing and Mathematical Sciences, University of LeicesterEmail confirmado em leicester.ac.uk
Ian MunroUniversity Professor, University of WaterlooEmail confirmado em uwaterloo.ca
Sankardeep ChakrabortyThe University of TokyoEmail confirmado em imsc.res.in
Kunihiko SadakaneProfessor at Department of Mathematical Informatics, The University of TokyoEmail confirmado em mist.i.u-tokyo.ac.jp
Seungbum JoEmail confirmado em cnu.ac.kr
Jérémy BarbayUniversidad de ConcepciónEmail confirmado em barbay.cl
Alexander GolynskiGoogleEmail confirmado em google.com
Pooya DavoodiApple, Machine Learning EngineerEmail confirmado em apple.com
Gerth Stølting BrodalAarhus UniversityEmail confirmado em cs.au.dk
Roberto GrossiProfessor of Computer Science, University of Pisa, ItalyEmail confirmado em unipi.it
Meng HeProfessor, Faculty of Computer Science, Dalhousie UniversityEmail confirmado em cs.dal.ca
Gonzalo NavarroUniversity of ChileEmail confirmado em dcc.uchile.cl
Rasmus PaghProfessor of computer science, University of CopenhagenEmail confirmado em di.ku.dk
Varunkumar JayapaulAssistant Professor at IIT MandiEmail confirmado em iitmandi.ac.in
Philip BilleTechnical University of DenmarkEmail confirmado em dtu.dk
Oren WeimannUniversity of HaifaEmail confirmado em cs.haifa.ac.il
John IaconoUniversité Libre de BruxellesEmail confirmado em ulb.ac.be
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyEmail confirmado em mit.edu
Alessio OrlandiUniversity of PisaEmail confirmado em di.unipi.it

Seguir

Srinivasa Rao Satti

Professor, NTNU

Email confirmado em ntnu.no - Página inicial

Algorithms and Data structures


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
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	953	2007
Representing trees of higher degree D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao Algorithmica 43 (4), 275-292, 2005	304	2005
An optimal Bloom filter replacement. A Pagh, R Pagh, SS Rao Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005	267	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	240*	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	146	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	129	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	95	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	88	2011
A simplified NP-complete MAXSAT problem V Raman, B Ravikumar, SS Rao Information Processing Letters 65 (1), 1-6, 1998	88	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	77	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

O sistema não pode efectuar a operação agora. Tente mais tarde.

Artigos 1–20

Citações por ano

Citações duplicadas

Citações unidas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores