| 2024 | AofA | Enumeration and Succinct Encoding of AVL Trees. | Jeremy Chizewer, Stephen Melczer, J. Ian Munro, Ava Pun |
| 2024 | DCC | Succinct Data Structures for Path Graphs and Chordal Graphs Revisited. | Meng He, J. Ian Munro, Kaiyu Wu |
| 2024 | DCC | Succinct Data Structures for Bounded Degree/Chromatic Number Interval Graphs. | Meng He, J. Ian Munro, Kaiyu Wu |
| 2023 | ISAAC | Distance Queries over Dynamic Interval Graphs. | Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang |
| 2022 | ISAAC | Shortest Beer Path Queries in Interval Graphs. | Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu |
| 2022 | SPIRE | Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries. | Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Kaiyu Wu |
| 2021 | ESA | 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 |
| 2021 | ISAAC | Dynamic Boolean Formula Evaluation. | Rathish Das, Andrea Lincoln, Jayson Lynch, J. Ian Munro |
| 2020 | CPM | Text Indexing and Searching in Sublinear Time. | J. Ian Munro, Gonzalo Navarro, Yakov Nekrich |
| 2020 | ICALP | Space Efficient Construction of Lyndon Arrays in Linear Time. | Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Grtz, Florian Kurpicz, J. Ian Munro, Eva Rotenberg |
| 2020 | ISAAC | Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. | Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu |
| 2019 | ICDT | Categorical Range Reporting with Frequencies. | Arnab Ganguly, J. Ian Munro, Yakov Nekrich, Rahul Shah, Sharma V. Thankachan |
| 2019 | ISAAC | On Approximate Range Mode and Range Selection. | Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund |
| 2018 | ESA | Improved Time and Space Bounds for Dynamic Range Mode. | Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund |
| 2018 | ESA | Dynamic Trees with Almost-Optimal Access Cost. | Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich |
| 2018 | ESA | Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. | J. Ian Munro, Sebastian Wild |
| 2018 | ISAAC | Succinct Data Structures for Chordal Graphs. | J. Ian Munro, Kaiyu Wu |
| 2018 | SODA | Time and Space Efficient Representations of Distributive Lattices. | J. Ian Munro, Corwin Sinnamon |
| 2017 | ISAAC | Succinct Color Searching in One Dimension. | Hicham El-Zein, J. Ian Munro, Yakov Nekrich |
| 2017 | ISAAC | Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. | J. Ian Munro, Gonzalo Navarro, Yakov Nekrich |
| 2017 | SODA | Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. | J. Ian Munro, Gonzalo Navarro, Yakov Nekrich |
| 2016 | ISAAC | Raising Permutations to Powers in Place. | Hicham El-Zein, J. Ian Munro, Matthew Robertson |
| 2016 | ISSAC | Succinct Data Structures ... Potential for Symbolic Computation? | J. Ian Munro |
| 2015 | ESA | Compressed Data Structures for Dynamic Sequences. | J. Ian Munro, Yakov Nekrich |
| 2015 | ISAAC | Optimal Search Trees with 2-Way Comparisons. | Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young |
| 2015 | ISAAC | On the Succinct Representation of Unlabeled Permutations. | Hicham El-Zein, J. Ian Munro, Siwei Yang |
| 2015 | PODS | Dynamic Data Structures for Document Collections and Graphs. | J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter |
| 2015 | WADS | Sorting and Selection with Equality Comparisons. | Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, Srinivasa Rao Satti |
| 2014 | ALENEX | Multi-Pivot Quicksort: Theory and Experiments. | Shrinu Kushagra, Alejandro Lpez-Ortiz, Aurick Qiao, J. Ian Munro |
| 2014 | CPM | Permuted Scaled Matching. | Ayelet Butman, Noa Lewenstein, J. Ian Munro |
| 2014 | CPM | On Hardness of Several String Indexing Problems. | Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan |
| 2014 | ESA | Succinct Indices for Path Minimum, with Applications to Path Reporting. | Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou |
| 2014 | ESA | Improved Explicit Data Structures in the Bitprobe Model. | Moshe Lewenstein, J. Ian Munro, Patrick K. Nicholson, Venkatesh Raman |
| 2014 | ISAAC | Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes. | Hicham El-Zein, J. Ian Munro, Venkatesh Raman |
| 2014 | ISAAC | Dynamic Path Counting and Reporting in Linear Space. | Meng He, J. Ian Munro, Gelin Zhou |
| 2014 | ISAAC | Top- k Term-Proximity in Succinct Space. | J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan |
| 2014 | MFCS | Document Retrieval with One Wildcard. | Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan |
| 2014 | SODA | Selection and Sorting in the "Restore" Model. | Timothy M. Chan, J. Ian Munro, Venkatesh Raman |
| 2014 | SPIRE | Fast Construction of Wavelet Trees. | J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter |
| 2014 | WALCOM | In as Few Comparisons as Possible. | J. Ian Munro |
| 2013 | ISAAC | Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers. | Timothy M. Chan, J. Ian Munro, Venkatesh Raman |
| 2013 | ISAAC | The Distance 4-Sector of Two Points Is Unique. | Robert Fraser, Meng He, Akitoshi Kawamura, Alejandro Lpez-Ortiz, J. Ian Munro, Patrick K. Nicholson |
| 2013 | ISAAC | Succinct Data Structures for Representing Equivalence Classes. | Moshe Lewenstein, J. Ian Munro, Venkatesh Raman |
| 2013 | ISAAC | Less Space: Indexing for Queries with Wildcards. | Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan |
| 2013 | SPIRE | Adaptive Data Structures for Permutations and Binary Relations. | Francisco Claude, J. Ian Munro |
| 2013 | SPIRE | Document Listing on Versioned Documents. | Francisco Claude, J. Ian Munro |
| 2012 | ALENEX | The Complexity of Partial Orders. | J. Ian Munro |
| 2012 | ESA | Succinct Data Structures for Path Queries. | Meng He, J. Ian Munro, Gelin Zhou |
| 2012 | ESA | Succinct Posets. | J. Ian Munro, Patrick K. Nicholson |
| 2012 | ICALP | Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima. | Arash Farzan, J. Ian Munro, Rajeev Raman |
| 2012 | ISAAC | A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. | Meng He, J. Ian Munro, Gelin Zhou |
| 2011 | ICALP | Range Majority in Constant Time and Linear Space. | Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala |
| 2011 | ISAAC | Dynamic Range Majority Data Structures. | Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson |
| 2011 | ISAAC | Dynamic Range Selection in Linear Space. | Meng He, J. Ian Munro, Patrick K. Nicholson |
| 2011 | ISAAC | Path Queries in Weighted Trees. | Meng He, J. Ian Munro, Gelin Zhou |
| 2011 | SPIRE | Finding Frequent Elements in Compressed 2D Arrays and Strings. | Travis Gagie, Meng He, J. Ian Munro, Patrick K. Nicholson |
| 2011 | SPIRE | COCA Filters: Co-occurrence Aware Bloom Filters. | Kamran Tirdad, Pedram Ghodsnia, J. Ian Munro, Alejandro Lpez-Ortiz |
| 2011 | WADS | Space Efficient Data Structures for Dynamic Orthogonal Range Counting. | Meng He, J. Ian Munro |
| 2010 | SODA | Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. | Gerth Stlting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro |
| 2010 | STOC | Sorting under partial information (without the ellipsoid algorithm). | Jean Cardinal, Samuel Fiorini, Gwenal Joret, Raphal M. Jungers, J. Ian Munro |
| 2010 | SPIRE | Range Queries over Untangled Chains. | Francisco Claude, J. Ian Munro, Patrick K. Nicholson |
| 2010 | SPIRE | Succinct Representations of Dynamic Strings. | Meng He, J. Ian Munro |
| 2009 | ICALP | Dynamic Succinct Ordered Trees. | Arash Farzan, J. Ian Munro |
| 2009 | ISAAC | Untangled Monotonic Chains and Adaptive Range Search. | Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro Lpez-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala |
| 2009 | STOC | An efficient algorithm for partial order production. | Jean Cardinal, Samuel Fiorini, Gwenal Joret, Raphal M. Jungers, J. Ian Munro |
| 2009 | WADS | Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance. | Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro Lpez-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala |
| 2008 | CPM | Lower Bounds for Succinct Data Structures. | J. Ian Munro |
| 2008 | DCC | List Update Algorithms for Data Compression. | Reza Dorrigiv, Alejandro Lpez-Ortiz, J. Ian Munro |
| 2008 | ESA | Succinct Representations of Arbitrary Graphs. | Arash Farzan, J. Ian Munro |
| 2007 | ICALP | Succinct Ordinal Trees Based on Tree Covering. | Meng He, J. Ian Munro, S. Srinivasa Rao |
| 2007 | ISAAC | Succinct Representation of Labeled Graphs. | Jrmy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro |
| 2007 | ISAAC | On the Relative Dominance of Paging Algorithms. | Reza Dorrigiv, Alejandro Lpez-Ortiz, J. Ian Munro |
| 2007 | ISAAC | Integer Representation and Counting in the Bit Probe Model. | M. Ziaur Rahman, J. Ian Munro |
| 2007 | SODA | Succinct indexes for strings, binary relations and multi-labeled trees. | Jrmy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao |
| 2006 | CPM | Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents. | Jrmy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao |
| 2006 | ISSAC | Succinct representation of finite abelian groups. | Arash Farzan, J. Ian Munro |
| 2006 | SODA | Implicit dictionaries with | Gianni Franceschini, J. Ian Munro |
| 2006 | SODA | Rank/select operations on large alphabets: a tool for text indexing. | Alexander Golynski, J. Ian Munro, S. Srinivasa Rao |
| 2005 | ESA | Cache-Oblivious Comparison-Based Algorithms on Multisets. | Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro |
| 2005 | ICALP | Towards Optimal Multiple Selection. | Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders |
| 2005 | SODA | A categorization theorem on suffix arrays with applications to space efficient text indexes. | Meng He, J. Ian Munro, S. Srinivasa Rao |
| 2004 | ICALP | Succinct Representations of Functions. | J. Ian Munro, S. Srinivasa Rao |
| 2003 | ICALP | Succinct Representations of Permutations. | J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
| 2003 | IMC | Identifying frequent items in sliding windows over on-line packet streams. | Lukasz Golab, David DeHaan, Erik D. Demaine, Alejandro Lpez-Ortiz, J. Ian Munro |
| 2003 | PODC | Brief announcement: deterministic skipnet. | Nicholas J. A. Harvey, J. Ian Munro |
| 2003 | WABI | Efficient Generation of Uniform Samples from Phylogenetic Trees. | Paul E. Kearney, J. Ian Munro, Derek Phillips |
| 2002 | ESA | Frequency Estimation of Internet Packet Streams with Limited Space. | Erik D. Demaine, Alejandro Lpez-Ortiz, J. Ian Munro |
| 2002 | FOCS | Implicit B-Trees: New Results for the Dictionary Problem. | Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli |
| 2002 | STOC | Cache-oblivious priority queue and graph algorithm applications. | Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro |
| 2001 | ALENEX | Experiments on Adaptive Set Intersections for Text Retrieval Systems. | Erik D. Demaine, Alejandro Lpez-Ortiz, J. Ian Munro |
| 2001 | SODA | Worst case constant time priority queue. | Andrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro |
| 2001 | SODA | On universally easy classes for NP-complete problems. | Erik D. Demaine, Alejandro Lpez-Ortiz, J. Ian Munro |
| 2001 | SODA | Representing dynamic binary trees succinctly. | J. Ian Munro, Venkatesh Raman, Adam J. Storm |
| 2000 | ESA | On the Competitiveness of Linear Search. | J. Ian Munro |
| 2000 | ISAAC | Online Routing in Convex Subdivisions. | Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro Lpez-Ortiz |
| 2000 | SODA | Adaptive set intersections, unions, and differences. | Erik D. Demaine, Alejandro Lpez-Ortiz, J. Ian Munro |
| 1999 | WADS | Representing Trees of Higer Degree. | David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman |
| 1999 | WADS | Resizable Arrays in Optimal Time and Space. | Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick |
| 1997 | FOCS | Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs. | J. Ian Munro, Venkatesh Raman |
| 1997 | WADS | Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds. | Andrej Brodnik, Peter Bro Miltersen, J. Ian Munro |
| 1996 | SODA | Efficient Suffix Trees on Secondary Storage (extended Abstract). | David R. Clark, J. Ian Munro |
| 1995 | ESA | The Binomial Transform and its Application to the Analysis of Skip Lists. | Patricio V. Poblete, J. Ian Munro, Thomas Papadakis |
| 1994 | ESA | Membership in Constant Time and Minimum Space. | Andrej Brodnik, J. Ian Munro |
| 1994 | ESA | The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract). | Patricio V. Poblete, Alfredo Viola, J. Ian Munro |
| 1993 | ICALP | Maintaining Discrete Probability Distributions Optimally. | Torben Hagerup, Kurt Mehlhorn, J. Ian Munro |
| 1992 | SODA | Deterministic Skip Lists. | J. Ian Munro, Thomas Papadakis, Robert Sedgewick |
| 1991 | WADS | A Case Study in Comparison Based Complexity: Finding the Nearest Value(s). | Walter Cunto, J. Ian Munro, Patricio V. Poblete |
| 1991 | WADS | Sorting Multisets and Vectors In-Place. | J. Ian Munro, Venkatesh Raman |
| 1990 | FOCS | Permuting | Faith E. Fich, J. Ian Munro, Patricio V. Poblete |
| 1989 | WADS | Sorting with Minimum Data Movement (Preliminary Draft). | J. Ian Munro, Venkatesh Raman |
| 1987 | STOC | Searching a Two Key Table Under a Single Key | J. Ian Munro |
| 1986 | MFCS | Developing Implicit Data Structures. | J. Ian Munro |
| 1985 | FOCS | Robin Hood Hashing (Preliminary Report) | Pedro Celis, Per-ke Larson, J. Ian Munro |
| 1985 | ICALP | The Nearest Neighbor Problem on Bounded Domains. | Rolf G. Karlsson, J. Ian Munro, Edward L. Robertson |
| 1985 | STACS | Proximity of a Grid. | Rolf G. Karlsson, J. Ian Munro |
| 1984 | FOCS | An Implicit Data Structure for the Dictionary Problem that Runs in Polylog Time | J. Ian Munro |
| 1984 | STOC | Average Case Selection | Walter Cunto, J. Ian Munro |
| 1983 | ICALP | Searchability in Merging and Implicit Data Structures. | J. Ian Munro, Patricio V. Poblete |
| 1983 | PODS | A Discipline for Robustness or Storage Reduction in Binary Search Trees. | J. Ian Munro, Patricio V. Poblete |
| 1982 | ICALP | Heaps on Heaps. | Gaston H. Gonnet, J. Ian Munro |
| 1981 | MFCS | Partial Match Retrieval in Implicit Data Structures. | Helmut Alt, Kurt Mehlhorn, J. Ian Munro |
| 1981 | STOC | A Linear Probing Sort and its Analysis (Preliminary Draft) | Gaston H. Gonnet, J. Ian Munro |
| 1980 | FOCS | Efficient Uses of the Past | David P. Dobkin, J. Ian Munro |
| 1979 | FOCS | Toward Self-Organizing Linear Search (Preliminary Draught) | Gaston H. Gonnet, J. Ian Munro, Hendra Suwanda |
| 1979 | STOC | Implicit Data Structures (Preliminary Draft) | J. Ian Munro, Hendra Suwanda |
| 1978 | FOCS | Selection and Sorting with Limited Storage | J. Ian Munro, Mike Paterson |
| 1978 | ICALP | Time and Space Bounds for Selection Problems. | David P. Dobkin, J. Ian Munro |
| 1977 | FCT | The Parallel Complexity of Arithmetic Computation. | J. Ian Munro |
| 1977 | STOC | The Analysis of an Improved Hashing Technique | Gaston H. Gonnet, J. Ian Munro |
| 1976 | FOCS | Self-Organizing Binary Search Trees | Brian Allen, J. Ian Munro |
| 1971 | FOCS | Optimal Algorithms for Parallel Polynomial Evaluation | J. Ian Munro, Mike Paterson |
| 1971 | STOC | Some Results Concerning Efficient and Optimal Algorithms | J. Ian Munro |