Takip et
Ian Munro
Ian Munro
University Professor, University of Waterloo
uwaterloo.ca üzerinde doğrulanmış e-posta adresine sahip - Ana Sayfa
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
The computational complexity of algebraic and numeric problems
A Borodin, I Munro
North-Holland, 1975
6681975
Frequency estimation of internet packet streams with limited space
ED Demaine, A López-Ortiz, JI Munro
European Symposium on Algorithms, 348-360, 2002
6422002
Selection and sorting with limited storage
JI Munro, MS Paterson
Theoretical computer science 12 (3), 315-323, 1980
5931980
Tables
JI Munro
International Conference on Foundations of Software Technology and …, 1996
4971996
Succinct representation of balanced parentheses and static trees
JI Munro, V Raman
SIAM Journal on Computing 31 (3), 762-776, 2001
4112001
Efficient suffix trees on secondary storage
DR Clark, JI Munro
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms …, 1996
3211996
Representing trees of higher degree
D Benoit, ED Demaine, JI Munro, R Raman, V Raman, SS Rao
Algorithmica 43, 275-292, 2005
3052005
Efficient determination of the transitive closure of a directed graph
I Munro
Information Processing Letters 1 (2), 56-58, 1971
2691971
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
2612000
Rank/select operations on large alphabets: a tool for text indexing
A Golynski, JI Munro, SS Rao
SODA 6, 368-373, 2006
2402006
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
2111997
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
2052003
Space efficient suffix trees
I Munro, V Raman, SS Rao
International Conference on Foundations of Software Technology and …, 1998
2051998
Membership in constant time and almost-minimum space
A Brodnik, JI Munro
SIAM Journal on Computing 28 (5), 1627-1640, 1999
1881999
Self-organizing binary search trees
B Allen, I Munro
Journal of the ACM (JACM) 25 (4), 526-535, 1978
1791978
Robin hood hashing
P Celis, PÅ Larson, JI Munro
Foundations of Computer Science, 1985., 26th Annual Symposium on, 281-288, 1985
1741985
Deterministic skip lists
JI Munro, T Papadakis, R Sedgewick
Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms …, 1992
1721992
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
1602002
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
1462011
Optimal algorithms for parallel polynomial evaluation
I Munro, M Paterson
Journal of Computer and System Sciences 7 (2), 189-198, 1973
1441973
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–20