 | 2010 |
|---|
| 156 |       | M. Ziaur Rahman,
J. Ian Munro:
Integer Representation and Counting in the Bit Probe Model.
Algorithmica 56(1): 105-127 (2010) |
| 155 | | Marek Karpinski,
J. Ian Munro,
Yakov Nekrich:
Range Reporting for Moving Points on a Grid
CoRR abs/1002.3511: (2010) |
| 2009 |
|---|
| 154 | | J. Ian Munro:
Reflections on Optimal and Nearly Optimal Binary Search Trees.
Efficient Algorithms 2009: 115-120 |
| 153 | | Arash Farzan,
J. Ian Munro:
Dynamic Succinct Ordered Trees.
ICALP (1) 2009: 439-450 |
| 152 | | Diego Arroyuelo,
Francisco Claude,
Reza Dorrigiv,
Stephane Durocher,
Meng He,
Alejandro López-Ortiz,
J. Ian Munro,
Patrick K. Nicholson,
Alejandro Salinger,
Matthew Skala:
Untangled Monotonic Chains and Adaptive Range Search.
ISAAC 2009: 203-212 |
| 151 | | Reza Dorrigiv,
Alejandro López-Ortiz,
J. Ian Munro:
An Application of Self-organizing Data Structures to Compression.
SEA 2009: 137-148 |
| 150 | | Jean Cardinal,
Samuel Fiorini,
Gwenaël Joret,
Raphael M. Jungers,
J. Ian Munro:
An efficient algorithm for partial order production.
STOC 2009: 93-100 |
| 149 | | Reza Dorrigiv,
Stephane Durocher,
Arash Farzan,
Robert Fraser,
Alejandro López-Ortiz,
J. Ian Munro,
Alejandro Salinger,
Matthew Skala:
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance.
WADS 2009: 218-229 |
| 148 | | Jean Cardinal,
Samuel Fiorini,
Gwenaël Joret,
Raphael M. Jungers,
J. Ian Munro:
Sorting under Partial Information (without the Ellipsoid Algorithm)
CoRR abs/0911.0086: (2009) |
| 147 | | Reza Dorrigiv,
Alejandro López-Ortiz,
J. Ian Munro:
On the relative dominance of paging algorithms.
Theor. Comput. Sci. 410(38-40): 3694-3701 (2009) |
| 2008 |
|---|
| 146 |  | J. Ian Munro,
Dorothea Wagner:
Proceedings of the Workshop on Algorithm Engineering and Experiments, ALENEX 2008, San Francisco, California, USA, January 19, 2008
SIAM 2008 |
| 145 | | J. Ian Munro:
Lower Bounds for Succinct Data Structures.
CPM 2008: 3 |
| 144 | | Reza Dorrigiv,
Alejandro López-Ortiz,
J. Ian Munro:
List Update Algorithms for Data Compression.
DCC 2008: 512 |
| 143 | | Arash Farzan,
J. Ian Munro:
Succinct Representations of Arbitrary Graphs.
ESA 2008: 393-404 |
| 142 | | Arash Farzan,
J. Ian Munro:
A Uniform Approach Towards Succinct Representation of Trees.
SWAT 2008: 173-184 |
| 141 | | Jérémy Barbay,
J. Ian Munro:
Succinct Encoding of Permutations: Applications to Text Indexing.
Encyclopedia of Algorithms 2008 |
| 140 | | Jean Cardinal,
Samuel Fiorini,
Gwenaël Joret,
Raphael M. Jungers,
J. Ian Munro:
An Efficient Algorithm for Partial Order Production
CoRR abs/0811.2572: (2008) |
| 2007 |
|---|
| 139 | | Meng He,
J. Ian Munro,
S. Srinivasa Rao:
Succinct Ordinal Trees Based on Tree Covering.
ICALP 2007: 509-520 |
| 138 | | Jérémy Barbay,
Luca Castelli Aleardi,
Meng He,
J. Ian Munro:
Succinct Representation of Labeled Graphs.
ISAAC 2007: 316-328 |
| 137 | | Reza Dorrigiv,
Alejandro López-Ortiz,
J. Ian Munro:
On the Relative Dominance of Paging Algorithms.
ISAAC 2007: 488-499 |
| 136 | | M. Ziaur Rahman,
J. Ian Munro:
Integer Representation and Counting in the Bit Probe Model.
ISAAC 2007: 5-16 |
| 135 | | Jérémy Barbay,
Meng He,
J. Ian Munro,
S. Srinivasa Rao:
Succinct indexes for strings, binary relations and multi-labeled trees.
SODA 2007: 680-689 |
| 134 | | Lars Arge,
Michael A. Bender,
Erik D. Demaine,
Bryan Holland-Minkley,
J. Ian Munro:
An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms.
SIAM J. Comput. 36(6): 1672-1695 (2007) |
| 133 | | Jérémy Barbay,
Alexander Golynski,
J. Ian Munro,
S. Srinivasa Rao:
Adaptive searching in succinctly encoded binary relations and tree-structured documents.
Theor. Comput. Sci. 387(3): 284-297 (2007) |
| 2006 |
|---|
| 132 | | Jérémy Barbay,
Alexander Golynski,
J. Ian Munro,
S. Srinivasa Rao:
Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents.
CPM 2006: 24-35 |
| 131 | | Andrej Brodnik,
Johan Karlsson,
J. Ian Munro,
Andreas Nilsson:
An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture.
IFIP TCS 2006: 103-114 |
| 130 | | Arash Farzan,
J. Ian Munro:
Succinct representation of finite abelian groups.
ISSAC 2006: 87-92 |
| 129 | | Alexander Golynski,
J. Ian Munro,
S. Srinivasa Rao:
Rank/select operations on large alphabets: a tool for text indexing.
SODA 2006: 368-373 |
| 128 | | Gianni Franceschini,
J. Ian Munro:
Implicit dictionaries with O(1) modifications per update and fast search.
SODA 2006: 404-413 |
| 127 | | Alejandro López-Ortiz,
J. Ian Munro:
Foreword.
ACM Transactions on Algorithms 2(4): 491 (2006) |
| 126 | | Andrej Brodnik,
Johan Karlsson,
J. Ian Munro,
Andreas Nilsson:
An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture
CoRR abs/cs/0601081: (2006) |
| 125 | | Patricio V. Poblete,
J. Ian Munro,
Thomas Papadakis:
The binomial transform and the analysis of skip lists.
Theor. Comput. Sci. 352(1-3): 136-158 (2006) |
| 124 | | Kyung-Yong Chwa,
J. Ian Munro:
Preface.
Theor. Comput. Sci. 363(1): 1 (2006) |
| 2005 |
|---|
| 123 | | Arash Farzan,
Paolo Ferragina,
Gianni Franceschini,
J. Ian Munro:
Cache-Oblivious Comparison-Based Algorithms on Multisets.
ESA 2005: 305-316 |
| 122 | | Kanela Kaligosi,
Kurt Mehlhorn,
J. Ian Munro,
Peter Sanders:
Towards Optimal Multiple Selection.
ICALP 2005: 103-114 |
| 121 | | Meng He,
J. Ian Munro,
S. Srinivasa Rao:
A categorization theorem on suffix arrays with applications to space efficient text indexes.
SODA 2005: 23-32 |
| 120 | | Gerth Stølting Brodal,
Erik D. Demaine,
J. Ian Munro:
Fast allocation and deallocation with an improved buddy system.
Acta Inf. 41(4-5): 273-291 (2005) |
| 119 | | David Benoit,
Erik D. Demaine,
J. Ian Munro,
Rajeev Raman,
Venkatesh Raman,
S. Srinivasa Rao:
Representing Trees of Higher Degree.
Algorithmica 43(4): 275-292 (2005) |
| 118 | | Andrej Brodnik,
Svante Carlsson,
Michael L. Fredman,
Johan Karlsson,
J. Ian Munro:
Worst case constant time priority queue.
Journal of Systems and Software 78(3): 249-256 (2005) |
| 2004 |
|---|
| 117 | | J. Ian Munro:
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004
SIAM 2004 |
| 116 | | Kyung-Yong Chwa,
J. Ian Munro:
Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings
Springer 2004 |
| 115 | | J. Ian Munro,
S. Srinivasa Rao:
Succinct Representations of Functions.
ICALP 2004: 1006-1015 |
| 114 | | Therese C. Biedl,
Timothy M. Chan,
Erik D. Demaine,
Rudolf Fleischer,
Mordecai J. Golin,
James A. King,
J. Ian Munro:
Fun-Sort--or the chaos of unordered binary search.
Discrete Applied Mathematics 144(3): 231-236 (2004) |
| 113 | | J. Ian Munro:
Succinct Data Structures.
Electr. Notes Theor. Comput. Sci. 91: 3 (2004) |
| 112 | | Nicholas J. A. Harvey,
J. Ian Munro:
Deterministic SkipNet.
Inf. Process. Lett. 90(4): 205-208 (2004) |
| 111 | | Gianni Franceschini,
Roberto Grossi,
J. Ian Munro,
Linda Pagli:
Implicit B-trees: a new data structure for the dictionary problem.
J. Comput. Syst. Sci. 68(4): 788-807 (2004) |
| 2003 |
|---|
| 110 | | J. Ian Munro,
Rajeev Raman,
Venkatesh Raman,
S. Srinivasa Rao:
Succinct Representations of Permutations.
ICALP 2003: 345-356 |
| 109 | | Lukasz Golab,
David DeHaan,
Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
Identifying frequent items in sliding windows over on-line packet streams.
Internet Measurement Comference 2003: 173-178 |
| 108 | | Nicholas J. A. Harvey,
J. Ian Munro:
Brief announcement: deterministic skipnet.
PODC 2003: 152 |
| 107 | | Paul E. Kearney,
J. Ian Munro,
Derek Phillips:
Efficient Generation of Uniform Samples from Phylogenetic Trees.
WABI 2003: 177-189 |
| 106 | | Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
On universally easy classes for NP-complete problems.
Theor. Comput. Sci. 1-3(304): 471-476 (2003) |
| 2002 |
|---|
| 105 | | Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
Frequency Estimation of Internet Packet Streams with Limited Space.
ESA 2002: 348-360 |
| 104 | | Gianni Franceschini,
Roberto Grossi,
J. Ian Munro,
Linda Pagli:
Implicit B-Trees: New Results for the Dictionary Problem.
FOCS 2002: 145-154 |
| 103 | | Lars Arge,
Michael A. Bender,
Erik D. Demaine,
Bryan Holland-Minkley,
J. Ian Munro:
Cache-oblivious priority queue and graph algorithm applications.
STOC 2002: 268-276 |
| 102 | | Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
Robot Localization without Depth Perception.
SWAT 2002: 249-259 |
| 101 | | Stephen Alstrup,
Michael A. Bender,
Erik D. Demaine,
Martin Farach-Colton,
J. Ian Munro,
Theis Rauhe,
Mikkel Thorup:
Efficient Tree Layout in a Multilevel Memory Hierarchy
CoRR cs.DS/0211010: (2002) |
| 100 | | Prosenjit Bose,
Anna Lubiw,
J. Ian Munro:
Efficient visibility queries in simple polygons.
Comput. Geom. 23(3): 313-335 (2002) |
| 99 | | Prosenjit Bose,
Andrej Brodnik,
Svante Carlsson,
Erik D. Demaine,
Rudolf Fleischer,
Alejandro López-Ortiz,
Pat Morin,
J. Ian Munro:
Online Routing in Convex Subdivisions.
Int. J. Comput. Geometry Appl. 12(4): 283-296 (2002) |
| 2001 |
|---|
| 98 | | Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
Experiments on Adaptive Set Intersections for Text Retrieval Systems.
ALENEX 2001: 91-104 |
| 97 | | Andrej Brodnik,
Svante Carlsson,
Johan Karlsson,
J. Ian Munro:
Worst case constant time priority queue.
SODA 2001: 523-528 |
| 96 | | J. Ian Munro,
Venkatesh Raman,
Adam J. Storm:
Representing dynamic binary trees succinctly.
SODA 2001: 529-536 |
| 95 | | Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
On universally easy classes for NP-complete problems.
SODA 2001: 910-911 |
| 94 | | Therese C. Biedl,
Erik D. Demaine,
Martin L. Demaine,
Rudolf Fleischer,
Lars Jacobsen,
J. Ian Munro:
The Complexity of Clickomania
CoRR cs.CC/0107031: (2001) |
| 93 | | J. Ian Munro,
Venkatesh Raman,
S. Srinivasa Rao:
Space Efficient Suffix Trees.
J. Algorithms 39(2): 205-222 (2001) |
| 92 | | J. Ian Munro,
Venkatesh Raman:
Succinct Representation of Balanced Parentheses and Static Trees.
SIAM J. Comput. 31(3): 762-776 (2001) |
| 2000 |
|---|
| 91 | | J. Ian Munro:
On the Competitiveness of Linear Search.
ESA 2000: 338-345 |
| 90 | | Prosenjit Bose,
Pat Morin,
Andrej Brodnik,
Svante Carlsson,
Erik D. Demaine,
Rudolf Fleischer,
J. Ian Munro,
Alejandro López-Ortiz:
Online Routing in Convex Subdivisions.
ISAAC 2000: 47-59 |
| 89 | | Erik D. Demaine,
Alejandro López-Ortiz,
J. Ian Munro:
Adaptive set intersections, unions, and differences.
SODA 2000: 743-752 |
| 1999 |
|---|
| 88 | | Erik D. Demaine,
J. Ian Munro:
Fast Allocation and Deallocation with an Improved Buddy System.
FSTTCS 1999: 84-96 |
| 87 | | David Benoit,
Erik D. Demaine,
J. Ian Munro,
Venkatesh Raman:
Representing Trees of Higer Degree.
WADS 1999: 169-180 |
| 86 | | Andrej Brodnik,
Svante Carlsson,
Erik D. Demaine,
J. Ian Munro,
Robert Sedgewick:
Resizable Arrays in Optimal Time and Space.
WADS 1999: 37-48 |
| 85 | | Andrej Brodnik,
J. Ian Munro:
Membership in Constant Time and Almost-Minimum Space.
SIAM J. Comput. 28(5): 1627-1640 (1999) |
| 1998 |
|---|
| 84 | | J. Ian Munro,
Venkatesh Raman,
S. Srinivasa Rao:
Space Efficient Suffix Trees.
FSTTCS 1998: 186-196 |
| 1997 |
|---|
| 83 | | J. Ian Munro,
Venkatesh Raman:
Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs.
FOCS 1997: 118-126 |
| 82 | | Andrej Brodnik,
Peter Bro Miltersen,
J. Ian Munro:
Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds.
WADS 1997: 426-439 |
| 81 | | Patricio V. Poblete,
Alfredo Viola,
J. Ian Munro:
The Diagonal Poisson Transform and its application to the analysis of a hashing scheme.
Random Struct. Algorithms 10(1-2): 221-255 (1997) |
| 1996 |
|---|
| 80 | | J. Ian Munro:
Tables.
FSTTCS 1996: 37-42 |
| 79 | | David R. Clark,
J. Ian Munro:
Efficient Suffix Trees on Secondary Storage (extended Abstract).
SODA 1996: 383-391 |
| 78 | | Andrej Brodnik,
J. Ian Munro:
Neighbours on a Grid.
SWAT 1996: 309-320 |
| 77 | | J. Ian Munro,
Venkatesh Raman:
Fast Stable In-Place Sorting with O (n) Data Moves.
Algorithmica 16(2): 151-160 (1996) |
| 76 | | J. Ian Munro,
Venkatesh Raman:
Selection from Read-Only Memory and Sorting with Minimum Data Movement.
Theor. Comput. Sci. 165(2): 311-323 (1996) |
| 1995 |
|---|
| 75 | | Patricio V. Poblete,
J. Ian Munro,
Thomas Papadakis:
The Binomial Transform and its Application to the Analysis of Skip Lists.
ESA 1995: 554-569 |
| 74 | | Faith E. Fich,
J. Ian Munro,
Patricio V. Poblete:
Permuting in Place.
SIAM J. Comput. 24(2): 266-278 (1995) |
| 1994 |
|---|
| 73 | | Andrej Brodnik,
J. Ian Munro:
Membership in Constant Time and Minimum Space.
ESA 1994: 72-81 |
| 72 | | Patricio V. Poblete,
Alfredo Viola,
J. Ian Munro:
The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract).
ESA 1994: 94-105 |
| 1993 |
|---|
| 71 | | Torben Hagerup,
Kurt Mehlhorn,
J. Ian Munro:
Maintaining Discrete Probability Distributions Optimally.
ICALP 1993: 253-264 |
| 1992 |
|---|
| 70 | | J. Ian Munro,
Venkatesh Raman:
Selection from Read-Only Memory and Sorting with Optimum Data Movement.
FSTTCS 1992: 380-391 |
| 69 | | J. Ian Munro,
Thomas Papadakis,
Robert Sedgewick:
Deterministic Skip Lists.
SODA 1992: 367-375 |
| 68 | | Thomas Papadakis,
J. Ian Munro,
Patricio V. Poblete:
Average Search and Update Costs in Skip Lists.
BIT 32(2): 316-332 (1992) |
| 67 | | J. Ian Munro,
Venkatesh Raman:
Sorting with Minimum Data Movement.
J. Algorithms 13(3): 374-393 (1992) |
| 66 | | Walter Cunto,
J. Ian Munro,
Manuel Rey:
Selecting the Median and Two Quartiles in a Set of Numbers.
Softw., Pract. Exper. 22(6): 439-454 (1992) |
| 1991 |
|---|
| 65 | | J. Ian Munro,
Venkatesh Raman:
Fast Sorting In-Place Sorting with O(n) Data.
FSTTCS 1991: 266-277 |
| 64 | | Walter Cunto,
J. Ian Munro,
Patricio V. Poblete:
A Case Study in Comparison Based Complexity: Finding the Nearest Value(s).
WADS 1991: 1-12 |
| 63 | | J. Ian Munro,
Venkatesh Raman:
Sorting Multisets and Vectors In-Place.
WADS 1991: 473-480 |
| 62 | | Walter Cunto,
Gaston H. Gonnet,
J. Ian Munro,
Patricio V. Poblete:
Fringe Analysis for Extquick: An in Situ Distributive External Sorting Algorithm
Inf. Comput. 92(2): 141-160 (1991) |
| 61 | | Amos Fiat,
J. Ian Munro,
Moni Naor,
Alejandro A. Schäffer,
Jeanette P. Schmidt,
Alan Siegel:
An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time.
J. Comput. Syst. Sci. 43(3): 406-424 (1991) |
| 1990 |
|---|
| 60 | | Faith E. Fich,
J. Ian Munro,
Patricio V. Poblete:
Permuting
FOCS 1990: 372-379 |
| 59 | | Thomas Papadakis,
J. Ian Munro,
Patricio V. Poblete:
Analysis of the Expected Search Cost in Skip Lists.
SWAT 1990: 160-172 |
| 58 | | Joseph C. Culberson,
J. Ian Munro:
Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees.
Algorithmica 5(3): 295-311 (1990) |
| 57 | | J. Ian Munro,
Venkatesh Raman,
Jeffrey S. Salowe:
Stable in Situ Sorting and Minimum Data Movement.
BIT 30(2): 220-234 (1990) |
| 56 | | B. John Oommen,
E. R. Hansen,
J. Ian Munro:
Deterministic Optimal and Expedient Move-to-Rear List Organizing Strategies.
Theor. Comput. Sci. 74(2): 183-197 (1990) |
| 1989 |
|---|
| 55 | | J. Ian Munro,
Venkatesh Raman:
Sorting with Minimum Data Movement (Preliminary Draft).
WADS 1989: 552-562 |
| 54 | | Joseph C. Culberson,
J. Ian Munro:
Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations.
Comput. J. 32(1): 68-75 (1989) |
| 53 | | Walter Cunto,
J. Ian Munro:
Average case selection.
J. ACM 36(2): 270-279 (1989) |
| 52 | | Patricio V. Poblete,
J. Ian Munro:
Last-Come-First-Served Hashing.
J. Algorithms 10(2): 228-248 (1989) |
| 1988 |
|---|
| 51 | | Svante Carlsson,
J. Ian Munro,
Patricio V. Poblete:
An Implicit Binomial Queue with Constant Insertion Time.
SWAT 1988: 1-13 |
| 1987 |
|---|
| 50 | | J. Ian Munro:
Searching a Two Key Table Under a Single Key
STOC 1987: 383-387 |
| 49 | | J. Ian Munro,
Mark H. Overmars,
Derick Wood:
Variations on Visibility.
Symposium on Computational Geometry 1987: 291-299 |
| 48 | | J. Ian Munro,
Patricio V. Poblete:
Searchability in Merging and Implicit Data Structures.
BIT 27(3): 324-329 (1987) |
| 1986 |
|---|
| 47 | | J. Ian Munro,
Pedro Celis:
Techniques for Collision Resolution in Hash Tables with Open Addressing.
FJCC 1986: 601-610 |
| 46 | | J. Ian Munro:
Developing Implicit Data Structures.
MFCS 1986: 168-176 |
| 45 | | J. Ian Munro:
An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log² n) Time.
J. Comput. Syst. Sci. 33(1): 66-74 (1986) |
| 44 | | Gaston H. Gonnet,
J. Ian Munro:
Heaps on Heaps.
SIAM J. Comput. 15(4): 964-971 (1986) |
| 1985 |
|---|
| 43 | | Pedro Celis,
Per-Åke Larson,
J. Ian Munro:
Robin Hood Hashing (Preliminary Report)
FOCS 1985: 281-288 |
| 42 | | Rolf G. Karlsson,
J. Ian Munro,
Edward L. Robertson:
The Nearest Neighbor Problem on Bounded Domains.
ICALP 1985: 318-327 |
| 41 | | Rolf G. Karlsson,
J. Ian Munro:
Proximity of a Grid.
STACS 1985: 187-196 |
| 40 | | Patricio V. Poblete,
J. Ian Munro:
The Analysis of a Fringe Heuristic for Binary Search Trees.
J. Algorithms 6(3): 336-350 (1985) |
| 39 | | David P. Dobkin,
J. Ian Munro:
Efficient Uses of the Past.
J. Algorithms 6(4): 455-465 (1985) |
| 1984 |
|---|
| 38 | | J. Ian Munro:
An Implicit Data Structure for the Dictionary Problem that Runs in Polylog Time
FOCS 1984: 369-374 |
| 37 | | Walter Cunto,
J. Ian Munro:
Average Case Selection
STOC 1984: 369-375 |
| 36 | | Helmut Alt,
Kurt Mehlhorn,
J. Ian Munro:
Partial Match Retrieval in Implicit Data Structures.
Inf. Process. Lett. 19(2): 61-65 (1984) |
| 35 | | J. Ian Munro,
Patricio V. Poblete:
Fault Tolerance and Storage Reduction in Binary Search Trees
Information and Control 62(2/3): 210-218 (1984) |
| 34 | | Gaston H. Gonnet,
J. Ian Munro:
The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform.
J. Algorithms 5(4): 451-470 (1984) |
| 1983 |
|---|
| 33 | | J. Ian Munro,
Patricio V. Poblete:
Searchability in Merging and Implicit Data Structures.
ICALP 1983: 527-535 |
| 32 | | J. Ian Munro,
Patricio V. Poblete:
A Discipline for Robustness or Storage Reduction in Binary Search Trees.
PODS 1983: 70-75 |
| 31 | | Gaston H. Gonnet,
J. Ian Munro,
Derick Wood:
Direct dynamic structures for some line segment problems.
Computer Vision, Graphics, and Image Processing 23(2): 178-186 (1983) |
| 1982 |
|---|
| 30 | | Gaston H. Gonnet,
J. Ian Munro:
Heaps on Heaps.
ICALP 1982: 282-291 |
| 29 | | Raúl J. Ramírez,
Frank Wm. Tompa,
J. Ian Munro:
Optimum Reorganization Points for Arbitrary Database Costs.
Acta Inf. 18: 17-30 (1982) |
| 28 | | Gaston H. Gonnet,
Per-Åke Larson,
J. Ian Munro,
Doron Rotem,
David J. Taylor,
Frank Wm. Tompa:
Database Storage Structures Research at the University of Waterloo.
IEEE Database Eng. Bull. 5(1): 49-52 (1982) |
| 1981 |
|---|
| 27 | | Helmut Alt,
Kurt Mehlhorn,
J. Ian Munro:
Partial Match Retrieval in Implicit Data Structures.
MFCS 1981: 156-161 |
| 26 | | Gaston H. Gonnet,
J. Ian Munro:
A Linear Probing Sort and its Analysis (Preliminary Draft)
STOC 1981: 90-95 |
| 25 | | J. Ian Munro,
Edward L. Robertson:
Continual Pattern Replication
Information and Control 48(3): 211-220 (1981) |
| 24 | | David P. Dobkin,
J. Ian Munro:
Optimal Time Minimal Space Selection Algorithms.
J. ACM 28(3): 454-461 (1981) |
| 23 | | Gaston H. Gonnet,
J. Ian Munro,
Hendra Suwanda:
Exegesis of Self-Organizing Linear Search.
SIAM J. Comput. 10(3): 613-637 (1981) |
| 1980 |
|---|
| 22 | | David P. Dobkin,
J. Ian Munro:
Efficient Uses of the Past
FOCS 1980: 200-206 |
| 21 | | J. Ian Munro,
Hendra Suwanda:
Implicit Data Structures for Fast Search and Update.
J. Comput. Syst. Sci. 21(2): 236-250 (1980) |
| 20 | | David P. Dobkin,
J. Ian Munro:
Determining the Mode.
Theor. Comput. Sci. 12: 255-263 (1980) |
| 19 | | J. Ian Munro,
Mike Paterson:
Selection and Sorting with Limited Storage.
Theor. Comput. Sci. 12: 315-323 (1980) |
| 1979 |
|---|
| 18 | | Gaston H. Gonnet,
J. Ian Munro,
Hendra Suwanda:
Toward Self-Organizing Linear Search (Preliminary Draught)
FOCS 1979: 169-174 |
| 17 | | J. Ian Munro,
Hendra Suwanda:
Implicit Data Structures (Preliminary Draft)
STOC 1979: 108-117 |
| 16 | | Gaston H. Gonnet,
J. Ian Munro:
Efficient Ordering of Hash Tables.
SIAM J. Comput. 8(3): 463-478 (1979) |
| 1978 |
|---|
| 15 | | J. Ian Munro,
Mike Paterson:
Selection and Sorting with Limited Storage
FOCS 1978: 253-258 |
| 14 | | David P. Dobkin,
J. Ian Munro:
Time and Space Bounds for Selection Problems.
ICALP 1978: 192-204 |
| 13 | | Brian Allen,
J. Ian Munro:
Self-Organizing Binary Search Trees.
J. ACM 25(4): 526-535 (1978) |
| 1977 |
|---|
| 12 | | J. Ian Munro:
The Parallel Complexity of Arithmetic Computation.
FCT 1977: 466-475 |
| 11 | | Gaston H. Gonnet,
J. Ian Munro:
The Analysis of an Improved Hashing Technique
STOC 1977: 113-121 |
| 10 | | W. Morven Gentleman,
J. Ian Munro:
Designing Overlay Structures.
Softw., Pract. Exper. 7(4): 493-500 (1977) |
| 1976 |
|---|
| 9 | | Brian Allen,
J. Ian Munro:
Self-Organizing Binary Search Trees
FOCS 1976: 166-172 |
| 8 | | J. Ian Munro,
Philip M. Spira:
Sorting and Searching in Multisets.
SIAM J. Comput. 5(1): 1-8 (1976) |
| 1974 |
|---|
| 7 | | T. Kameda,
J. Ian Munro:
A O(|V|*|E|) algorithm for maximum matching of graphs.
Computing 12(1): 91-98 (1974) |
| 1973 |
|---|
| 6 | | J. Ian Munro,
Mike Paterson:
Optimal Algorithms for Parallel Polynomial Evaluation.
J. Comput. Syst. Sci. 7(2): 189-198 (1973) |
| 1972 |
|---|
| 5 | | J. Ian Munro,
Allan Borodin:
Efficient Evaluation of Polynomial Forms.
J. Comput. Syst. Sci. 6(6): 625-638 (1972) |
| 1971 |
|---|
| 4 | | J. Ian Munro,
Mike Paterson:
Optimal Algorithms for Parallel Polynomial Evaluation
FOCS 1971: 132-139 |
| 3 | | J. Ian Munro:
Some Results Concerning Efficient and Optimal Algorithms
STOC 1971: 40-44 |
| 2 | | J. Ian Munro:
Efficient Determination of the Transitive Closure of a Directed Graph.
Inf. Process. Lett. 1(2): 56-58 (1971) |
| 1 | | Allan Borodin,
J. Ian Munro:
Evaluating Polynomials at Many Points.
Inf. Process. Lett. 1(2): 66-68 (1971) |
