Ian Munro - Citas de Google Académico

Citado por

	Total	Desde 2015
Citas	10790	2838
Índice h	51	27
Índice i10	137	65

680

340

170

510

198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202048 40 45 49 53 64 70 81 76 85 86 122 65 94 84 117 108 99 100 69 118 147 200 258 325 412 489 557 559 517 532 537 677 643 538 639 559 542 527 30

Coautores

Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyDirección de correo verificada de mit.edu
Alejandro Lopez-OrtizProfessor and Cheriton Chair, University of WaterlooDirección de correo verificada de uwaterloo.ca
Meng HeAssociate Professor, Dalhousie UniversityDirección de correo verificada de cs.dal.ca
Srinivasa Rao SattiAssociate Professor, Seoul National UniversityDirección de correo verificada de cse.snu.ac.kr
Patricio V. PobleteProfessor of Computer Science, University of ChileDirección de correo verificada de dcc.uchile.cl
Andrej (Andy) BrodnikUniversity of Ljubljana, University of PrimorskaDirección de correo verificada de brodnik.org
Gaston H. GonnetProfessor Emeritus of Computer Science at the ETH ZurichDirección de correo verificada de inf.ethz.ch
Arash FarzanUniversity of Waterloo, Max-Planck-Institute for Computer Science, FacebookDirección de correo verificada de mpi-inf.mpg.de
Pat NicholsonBell Labs, IrelandDirección de correo verificada de nokia-bell-labs.com
Yakov NekrichUniversity of WaterlooDirección de correo verificada de uwaterloo.ca
Jérémy BarbayUniversity of ChileDirección de correo verificada de barbay.cl
Prosenjit BoseCarleton UniversityDirección de correo verificada de scs.carleton.ca
Rajeev RamanProfessor, Department of Informatics, University of LeicesterDirección de correo verificada de leicester.ac.uk
Reza DorrigivGoogleDirección de correo verificada de google.com
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusDirección de correo verificada de mpi-inf.mpg.de
Mike PatersonEmeritus Professor of Computer Science, University of WarwickDirección de correo verificada de dcs.warwick.ac.uk
Stephane DurocherComputer Science, University of ManitobaDirección de correo verificada de cs.umanitoba.ca
Gelin ZhouUniversity of WaterlooDirección de correo verificada de uwaterloo.ca
Sharma V ThankachanUniversity of Central FloridaDirección de correo verificada de ucf.edu
Moshe LewensteinProfessor of Computer Science, Bar-Ilan UniversityDirección de correo verificada de cs.biu.ac.il

Ian Munro

University Professor, University of Waterloo

Dirección de correo verificada de uwaterloo.ca - Página principal

Algorithms Data Structures Analysis of Algorithms


Título	Citado por	Año
Trust-aware collaborative filtering for recommender systems P Massa, P Avesani OTM Confederated International Conferences" On the Move to Meaningful …, 2004	969*	2004
The computational complexity of algebraic and numeric problems A Borodin, I Munro North-Holland, 1975	571	1975
Frequency estimation of internet packet streams with limited space ED Demaine, A López-Ortiz, JI Munro European Symposium on Algorithms, 348-360, 2002	528	2002
Selection and sorting with limited storage JI Munro, MS Paterson Theoretical computer science 12 (3), 315-323, 1980	475	1980
Tables JI Munro International Conference on Foundations of Software Technology and …, 1996	401	1996
Succinct representation of balanced parentheses and static trees JI Munro, V Raman SIAM Journal on Computing 31 (3), 762-776, 2001	348	2001
Efficient suffix trees on secondary storage DR Clark, JI Munro SODA 96, 383-391, 1996	289	1996
Representing trees of higher degree D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao Algorithmica 43 (4), 275-292, 2005	260	2005
Handbook of data structures and applications DP Mehta, S Sahni Chapman and Hall/CRC, 2004	244	2004
Adaptive set intersections, unions, and differences ED Demaine, A López-Ortiz, JI Munro In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms …, 2000	218	2000
Rank/select operations on large alphabets: a tool for text indexing A Golynski, JI Munro, SS Rao Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006	215	2006
Efficient determination of the transitive closure of a directed graph I Munro Information Processing Letters 1 (2), 56-58, 1971	211	1971
Succinct representation of balanced parentheses, static trees and planar graphs JI Munro, V Raman Proceedings 38th Annual Symposium on Foundations of Computer Science, 118-126, 1997	187	1997
Space efficient suffix trees I Munro, V Raman, SS Rao International Conference on Foundations of Software Technology and …, 1998	174	1998
Identifying frequent items in sliding windows over on-line packet streams L Golab, D DeHaan, ED Demaine, A Lopez-Ortiz, JI Munro Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement, 173-178, 2003	173	2003
Membership in constant time and almost-minimum space A Brodnik, JI Munro SIAM Journal on Computing 28 (5), 1627-1640, 1999	156	1999
Self-organizing binary search trees B Allen, I Munro Journal of the ACM (JACM) 25 (4), 526-535, 1978	149	1978
Cache-oblivious priority queue and graph algorithm applications L Arge, MA Bender, ED Demaine, B Holland-Minkley, JI Munro Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002	148	2002
Exegesis of self-organizing linear search GH Gonnet, JI Munro, H Suwanda SIAM Journal on Computing 10 (3), 613-637, 1981	139*	1981
Optimal algorithms for parallel polynomial evaluation I Munro, M Paterson Journal of Computer and System Sciences 7 (2), 189-198, 1973	139	1973

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Subir PDF

Seguir a este autor

Citado por

Coautores