Rajeev Raman

Citata da

	Tutte	Dal 2016
Citazioni	5121	1603
Indice H	38	20
i10-index	77	44

360

180

270

199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202123 18 29 22 42 58 63 47 47 56 78 103 93 88 103 162 202 237 263 244 245 276 303 314 276 348 330 301 265 328 28

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 DavoodiApple, Machine Learning EngineerEmail verificata su apple.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
Simon J. PuglisiAssociate Professor, Department of Computer Science, University of HelsinkiEmail verificata su cs.helsinki.fi
Paul ChouEmail verificata su iii.org.tw
Stelios JoannouGraduate Teaching Assistant, University of LeicesterEmail verificata su le.ac.uk
Arash FarzanUniversity of Waterloo, Max-Planck-Institute for Computer Science, FacebookEmail verificata su mpi-inf.mpg.de
Philippe Fournier-VigerProfessor, Harbin Institute of Technology (Shenzhen)Email verificata su hitsz.edu.cn
Michael A. BenderStony Brook UniversityEmail verificata su cs.stonybrook.edu
Michael KaufmannProfessor of Computer Science, Tübingen UniversityEmail verificata su informatik.uni-tuebingen.de

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	809	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	809	2007
Handbook of data structures and applications DP Mehta, S Sahni Taylor & Francis, 2018	282	2018
Representing trees of higher degree D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao Algorithmica 43 (4), 275-292, 2005	273	2005
Sorting in linear time? A Andersson, T Hagerup, S Nilsson, R Raman Journal of Computer and System Sciences 57 (1), 74-93, 1998	268	1998
String matching techniques for musical similarity and melodic recognition T Crawford Computing in musicology 11, 73-100, 1998	195	1998
Succinct ordinal trees with level-ancestor queries RF Geary, R Raman, V Raman ACM Transactions on Algorithms (TALG) 2 (4), 510-534, 2006	164	2006
A simple optimal representation for balanced parentheses RF Geary, N Rahman, R Raman, V Raman Theoretical Computer Science 368 (3), 231-246, 2006	136	2006
Succinct representations of permutations JI Munro, R Raman, V Raman, SS Rao International Colloquium on Automata, Languages, and Programming, 345-356, 2003	122	2003
Priority queues: Small, monotone and trans-dichotomous R Raman European Symposium on Algorithms, 121-137, 1996	121	1996
Succinct dynamic data structures R Raman, V Raman, SS Rao Workshop on Algorithms and Data Structures, 426-437, 2001	120	2001
Buffer minimization using max-coloring. SV Pemmaraju, R Raman, KR Varadarajan SODA 4, 562-571, 2004	102	2004
Recent results on the single-source shortest paths problem R Raman ACM SIGACT News 28 (2), 81-87, 1997	96	1997
Engineering the LOUDS succinct tree representation N Rahman, R Raman International Workshop on Experimental and Efficient Algorithms, 134-145, 2006	91	2006
Succinct dynamic dictionaries and trees R Raman, SS Rao International Colloquium on Automata, Languages, and Programming, 357-368, 2003	90	2003
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	84	2011
Exponential structures for efficient cache-oblivious algorithms MA Bender, R Cole, R Raman International Colloquium on Automata, Languages, and Programming, 195-207, 2002	77	2002
Persistence, amortization and randomization P Dietz, R Raman	74	1991
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	72	2015
Succinct representations of permutations and functions JI Munro, R Raman, V Raman Theoretical Computer Science 438, 74-88, 2012	70	2012

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