Ian Munro
University of Waterloo · 25 works · 1,260 citations · h-index 13
Top works
- THE COMPUTATIONAL COMPLEXITY OF ALGEBRAIC AND NUMERIC PROBLEMS.
- Optimal algorithms for parallel polynomial evaluation
- Efficient determination of the transitive closure of a directed graph
- Optimal algorithms for parallel polynomial evaluation
- Sorting and Searching in Multisets
- Space Efficient Suffix Trees
- Self-Organizing Binary Search Trees
- A O(|V|·|E|) algorithm for maximum matching of graphs
- Evaluating polynomials at many points
- Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
- The analysis of an improved hashing technique
- Some results concerning efficient and optimal algorithms
- The Complexity of Clickomania
- Structure, Scoring and Purpose of Computing Competitions
- Self-organizing binary search trees
- Dynamic Data Structures for Document Collections and Graphs
- Analysis of hashing algorithms and a new mathematical transform
- Efficient evaluation of polynomial forms
- Fast Allocation and Deallocation with an Improved Buddy System
- Space Efficient Construction of Lyndon Arrays in Linear Time