Ian Munro
Ian Munro
University Professor, University of Waterloo
Dirección de correo verificada de uwaterloo.ca - Página principal
TítuloCitado porAño
The computational complexity of algebraic and numeric problems
A Borodin, I Munro
North-Holland, 1975
5691975
Frequency estimation of internet packet streams with limited space
ED Demaine, A López-Ortiz, JI Munro
European Symposium on Algorithms, 348-360, 2002
4882002
Selection and sorting with limited storage
JI Munro, MS Paterson
Theoretical computer science 12 (3), 315-323, 1980
4451980
Tables
JI Munro
International Conference on Foundations of Software Technology and …, 1996
3911996
Succinct representation of balanced parentheses and static trees
JI Munro, V Raman
SIAM Journal on Computing 31 (3), 762-776, 2001
3262001
Efficient suffix trees on secondary storage
DR Clark, JI Munro
SODA 96, 383-391, 1996
2731996
Representing trees of higher degree
D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao
Algorithmica 43 (4), 275-292, 2005
2482005
Efficient determination of the transitive closure of a directed graph
I Munro
Information Processing Letters 1 (2), 56-58, 1971
2131971
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
2062000
Handbook of data structures and applications
DP Mehta, S Sahni
Chapman and Hall/CRC, 2004
2032004
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
2022006
The problem of incomplete information in relational databases
G Grahne
Springer Science & Business Media, 1991
1971991
Succinct representation of balanced parentheses, static trees and planar graphs
JI Munro, V Raman
Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium …, 1997
1811997
Space efficient suffix trees
I Munro, V Raman, SS Rao
International Conference on Foundations of Software Technology and …, 1998
1711998
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
1622003
Self-organizing binary search trees
B Allen, I Munro
17th Annual Symposium on Foundations of Computer Science (sfcs 1976), 166-172, 1976
1451976
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
1422002
Membership in constant time and almost-minimum space
A Brodnik, JI Munro
SIAM Journal on Computing 28 (5), 1627-1640, 1999
1421999
Optimal algorithms for parallel polynomial evaluation
I Munro, M Paterson
Journal of Computer and System Sciences 7 (2), 189-198, 1973
1391973
Exegesis of self-organizing linear search
GH Gonnet, JI Munro, H Suwanda
SIAM Journal on Computing 10 (3), 613-637, 1981
138*1981
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20