Ian Munro
Ian Munro
University Professor, University of Waterloo
Dirección de correo verificada de uwaterloo.ca - Página principal
TítuloCitado porAño
Trust-aware collaborative filtering for recommender systems
P Massa, P Avesani
OTM Confederated International Conferences" On the Move to Meaningful …, 2004
The computational complexity of algebraic and numeric problems
A Borodin, I Munro
North-Holland, 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
Selection and sorting with limited storage
JI Munro, MS Paterson
Theoretical computer science 12 (3), 315-323, 1980
JI Munro
International Conference on Foundations of Software Technology and …, 1996
Succinct representation of balanced parentheses and static trees
JI Munro, V Raman
SIAM Journal on Computing 31 (3), 762-776, 2001
Efficient suffix trees on secondary storage
DR Clark, JI Munro
SODA 96, 383-391, 1996
Representing trees of higher degree
D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao
Algorithmica 43 (4), 275-292, 2005
Handbook of data structures and applications
DP Mehta, S Sahni
Chapman and Hall/CRC, 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
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
Efficient determination of the transitive closure of a directed graph
I Munro
Information Processing Letters 1 (2), 56-58, 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
Space efficient suffix trees
I Munro, V Raman, SS Rao
International Conference on Foundations of Software Technology and …, 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
Membership in constant time and almost-minimum space
A Brodnik, JI Munro
SIAM Journal on Computing 28 (5), 1627-1640, 1999
Self-organizing binary search trees
B Allen, I Munro
Journal of the ACM (JACM) 25 (4), 526-535, 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
Exegesis of self-organizing linear search
GH Gonnet, JI Munro, H Suwanda
SIAM Journal on Computing 10 (3), 613-637, 1981
Optimal algorithms for parallel polynomial evaluation
I Munro, M Paterson
Journal of Computer and System Sciences 7 (2), 189-198, 1973
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20