Srinivasa Rao Satti

Citata da

	Tutte	Dal 2019
Citazioni	4533	1315
Indice H	31	17
i10-index	65	37

320

160

240

2002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202415 15 35 58 134 168 188 263 167 182 219 271 294 245 285 272 302 238 240 242 194 208 192

Accesso pubblico

Visualizza tutto

10 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

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

Segui

Srinivasa Rao Satti

Professor, NTNU

Email verificata su ntnu.no - Home page

Algorithms and Data structures


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
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	952	2007
Representing trees of higher degree D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao Algorithmica 43 (4), 275-292, 2005	303	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	121	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	44	2004

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori