Some Results Concerning Efficient and Optimal Algorithms - J. Ian Munro (STOC, 1971)

Evaluating Polynomials at Many Points. - Allan Borodin; J. Ian Munro (Inf. Process. Lett., 1971)

Efficient Determination of the Transitive Closure of a Directed Graph. - J. Ian Munro (Inf. Process. Lett., 1971)

Efficient Evaluation of Polynomial Forms. - J. Ian Munro; Allan Borodin (J. Comput. Syst. Sci., 1972)

In search of the fastest algorithm. - J. Ian Munro (AFIPS National Computer Conference, 1973)

Optimal Algorithms for Parallel Polynomial Evaluation. - J. Ian Munro; Mike Paterson (J. Comput. Syst. Sci., 1973)

A O(|V|*|E|) algorithm for maximum matching of graphs. - Tiko Kameda; J. Ian Munro (Computing, 1974)

The computational complexity of algebraic and numeric problems. - Allan Borodin; J. Ian Munro (Elsevier, 1975)

Sorting and Searching in Multisets. - J. Ian Munro; Philip M. Spira (SIAM J. Comput., 1976)

The Parallel Complexity of Arithmetic Computation. - J. Ian Munro (FCT, 1977)

The Analysis of an Improved Hashing Technique - Gaston H. Gonnet; J. Ian Munro (STOC, 1977)

Designing Overlay Structures. - W. Morven Gentleman; J. Ian Munro (Softw. Pract. Exp., 1977)

Time and Space Bounds for Selection Problems. - David P. Dobkin; J. Ian Munro (ICALP, 1978)

Self-Organizing Binary Search Trees. - Brian Allen; J. Ian Munro (J. ACM, 1978)

Toward Self-Organizing Linear Search (Preliminary Draught) - Gaston H. Gonnet; J. Ian Munro; Hendra Suwanda (FOCS, 1979)

Implicit Data Structures (Preliminary Draft) - J. Ian Munro; Hendra Suwanda (STOC, 1979)

Efficient Ordering of Hash Tables. - Gaston H. Gonnet; J. Ian Munro (SIAM J. Comput., 1979)

Implicit Data Structures for Fast Search and Update. - J. Ian Munro; Hendra Suwanda (J. Comput. Syst. Sci., 1980)

Determining the Mode. - David P. Dobkin; J. Ian Munro (Theor. Comput. Sci., 1980)

Selection and Sorting with Limited Storage. - J. Ian Munro; Mike Paterson (Theor. Comput. Sci., 1980)

A Linear Probing Sort and its Analysis (Preliminary Draft) - Gaston H. Gonnet; J. Ian Munro (STOC, 1981)

Optimal Time Minimal Space Selection Algorithms. - David P. Dobkin; J. Ian Munro (J. ACM, 1981)

Exegesis of Self-Organizing Linear Search. - Gaston H. Gonnet; J. Ian Munro; Hendra Suwanda (SIAM J. Comput., 1981)

Continual Pattern Replication - J. Ian Munro; Edward L. Robertson (Inf. Control., 1981)

Optimum Reorganization Points for Arbitrary Database Costs. - Raúl J. Ramírez; Frank Wm. Tompa; J. Ian Munro (Acta Informatica, 1982)

Database Storage Structures Research at the University of Waterloo. - Gaston H. Gonnet; Per-Åke Larson; J. Ian Munro; Doron Rotem; David J. Taylor; Frank Wm. Tompa (IEEE Database Eng. Bull., 1982)

Technical Note - Reducing Space Requirements for Shortest Path Problems. - J. Ian Munro; Raúl J. Ramírez (Oper. Res., 1982)

A Discipline for Robustness or Storage Reduction in Binary Search Trees. - J. Ian Munro; Patricio V. Poblete (PODS, 1983)

Direct dynamic structures for some line segment problems. - Gaston H. Gonnet; J. Ian Munro; Derick Wood (Comput. Vis. Graph. Image Process., 1983)

An Implicit Data Structure for the Dictionary Problem that Runs in Polylog Time - J. Ian Munro (FOCS, 1984)

Fault Tolerance and Storage Reduction in Binary Search Trees - J. Ian Munro; Patricio V. Poblete (Inf. Control., 1984)

Partial Match Retrieval in Implicit Data Structures. - Helmut Alt; Kurt Mehlhorn; J. Ian Munro (Inf. Process. Lett., 1984)

The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform. - Gaston H. Gonnet; J. Ian Munro (J. Algorithms, 1984)

Robin Hood Hashing (Preliminary Report) - Pedro Celis; Per-Åke Larson; J. Ian Munro (FOCS, 1985)

The Nearest Neighbor Problem on Bounded Domains. - Rolf G. Karlsson; J. Ian Munro; Edward L. Robertson (ICALP, 1985)

Proximity of a Grid. - Rolf G. Karlsson; J. Ian Munro (STACS, 1985)

Efficient Uses of the Past. - David P. Dobkin; J. Ian Munro (J. Algorithms, 1985)

The Analysis of a Fringe Heuristic for Binary Search Trees. - Patricio V. Poblete; J. Ian Munro (J. Algorithms, 1985)

Techniques for Collision Resolution in Hash Tables with Open Addressing. - J. Ian Munro; Pedro Celis (FJCC, 1986)

Developing Implicit Data Structures. - J. Ian Munro (MFCS, 1986)

An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log² n) Time. - J. Ian Munro (J. Comput. Syst. Sci., 1986)

Heaps on Heaps. - Gaston H. Gonnet; J. Ian Munro (SIAM J. Comput., 1986)

Variations on Visibility. - J. Ian Munro; Mark H. Overmars; Derick Wood (SCG, 1987)

Searching a Two Key Table Under a Single Key - J. Ian Munro (STOC, 1987)

Searchability in Merging and Implicit Data Structures. - J. Ian Munro; Patricio V. Poblete (BIT, 1987)

An Implicit Binomial Queue with Constant Insertion Time. - Svante Carlsson; J. Ian Munro; Patricio V. Poblete (SWAT, 1988)

Sorting with Minimum Data Movement (Preliminary Draft). - J. Ian Munro; Venkatesh Raman 001 (WADS, 1989)

Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations. - Joseph C. Culberson; J. Ian Munro (Comput. J., 1989)

Average case selection. - Walter Cunto; J. Ian Munro (J. ACM, 1989)

Last-Come-First-Served Hashing. - Patricio V. Poblete; J. Ian Munro (J. Algorithms, 1989)

Permuting - Faith E. Fich; J. Ian Munro; Patricio V. Poblete (FOCS, 1990)

Analysis of the Expected Search Cost in Skip Lists. - Thomas Papadakis; J. Ian Munro; Patricio V. Poblete (SWAT, 1990)

Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees. - Joseph C. Culberson; J. Ian Munro (Algorithmica, 1990)

Stable in Situ Sorting and Minimum Data Movement. - J. Ian Munro; Venkatesh Raman 001; Jeffrey S. Salowe (BIT, 1990)

Deterministic Optimal and Expedient Move-to-Rear List Organizing Strategies. - B. John Oommen; E. R. Hansen; J. Ian Munro (Theor. Comput. Sci., 1990)

Fast Sorting In-Place Sorting with O(n) Data. - J. Ian Munro; Venkatesh Raman 001 (FSTTCS, 1991)

A Case Study in Comparison Based Complexity: Finding the Nearest Value(s). - Walter Cunto; J. Ian Munro; Patricio V. Poblete (WADS, 1991)

Sorting Multisets and Vectors In-Place. - J. Ian Munro; Venkatesh Raman 001 (WADS, 1991)

An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time. - Amos Fiat; J. Ian Munro; Moni Naor; Alejandro A. Schäffer; Jeanette P. Schmidt; Alan Siegel (J. Comput. Syst. Sci., 1991)

Fringe Analysis for Extquick: An in Situ Distributive External Sorting Algorithm - Walter Cunto; Gaston H. Gonnet; J. Ian Munro; Patricio V. Poblete (Inf. Comput., 1991)

Selection from Read-Only Memory and Sorting with Optimum Data Movement. - J. Ian Munro; Venkatesh Raman 001 (FSTTCS, 1992)

Deterministic Skip Lists. - J. Ian Munro; Thomas Papadakis; Robert Sedgewick (SODA, 1992)

Average Search and Update Costs in Skip Lists. - Thomas Papadakis; J. Ian Munro; Patricio V. Poblete (BIT, 1992)

Sorting with Minimum Data Movement. - J. Ian Munro; Venkatesh Raman 001 (J. Algorithms, 1992)

Selecting the Median and Two Quartiles in a Set of Numbers. - Walter Cunto; J. Ian Munro; Manuel Rey (Softw. Pract. Exp., 1992)

Maintaining Discrete Probability Distributions Optimally. - Torben Hagerup; Kurt Mehlhorn; J. Ian Munro (ICALP, 1993)

Membership in Constant Time and Minimum Space. - Andrej Brodnik; J. Ian Munro (ESA, 1994)

The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract). - Patricio V. Poblete; Alfredo Viola; J. Ian Munro (ESA, 1994)

The Binomial Transform and its Application to the Analysis of Skip Lists. - Patricio V. Poblete; J. Ian Munro; Thomas Papadakis (ESA, 1995)

Permuting in Place. - Faith E. Fich; J. Ian Munro; Patricio V. Poblete (SIAM J. Comput., 1995)

Tables. - J. Ian Munro (FSTTCS, 1996)

Efficient Suffix Trees on Secondary Storage (extended Abstract). - David R. Clark; J. Ian Munro (SODA, 1996)

Neighbours on a Grid. - Andrej Brodnik; J. Ian Munro (SWAT, 1996)

Fast Stable In-Place Sorting with O (n) Data Moves. - J. Ian Munro; Venkatesh Raman 001 (Algorithmica, 1996)

Selection from Read-Only Memory and Sorting with Minimum Data Movement. - J. Ian Munro; Venkatesh Raman 001 (Theor. Comput. Sci., 1996)

Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs. - J. Ian Munro; Venkatesh Raman 001 (FOCS, 1997)

Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds. - Andrej Brodnik; Peter Bro Miltersen; J. Ian Munro (WADS, 1997)

The Diagonal Poisson Transform and its application to the analysis of a hashing scheme. - Patricio V. Poblete; Alfredo Viola; J. Ian Munro (Random Struct. Algorithms, 1997)

Fast Allocation and Deallocation with an Improved Buddy System. - Erik D. Demaine; J. Ian Munro (FSTTCS, 1999)

Representing Trees of Higer Degree. - David Benoit; Erik D. Demaine; J. Ian Munro; Venkatesh Raman 001 (WADS, 1999)

Resizable Arrays in Optimal Time and Space. - Andrej Brodnik; Svante Carlsson; Erik D. Demaine; J. Ian Munro; Robert Sedgewick (WADS, 1999)

Membership in Constant Time and Almost-Minimum Space. - Andrej Brodnik; J. Ian Munro (SIAM J. Comput., 1999)

On the Competitiveness of Linear Search. - J. Ian Munro (ESA, 2000)

Adaptive set intersections, unions, and differences. - Erik D. Demaine; Alejandro López-Ortiz; J. Ian Munro (SODA, 2000)

Experiments on Adaptive Set Intersections for Text Retrieval Systems. - Erik D. Demaine; Alejandro López-Ortiz; J. Ian Munro (ALENEX, 2001)

Worst case constant time priority queue. - Andrej Brodnik; Svante Carlsson; Johan Karlsson 003; J. Ian Munro (SODA, 2001)

Representing dynamic binary trees succinctly. - J. Ian Munro; Venkatesh Raman 001; Adam J. Storm (SODA, 2001)

The Complexity of Clickomania - Therese C. Biedl; Erik D. Demaine; Martin L. Demaine; Rudolf Fleischer; Lars Jacobsen; J. Ian Munro (CoRR, 2001)

Space Efficient Suffix Trees. - J. Ian Munro; Venkatesh Raman 001; S. Srinivasa Rao 001 (J. Algorithms, 2001)

Succinct Representation of Balanced Parentheses and Static Trees. - J. Ian Munro; Venkatesh Raman 001 (SIAM J. Comput., 2001)

Frequency Estimation of Internet Packet Streams with Limited Space. - Erik D. Demaine; Alejandro López-Ortiz; J. Ian Munro (ESA, 2002)

Implicit B-Trees: New Results for the Dictionary Problem. - Gianni Franceschini; Roberto Grossi; J. Ian Munro; Linda Pagli (FOCS, 2002)

Cache-oblivious priority queue and graph algorithm applications. - Lars Arge; Michael A. Bender; Erik D. Demaine; Bryan Holland-Minkley; J. Ian Munro (STOC, 2002)

Robot Localization without Depth Perception. - Erik D. Demaine; Alejandro López-Ortiz; J. Ian Munro (SWAT, 2002)

Efficient visibility queries in simple polygons. - Prosenjit Bose; Anna Lubiw; J. Ian Munro (Comput. Geom., 2002)

Efficient Tree Layout in a Multilevel Memory Hierarchy - Stephen Alstrup; Michael A. Bender; Erik D. Demaine; Martin Farach-Colton; J. Ian Munro; Theis Rauhe; Mikkel Thorup (CoRR, 2002)

Online Routing in Convex Subdivisions. - Prosenjit Bose; Andrej Brodnik; Svante Carlsson; Erik D. Demaine; Rudolf Fleischer; Alejandro López-Ortiz; Pat Morin; J. Ian Munro (Int. J. Comput. Geom. Appl., 2002)

The use of multimethodology in practice - results of a survey of practitioners. - Ian Munro 001; John Mingers (J. Oper. Res. Soc., 2002)

Succinct Representations of Permutations. - J. Ian Munro; Rajeev Raman; Venkatesh Raman 001; S. Srinivasa Rao 001 (ICALP, 2003)

Identifying frequent items in sliding windows over on-line packet streams. - Lukasz Golab; David DeHaan; Erik D. Demaine; Alejandro López-Ortiz; J. Ian Munro (Internet Measurement Conference, 2003)

Brief announcement: deterministic skipnet. - Nicholas J. A. Harvey; J. Ian Munro (PODC, 2003)

Efficient Generation of Uniform Samples from Phylogenetic Trees. - Paul E. Kearney; J. Ian Munro; Derek Phillips (WABI, 2003)

On universally easy classes for NP-complete problems. - Erik D. Demaine; Alejandro López-Ortiz; J. Ian Munro (Theor. Comput. Sci., 2003)

Succinct Representations of Functions. - J. Ian Munro; S. Srinivasa Rao 001 (ICALP, 2004)

Fun-Sort–or the chaos of unordered binary search. - Therese Biedl; Timothy M. Chan; Erik D. Demaine; Rudolf Fleischer; Mordecai J. Golin; James A. King; J. Ian Munro (Discret. Appl. Math., 2004)

Succinct Data Structures. - J. Ian Munro (CATS, 2004)

Deterministic SkipNet. - Nicholas J. A. Harvey; J. Ian Munro (Inf. Process. Lett., 2004)

Implicit B-trees: a new data structure for the dictionary problem. - Gianni Franceschini; Roberto Grossi; J. Ian Munro; Linda Pagli (J. Comput. Syst. Sci., 2004)

Response to Richard Ormerod. - Ian Munro 001; John Mingers (J. Oper. Res. Soc., 2004)

Succinct Representation of Data Structures. - J. Ian Munro; S. Srinivasa Rao 001 (Handbook of Data Structures and Applications, 2004)

Cache-Oblivious Comparison-Based Algorithms on Multisets. - Arash Farzan; Paolo Ferragina; Gianni Franceschini; J. Ian Munro (ESA, 2005)

Towards Optimal Multiple Selection. - Kanela Kaligosi; Kurt Mehlhorn; J. Ian Munro; Peter Sanders 001 (ICALP, 2005)

A categorization theorem on suffix arrays with applications to space efficient text indexes. - Meng He 001; J. Ian Munro; S. Srinivasa Rao 001 (SODA, 2005)

Fast allocation and deallocation with an improved buddy system. - Gerth Stølting Brodal; Erik D. Demaine; J. Ian Munro (Acta Informatica, 2005)

Representing Trees of Higher Degree. - David Benoit; Erik D. Demaine; J. Ian Munro; Rajeev Raman; Venkatesh Raman 001; S. Srinivasa Rao 001 (Algorithmica, 2005)

Worst case constant time priority queue. - Andrej Brodnik; Svante Carlsson; Michael L. Fredman; Johan Karlsson 003; J. Ian Munro (J. Syst. Softw., 2005)

An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture. - Andrej Brodnik; Johan Karlsson 003; J. Ian Munro; Andreas Nilsson (IFIP TCS, 2006)

Succinct representation of finite abelian groups. - Arash Farzan; J. Ian Munro (ISSAC, 2006)

Implicit dictionaries with O(1) modifications per update and fast search. - Gianni Franceschini; J. Ian Munro (SODA, 2006)

Rank/select operations on large alphabets: a tool for text indexing. - Alexander Golynski; J. Ian Munro; S. Srinivasa Rao 001 (SODA, 2006)

Structure, Scoring and Purpose of Computing Competitions. - Gordon V. Cormack; J. Ian Munro; Troy Vasiga; Graeme Kemkes (Informatics Educ., 2006)

Foreword. - Alejandro López-Ortiz; J. Ian Munro (ACM Trans. Algorithms, 2006)

Preface. - Kyung-Yong Chwa; J. Ian Munro (Theor. Comput. Sci., 2006)

The binomial transform and the analysis of skip lists. - Patricio V. Poblete; J. Ian Munro; Thomas Papadakis (Theor. Comput. Sci., 2006)

Succinct indexes for strings, binary relations and multi-labeled trees. - Jérémy Barbay; Meng He 001; J. Ian Munro; S. Srinivasa Rao 001 (SODA, 2007)

An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms. - Lars Arge; Michael A. Bender; Erik D. Demaine; Bryan Holland-Minkley; J. Ian Munro (SIAM J. Comput., 2007)

Adaptive searching in succinctly encoded binary relations and tree-structured documents. - Jérémy Barbay; Alexander Golynski; J. Ian Munro; S. Srinivasa Rao 001 (Theor. Comput. Sci., 2007)

Lower Bounds for Succinct Data Structures. - J. Ian Munro (CPM, 2008)

List Update Algorithms for Data Compression. - Reza Dorrigiv; Alejandro López-Ortiz; J. Ian Munro (DCC, 2008)

Succinct Representations of Arbitrary Graphs. - Arash Farzan; J. Ian Munro (ESA, 2008)

A Uniform Approach Towards Succinct Representation of Trees. - Arash Farzan; J. Ian Munro (SWAT, 2008)

Succinct Encoding of Permutations: Applications to Text Indexing. - Jérémy Barbay; J. Ian Munro (Encyclopedia of Algorithms, 2008)

Reflections on Optimal and Nearly Optimal Binary Search Trees. - J. Ian Munro (Efficient Algorithms, 2009)

Dynamic Succinct Ordered Trees. - Arash Farzan; J. Ian Munro (ICALP (1), 2009)

Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance. - Reza Dorrigiv; Stephane Durocher; Arash Farzan; Robert Fraser; Alejandro López-Ortiz; J. Ian Munro; Alejandro Salinger; Matthew Skala (WADS, 2009)

An Application of Self-organizing Data Structures to Compression. - Reza Dorrigiv; Alejandro López-Ortiz; J. Ian Munro (SEA, 2009)

Preface. - J. Ian Munro; Dorothea Wagner (ACM J. Exp. Algorithmics, 2009)

On the relative dominance of paging algorithms. - Reza Dorrigiv; Alejandro López-Ortiz; J. Ian Munro (Theor. Comput. Sci., 2009)

Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. - Gerth Stølting Brodal; Erik D. Demaine; Jeremy T. Fineman; John Iacono; Stefan Langerman; J. Ian Munro (SODA, 2010)

Range Queries over Untangled Chains. - Francisco Claude; J. Ian Munro; Patrick K. Nicholson (SPIRE, 2010)

Succinct Representations of Dynamic Strings. - Meng He 001; J. Ian Munro (SPIRE, 2010)

Integer Representation and Counting in the Bit Probe Model. - M. Ziaur Rahman; J. Ian Munro (Algorithmica, 2010)

Range Reporting for Moving Points on a Grid - Marek Karpinski; J. Ian Munro; Yakov Nekrich (CoRR, 2010)

Sorting with networks of data structures. - Therese Biedl; Alexander Golynski; Angèle M. Hamel; Alejandro López-Ortiz; J. Ian Munro (Discret. Appl. Math., 2010)

An Efficient Algorithm for Partial Order Production. - Jean Cardinal; Samuel Fiorini; Gwenaël Joret; Raphaël M. Jungers; J. Ian Munro (SIAM J. Comput., 2010)

Dynamic Range Selection in Linear Space. - Meng He 001; J. Ian Munro; Patrick K. Nicholson (ISAAC, 2011)

Path Queries in Weighted Trees. - Meng He 001; J. Ian Munro; Gelin Zhou (ISAAC, 2011)

Finding Frequent Elements in Compressed 2D Arrays and Strings. - Travis Gagie; Meng He 001; J. Ian Munro; Patrick K. Nicholson (SPIRE, 2011)

COCA Filters: Co-occurrence Aware Bloom Filters. - Kamran Tirdad; Pedram Ghodsnia; J. Ian Munro; Alejandro López-Ortiz (SPIRE, 2011)

Dynamic Range Majority Data Structures - Meng He 001; J. Ian Munro; Patrick K. Nicholson (CoRR, 2011)

Succinct indexes for strings, binary relations and multilabeled trees. - Jérémy Barbay; Meng He 001; J. Ian Munro; Srinivasa Rao Satti (ACM Trans. Algorithms, 2011)

Untangled monotonic chains and adaptive range search. - Diego Arroyuelo; Francisco Claude; Reza Dorrigiv; Stephane Durocher; Meng He 001; Alejandro López-Ortiz; J. Ian Munro; Patrick K. Nicholson; Alejandro Salinger; Matthew Skala (Theor. Comput. Sci., 2011)

Succinct representation of dynamic trees. - Arash Farzan; J. Ian Munro (Theor. Comput. Sci., 2011)

The Complexity of Partial Orders. - J. Ian Munro (ALENEX, 2012)

Succinct Data Structures for Path Queries. - Meng He 001; J. Ian Munro; Gelin Zhou (ESA, 2012)

Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima. - Arash Farzan; J. Ian Munro; Rajeev Raman (ICALP (1), 2012)

Succinct Representation of Labeled Graphs. - Jérémy Barbay; Luca Castelli Aleardi; Meng He 001; J. Ian Munro (Algorithmica, 2012)

Succinct ordinal trees based on tree covering. - Meng He 001; J. Ian Munro; Srinivasa Rao Satti (ACM Trans. Algorithms, 2012)

Succinct representations of permutations and functions. - J. Ian Munro; Rajeev Raman; Venkatesh Raman 001; S. Srinivasa Rao 001 (Theor. Comput. Sci., 2012)

Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers. - Timothy M. Chan; J. Ian Munro; Venkatesh Raman 001 (ISAAC, 2013)

The Distance 4-Sector of Two Points Is Unique. - Robert Fraser; Meng He 001; Akitoshi Kawamura; Alejandro López-Ortiz; J. Ian Munro; Patrick K. Nicholson (ISAAC, 2013)

Succinct Data Structures for Representing Equivalence Classes. - Moshe Lewenstein; J. Ian Munro; Venkatesh Raman 001 (ISAAC, 2013)

Adaptive Data Structures for Permutations and Binary Relations. - Francisco Claude; J. Ian Munro (SPIRE, 2013)

Document Listing on Versioned Documents. - Francisco Claude; J. Ian Munro (SPIRE, 2013)

Sorting under partial information (without the ellipsoid algorithm). - Jean Cardinal; Samuel Fiorini; Gwenaël Joret; Raphaël M. Jungers; J. Ian Munro (Comb., 2013)

Range majority in constant time and linear space. - Stephane Durocher; Meng He 001; J. Ian Munro; Patrick K. Nicholson; Matthew Skala (Inf. Comput., 2013)

A novel approach for leveraging co-occurrence to improve the false positive error in signature files. - Pedram Ghodsnia; Kamran Tirdad; J. Ian Munro; Alejandro López-Ortiz (J. Discrete Algorithms, 2013)

Succinct encoding of arbitrary graphs. - Arash Farzan; J. Ian Munro (Theor. Comput. Sci., 2013)

Multi-Pivot Quicksort: Theory and Experiments. - Shrinu Kushagra; Alejandro López-Ortiz; Aurick Qiao; J. Ian Munro (ALENEX, 2014)

Succinct Indices for Path Minimum, with Applications to Path Reporting. - Timothy M. Chan; Meng He 001; J. Ian Munro; Gelin Zhou (ESA, 2014)

Improved Explicit Data Structures in the Bitprobe Model. - Moshe Lewenstein; J. Ian Munro; Patrick K. Nicholson; Venkatesh Raman 001 (ESA, 2014)

Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes. - Hicham El-Zein; J. Ian Munro; Venkatesh Raman 001 (ISAAC, 2014)

Dynamic Path Counting and Reporting in Linear Space. - Meng He 001; J. Ian Munro; Gelin Zhou (ISAAC, 2014)

In as Few Comparisons as Possible. - J. Ian Munro (WALCOM, 2014)

A Uniform Paradigm to Succinctly Encode Various Families of Trees. - Arash Farzan; J. Ian Munro (Algorithmica, 2014)

A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. - Meng He 001; J. Ian Munro; Gelin Zhou (Algorithmica, 2014)

Space efficient data structures for dynamic orthogonal range counting. - Meng He 001; J. Ian Munro (Comput. Geom., 2014)

The Hausdorff Core Problem on Simple Polygons. - Reza Dorrigiv; Stephane Durocher; Arash Farzan; Robert Fraser; Alejandro López-Ortiz; J. Ian Munro; Alejandro Salinger; Matthew Skala (J. Comput. Geom., 2014)

Less space: Indexing for queries with wildcards. - Moshe Lewenstein; J. Ian Munro; Venkatesh Raman 001; Sharma V. Thankachan (Theor. Comput. Sci., 2014)

Range Counting with Distinct Constraints. - J. Ian Munro; Yakov Nekrich; Sharma V. Thankachan (CCCG, 2015)

Compressed Data Structures for Dynamic Sequences. - J. Ian Munro; Yakov Nekrich (ESA, 2015)

Optimal Search Trees with 2-Way Comparisons. - Marek Chrobak; Mordecai J. Golin; J. Ian Munro; Neal E. Young (ISAAC, 2015)

On the Succinct Representation of Unlabeled Permutations. - Hicham El-Zein; J. Ian Munro; Siwei Yang (ISAAC, 2015)

Dynamic Data Structures for Document Collections and Graphs. - J. Ian Munro; Yakov Nekrich; Jeffrey Scott Vitter (PODS, 2015)

Sorting and Selection with Equality Comparisons. - Varunkumar Jayapaul; J. Ian Munro; Venkatesh Raman 001; Srinivasa Rao Satti (WADS, 2015)

Optimal search trees with equality tests. - Marek Chrobak; Mordecai J. Golin; J. Ian Munro; Neal E. Young (CoRR, 2015)

Finding median in read-only memory on integer input. - Timothy M. Chan; J. Ian Munro; Venkatesh Raman 001 (Theor. Comput. Sci., 2015)

Low space data structures for geometric range mode query. - Stephane Durocher; Hicham El-Zein; J. Ian Munro; Sharma V. Thankachan (Theor. Comput. Sci., 2015)

On hardness of several string indexing problems. - Kasper Green Larsen; J. Ian Munro; Jesper Sindahl Nielsen; Sharma V. Thankachan (Theor. Comput. Sci., 2015)

Raising Permutations to Powers in Place. - Hicham El-Zein; J. Ian Munro; Matthew Robertson (ISAAC, 2016)

Succinct Data Structures ... Potential for Symbolic Computation? - J. Ian Munro (ISSAC, 2016)

Succinct Posets. - J. Ian Munro; Patrick K. Nicholson (Algorithmica, 2016)

Data Structures for Path Queries. - Meng He 001; J. Ian Munro; Gelin Zhou (ACM Trans. Algorithms, 2016)

Permuted scaled matching. - Ayelet Butman; Noa Lewenstein; J. Ian Munro (Theor. Comput. Sci., 2016)

Dynamic range majority data structures. - Amr Elmasry; Meng He 001; J. Ian Munro; Patrick K. Nicholson (Theor. Comput. Sci., 2016)

Document retrieval with one wildcard. - Moshe Lewenstein; J. Ian Munro; Yakov Nekrich; Sharma V. Thankachan (Theor. Comput. Sci., 2016)

Fast construction of wavelet trees. - J. Ian Munro; Yakov Nekrich; Jeffrey Scott Vitter (Theor. Comput. Sci., 2016)

Compressed Representations of Graphs. - J. Ian Munro; Patrick K. Nicholson (Encyclopedia of Algorithms, 2016)

Succinct Color Searching in One Dimension. - Hicham El-Zein; J. Ian Munro; Yakov Nekrich (ISAAC, 2017)

Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. - J. Ian Munro; Gonzalo Navarro 001; Yakov Nekrich (SODA, 2017)

Succinct Indices for Path Minimum, with Applications. - Timothy M. Chan; Meng He 001; J. Ian Munro; Gelin Zhou (Algorithmica, 2017)

On the Succinct Representation of Equivalence Classes. - Hicham El-Zein; Moshe Lewenstein; J. Ian Munro; Venkatesh Raman 001; Timothy M. Chan (Algorithmica, 2017)

Top-k Term-Proximity in Succinct Space. - J. Ian Munro; Gonzalo Navarro 001; Jesper Sindahl Nielsen; Rahul Shah 001; Sharma V. Thankachan (Algorithmica, 2017)

Finding modes with equality comparisons. - Varunkumar Jayapaul; J. Ian Munro; Venkatesh Raman 001; S. Srinivasa Rao 001 (Theor. Comput. Sci., 2017)

Improved Time and Space Bounds for Dynamic Range Mode. - Hicham El-Zein; Meng He 001; J. Ian Munro; Bryce Sandlund (ESA, 2018)

Dynamic Trees with Almost-Optimal Access Cost. - Mordecai J. Golin; John Iacono; Stefan Langerman; J. Ian Munro; Yakov Nekrich (ESA, 2018)

Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. - J. Ian Munro; Sebastian Wild (ESA, 2018)

Succinct Data Structures for Chordal Graphs. - J. Ian Munro; Kaiyu Wu (ISAAC, 2018)

Time and Space Efficient Representations of Distributive Lattices. - J. Ian Munro; Corwin Sinnamon (SODA, 2018)

Succinct Dynamic One-Dimensional Point Reporting. - Hicham El-Zein; J. Ian Munro; Yakov Nekrich (SWAT, 2018)

Dynamic Path Queries in Linear Space. - Meng He 001; J. Ian Munro; Gelin Zhou (Algorithmica, 2018)

Selection and Sorting in the "Restore" Model. - Timothy M. Chan; J. Ian Munro; Venkatesh Raman 001 (ACM Trans. Algorithms, 2018)

Dynamic Planar Point Location in External Memory. - J. Ian Munro; Yakov Nekrich (SoCG, 2019)

Categorical Range Reporting with Frequencies. - Arnab Ganguly 002; J. Ian Munro; Yakov Nekrich; Rahul Shah 001; Sharma V. Thankachan (ICDT, 2019)

On Approximate Range Mode and Range Selection. - Hicham El-Zein; Meng He 001; J. Ian Munro; Yakov Nekrich; Bryce Sandlund (ISAAC, 2019)

Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space. - J. Ian Munro; Sebastian Wild (CoRR, 2019)

Dynamic Optimality Refuted - For Tournament Heaps. - J. Ian Munro; Richard Peng; Sebastian Wild; Lingyi Zhang (CoRR, 2019)

Text Indexing and Searching in Sublinear Time. - J. Ian Munro; Gonzalo Navarro 001; Yakov Nekrich (CPM, 2020)

Space Efficient Construction of Lyndon Arrays in Linear Time. - Philip Bille; Jonas Ellert; Johannes Fischer 001; Inge Li Gørtz; Florian Kurpicz; J. Ian Munro; Eva Rotenberg (ICALP, 2020)

Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. - Meng He 001; J. Ian Munro; Yakov Nekrich; Sebastian Wild; Kaiyu Wu (ISAAC, 2020)

Space-Efficient Data Structures for Lattices. - J. Ian Munro; Bryce Sandlund; Corwin Sinnamon (SWAT, 2020)

Fast Compressed Self-indexes with Deterministic Linear-Time Construction. - J. Ian Munro; Gonzalo Navarro 001; Yakov Nekrich (Algorithmica, 2020)

Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs. - Meng He 001; J. Ian Munro; Yakov Nekrich; Sebastian Wild; Kaiyu Wu (CoRR, 2020)

Faster algorithms for some optimization problems on collinear points. - Ahmad Biniaz; Prosenjit Bose; Paz Carmi; Anil Maheshwari; J. Ian Munro; Michiel H. M. Smid (J. Comput. Geom., 2020)

Ranked document selection. - J. Ian Munro; Gonzalo Navarro 001; Rahul Shah 001; Sharma V. Thankachan (Theor. Comput. Sci., 2020)

Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima. - J. Ian Munro; Patrick K. Nicholson; Louisa Seelbach Benkner; Sebastian Wild (ESA, 2021)

Dynamic Boolean Formula Evaluation. - Rathish Das; Andrea Lincoln; Jayson Lynch; J. Ian Munro (ISAAC, 2021)

Range Majorities and Minorities in Arrays. - Djamal Belazzougui; Travis Gagie; J. Ian Munro; Gonzalo Navarro 001; Yakov Nekrich (Algorithmica, 2021)

Hypersuccinct Trees - New universal tree source codes for optimal compressed tree data structures. - J. Ian Munro; Patrick K. Nicholson; Louisa Seelbach Benkner; Sebastian Wild (CoRR, 2021)

On the cost of unsuccessful searches in search trees with two-way comparisons. - Marek Chrobak; Mordecai J. Golin; J. Ian Munro; Neal E. Young (Inf. Comput., 2021)

Shortest Beer Path Queries in Interval Graphs. - Rathish Das; Meng He 001; Eitan Kondratovsky; J. Ian Munro; Anurag Murty Naredla; Kaiyu Wu (ISAAC, 2022)

Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries. - Rathish Das; Meng He 001; Eitan Kondratovsky; J. Ian Munro; Kaiyu Wu (SPIRE, 2022)

On Huang and Wong's algorithm for generalized binary split trees. - Marek Chrobak; Mordecai J. Golin; J. Ian Munro; Neal E. Young (Acta Informatica, 2022)

A Simple Algorithm for Optimal Search Trees with Two-way Comparisons. - Marek Chrobak; Mordecai J. Golin; J. Ian Munro; Neal E. Young (ACM Trans. Algorithms, 2022)

A Compact Representation for AVL Trees. - Jeremy Chizewer; Stephen Melczer; J. Ian Munro; Ava Pun (CoRR, 2023)

Enumeration and Succinct Encoding of AVL Trees. - Jeremy Chizewer; Stephen Melczer; J. Ian Munro; Ava Pun (AofA, 2024)

Succinct Data Structures for Path Graphs and Chordal Graphs Revisited. - Meng He 001; J. Ian Munro; Kaiyu Wu (DCC, 2024)

Succinct Data Structures for Bounded Degree/Chromatic Number Interval Graphs. - Meng He 001; J. Ian Munro; Kaiyu Wu (DCC, 2024)

Distance queries over dynamic interval graphs. - Jingbang Chen; Meng He 001; J. Ian Munro; Richard Peng; Kaiyu Wu; Daniel J. Zhang (Comput. Geom., 2024)