Rajeev Raman - Citazioni di Google Scholar

Citata da

	Tutte	Dal 2015
Citazioni	4751	1566
Indice H	36	20
i10-index	72	45

340

170

255

19911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020 18 27 27 41 56 58 52 48 53 76 103 93 85 102 164 193 241 251 252 251 264 296 305 264 338 308 289 270 97

Coautori

Srinivasa Rao SattiAssociate Professor, Seoul National UniversityEmail verificata su cse.snu.ac.kr
Ian MunroUniversity Professor, University of WaterlooEmail verificata su uwaterloo.ca
Roberto GrossiProfessor of Computer Science, University of Pisa, ItalyEmail verificata su di.unipi.it
Pooya DavoodiNVIDIA, Senior Software EngineerEmail verificata su nvidia.com
Gonzalo NavarroUniversity of ChileEmail verificata su dcc.uchile.cl
Muhammad MuzammalBahria University, Islamabad.Email verificata su bahria.edu.pk
John IaconoUniversité Libre de BruxellesEmail verificata su ulb.ac.be
Alessio OrlandiUniversity of PisaEmail verificata su di.unipi.it
Philip BilleTechnical University of DenmarkEmail verificata su dtu.dk
Oren WeimannUniversity of HaifaEmail verificata su cs.haifa.ac.il
Kunihiko SadakaneProfessor at Department of Mathematical Informatics, The University of TokyoEmail verificata su mist.i.u-tokyo.ac.jp
Richard ColeProfessor of Computer Science, Courant Institute, New York UniversityEmail verificata su cs.nyu.edu
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyEmail verificata su mit.edu
Paul ChouEmail verificata su iii.org.tw
Stelios JoannouGraduate Teaching Assistant, University of LeicesterEmail verificata su le.ac.uk
Simon J. PuglisiAssociate Professor, Department of Computer Science, University of HelsinkiEmail verificata su cs.helsinki.fi
Arash FarzanUniversity of Waterloo, Max-Planck-Institute for Computer Science, FacebookEmail verificata su mpi-inf.mpg.de
Michael A. BenderStony Brook UniversityEmail verificata su cs.stonybrook.edu
Michael KaufmannProfessor of Computer Science, Tübingen UniversityEmail verificata su informatik.uni-tuebingen.de
Neil WalkinshawDepartment of Computer Science, The University of SheffieldEmail verificata su sheffield.ac.uk

Rajeev Raman

Professor, Department of Informatics, University of Leicester

Email verificata su leicester.ac.uk - Home page

Data Structures Algorithms and Complexity Data Mining


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-es, 2007	765	2007
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	765	2007
Representing trees of higher degree D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao Algorithmica 43 (4), 275-292, 2005	259	2005
Handbook of data structures and applications DP Mehta, S Sahni Chapman and Hall/CRC, 2004	256	2004
Sorting in linear time? A Andersson, T Hagerup, S Nilsson, R Raman Journal of Computer and System Sciences 57 (1), 74-93, 1998	255	1998
String matching techniques for musical similarity and melodic recognition T Crawford Computing in musicology 11, 73-100, 1998	190	1998
Succinct ordinal trees with level-ancestor queries RF Geary, R Raman, V Raman ACM Transactions on Algorithms (TALG) 2 (4), 510-534, 2006	155	2006
A simple optimal representation for balanced parentheses RF Geary, N Rahman, R Raman, V Raman Theoretical Computer Science 368 (3), 231-246, 2006	129	2006
Succinct representations of permutations JI Munro, R Raman, V Raman, SS Rao International Colloquium on Automata, Languages, and Programming, 345-356, 2003	118	2003
Priority queues: Small, monotone and trans-dichotomous R Raman European Symposium on Algorithms, 121-137, 1996	118	1996
Succinct dynamic data structures R Raman, V Raman, SS Rao Workshop on Algorithms and Data Structures, 426-437, 2001	112	2001
Buffer minimization using max-coloring SV Pemmaraju, R Raman, K Varadarajan Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete …, 2004	100	2004
Recent results on the single-source shortest paths problem R Raman ACM SIGACT News 28 (2), 81-87, 1997	92	1997
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	86	2011
Succinct dynamic dictionaries and trees R Raman, SS Rao International Colloquium on Automata, Languages, and Programming, 357-368, 2003	83	2003
Engineering the LOUDS succinct tree representation N Rahman, R Raman International Workshop on Experimental and Efficient Algorithms, 134-145, 2006	82	2006
Exponential structures for efficient cache-oblivious algorithms MA Bender, R Cole, R Raman International Colloquium on Automata, Languages, and Programming, 195-207, 2002	71	2002
Succinct representations of permutations and functions JI Munro, R Raman, V Raman Theoretical Computer Science 438, 74-88, 2012	65	2012
Persistence, amortization and randomization P Dietz, R Raman	65	1991
The power of collision: Randomized parallel algorithms for chaining and integer sorting R Raman International Conference on Foundations of Software Technology and …, 1990	65	1990

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

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Carica PDF

Segui questo autore

Citata da

Coautori