Ian Munro 个人学术档案 - 学术资源搜索

引用次数

	总计	2019 年至今
引用	11443	2141
h 指数	55	24
i10 指数	150	58

560

280

140

420

198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202471 69 67 94 73 92 117 119 72 92 85 133 101 82 100 72 138 126 198 285 324 357 424 455 505 405 424 422 560 533 460 551 499 525 427 399 398 325 397 195

开放获取的出版物数量

查看全部

21 篇文章

1 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of Technology在 mit.edu 的电子邮件经过验证
Alejandro Lopez-OrtizProfessor and Cheriton Chair, University of Waterloo在 uwaterloo.ca 的电子邮件经过验证
Meng HeAssociate Professor, Faculty of Computer Science, Dalhousie University在 cs.dal.ca 的电子邮件经过验证
Srinivasa Rao SattiProfessor, NTNU在 ntnu.no 的电子邮件经过验证
Patricio V. PobleteProfessor of Computer Science, University of Chile在 dcc.uchile.cl 的电子邮件经过验证
Andrej (Andy) BrodnikUniversity of Ljubljana, University of Primorska在 brodnik.org 的电子邮件经过验证
Yakov NekrichAssociate Professor, Michigan Technological Univeristy在 uwaterloo.ca 的电子邮件经过验证
Gaston H. GonnetProfessor Emeritus of Computer Science at the ETH Zurich在 inf.ethz.ch 的电子邮件经过验证
Patrick NicholsonShutterstock在 uwaterloo.ca 的电子邮件经过验证
Arash FarzanUniversity of Waterloo, Max-Planck-Institute for Computer Science, Facebook在 mpi-inf.mpg.de 的电子邮件经过验证
Allan BorodinProfessor of Computer Science, University of Toronto在 cs.toronto.edu 的电子邮件经过验证
Rajeev RamanProfessor, Department of Computing and Mathematical Sciences, University of Leicester在 leicester.ac.uk 的电子邮件经过验证
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics Campus在 mpi-inf.mpg.de 的电子邮件经过验证
Gonzalo NavarroUniversity of Chile在 dcc.uchile.cl 的电子邮件经过验证
Prosenjit BoseCarleton University在 scs.carleton.ca 的电子邮件经过验证
Sharma V. ThankachanNorth Carolina State University在 ncsu.edu 的电子邮件经过验证
Reza DorrigivGoogle在 google.com 的电子邮件经过验证
Gelin ZhouUniversity of Waterloo在 uwaterloo.ca 的电子邮件经过验证
Mike PatersonEmeritus Professor of Computer Science, University of Warwick在 warwick.ac.uk 的电子邮件经过验证
Michael A. BenderStony Brook University在 cs.stonybrook.edu 的电子邮件经过验证

关注

Ian Munro

University Professor, University of Waterloo

在 uwaterloo.ca 的电子邮件经过验证 - 首页

Algorithms Data Structures Analysis of Algorithms


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
The computational complexity of algebraic and numeric problems A Borodin, I Munro North-Holland, 1975	663	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	632	2002
Selection and sorting with limited storage JI Munro, MS Paterson Theoretical computer science 12 (3), 315-323, 1980	583	1980
Tables JI Munro International Conference on Foundations of Software Technology and …, 1996	489	1996
Succinct representation of balanced parentheses and static trees JI Munro, V Raman SIAM Journal on Computing 31 (3), 762-776, 2001	402	2001
Efficient suffix trees on secondary storage DR Clark, JI Munro Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms …, 1996	318	1996
Representing trees of higher degree D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao Algorithmica 43, 275-292, 2005	298	2005
Efficient determination of the transitive closure of a directed graph I Munro Information Processing Letters 1 (2), 56-58, 1971	268	1971
Adaptive set intersections, unions, and differences ED Demaine, A López-Ortiz, JI Munro Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms …, 2000	255	2000
Rank/select operations on large alphabets: a tool for text indexing A Golynski, JI Munro, SS Rao SODA 6, 368-373, 2006	235	2006
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	210	1997
Space efficient suffix trees I Munro, V Raman, SS Rao International Conference on Foundations of Software Technology and …, 1998	201	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	198	2003
Membership in constant time and almost-minimum space A Brodnik, JI Munro SIAM Journal on Computing 28 (5), 1627-1640, 1999	188	1999
Self-organizing binary search trees B Allen, I Munro Journal of the ACM (JACM) 25 (4), 526-535, 1978	175	1978
Deterministic skip lists JI Munro, T Papadakis, R Sedgewick Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms …, 1992	170	1992
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	158	2002
Robin hood hashing P Celis, PÅ Larson, JI Munro Foundations of Computer Science, 1985., 26th Annual Symposium on, 281-288, 1985	157	1985
Succinct indexes for strings, binary relations and multilabeled trees J Barbay, M He, JI Munro, SR Satti ACM Transactions on Algorithms (TALG) 7 (4), 1-27, 2011	146	2011
Optimal algorithms for parallel polynomial evaluation I Munro, M Paterson Journal of Computer and System Sciences 7 (2), 189-198, 1973	145	1973

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用