J. Ian Munro

ORCID

Publication Activity (10 Years)

Years Active: 1971-2024
Publications (10 Years): 67

Top Venues

Publications

Meng He, J. Ian Munro, Kaiyu Wu
Succinct Data Structures for Bounded Degree/Chromatic Number Interval Graphs. DCC (2024)
Meng He, J. Ian Munro, Kaiyu Wu
Succinct Data Structures for Path Graphs and Chordal Graphs Revisited. DCC (2024)
Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang
Distance queries over dynamic interval graphs. Comput. Geom. 122 (2024)
Jeremy Chizewer, Stephen Melczer, J. Ian Munro, Ava Pun
Enumeration and Succinct Encoding of AVL Trees. AofA (2024)
Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang
Distance Queries over Dynamic Interval Graphs. ISAAC (2023)
Jeremy Chizewer, Stephen Melczer, J. Ian Munro, Ava Pun
A Compact Representation for AVL Trees. CoRR (2023)
Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu
Shortest Beer Path Queries in Interval Graphs. CoRR (2022)
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons. ACM Trans. Algorithms 18 (1) (2022)
Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Kaiyu Wu
Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries. SPIRE (2022)
Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu
Shortest Beer Path Queries in Interval Graphs. ISAAC (2022)
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
On Huang and Wong's algorithm for generalized binary split trees. Acta Informatica 59 (6) (2022)
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
On the Cost of Unsuccessful Searches in Search Trees with Two-way Comparisons. CoRR (2021)
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
A Simple Algorithm for Optimal Search Trees with Two-Way Comparisons. CoRR (2021)
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
On the cost of unsuccessful searches in search trees with two-way comparisons. Inf. Comput. 281 (2021)
Rathish Das, Andrea Lincoln, Jayson Lynch, J. Ian Munro
Dynamic Boolean Formula Evaluation. ISAAC (2021)
Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
Range Majorities and Minorities in Arrays. Algorithmica 83 (6) (2021)
J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, Sebastian Wild
Hypersuccinct Trees - New universal tree source codes for optimal compressed tree data structures. CoRR (2021)
J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, Sebastian Wild
Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima. ESA (2021)
Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, J. Ian Munro, Eva Rotenberg
Space Efficient Construction of Lyndon Arrays in Linear Time. ICALP (2020)
J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
Fast Compressed Self-indexes with Deterministic Linear-Time Construction. Algorithmica 82 (2) (2020)
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
Faster algorithms for some optimization problems on collinear points. J. Comput. Geom. 11 (1) (2020)
J. Ian Munro, Bryce Sandlund, Corwin Sinnamon
Space-Efficient Data Structures for Lattices. SWAT (2020)
Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu
Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. ISAAC (2020)
J. Ian Munro, Gonzalo Navarro, Rahul Shah, Sharma V. Thankachan
Ranked document selection. Theor. Comput. Sci. 812 (2020)
Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu
Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs. CoRR (2020)
J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
Text Indexing and Searching in Sublinear Time. CPM (2020)
Arnab Ganguly, J. Ian Munro, Yakov Nekrich, Rahul Shah, Sharma V. Thankachan
Categorical Range Reporting with Frequencies. ICDT (2019)
J. Ian Munro, Yakov Nekrich
Dynamic Planar Point Location in External Memory. CoRR (2019)
J. Ian Munro, Sebastian Wild
Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space. CoRR (2019)
Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund
On Approximate Range Mode and Range Selection. ISAAC (2019)
J. Ian Munro, Yakov Nekrich
Dynamic Planar Point Location in External Memory. SoCG (2019)
J. Ian Munro, Bryce Sandlund, Corwin Sinnamon
Space-Efficient Data Structures for Lattices. CoRR (2019)
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
On Huang and Wong's Algorithm for Generalized Binary Split Trees. CoRR (2019)
J. Ian Munro, Richard Peng, Sebastian Wild, Lingyi Zhang
Dynamic Optimality Refuted - For Tournament Heaps. CoRR (2019)
Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund
On Approximate Range Mode and Range Selection. CoRR (2019)
J. Ian Munro, Kaiyu Wu
Succinct Data Structures for Chordal Graphs. ISAAC (2018)
Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich
Dynamic Trees with Almost-Optimal Access Cost. CoRR (2018)
Hicham El-Zein, J. Ian Munro, Yakov Nekrich
Succinct Dynamic One-Dimensional Point Reporting. SWAT (2018)
J. Ian Munro, Sebastian Wild
Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. CoRR (2018)
Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund
Improved Time and Space Bounds for Dynamic Range Mode. ESA (2018)
J. Ian Munro, Corwin Sinnamon
Time and Space Efficient Representations of Distributive Lattices. SODA (2018)
J. Ian Munro, Sebastian Wild
Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. ESA (2018)
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
Faster Algorithms for some Optimization Problems on Collinear Points. CoRR (2018)
Meng He, J. Ian Munro, Gelin Zhou
Dynamic Path Queries in Linear Space. Algorithmica 80 (12) (2018)
Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich
Dynamic Trees with Almost-Optimal Access Cost. ESA (2018)
Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund
Improved Time and Space Bounds for Dynamic Range Mode. CoRR (2018)
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
Faster Algorithms for some Optimization Problems on Collinear Points. SoCG (2018)
Timothy M. Chan, J. Ian Munro, Venkatesh Raman
Selection and Sorting in the "Restore" Model. ACM Trans. Algorithms 14 (2) (2018)
J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. ISAAC (2017)
J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan
Top-k Term-Proximity in Succinct Space. Algorithmica 78 (2) (2017)
J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
Text Indexing and Searching in Sublinear Time. CoRR (2017)
Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
Finding modes with equality comparisons. Theor. Comput. Sci. 704 (2017)
Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou
Succinct Indices for Path Minimum, with Applications. Algorithmica 78 (2) (2017)
J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. CoRR (2017)
J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. SODA (2017)
Hicham El-Zein, J. Ian Munro, Yakov Nekrich
Succinct Color Searching in One Dimension. ISAAC (2017)
Hicham El-Zein, Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Timothy M. Chan
On the Succinct Representation of Equivalence Classes. Algorithmica 78 (3) (2017)
J. Ian Munro
Succinct Data Structures ... Potential for Symbolic Computation? ISSAC (2016)
Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson
Dynamic range majority data structures. Theor. Comput. Sci. 647 (2016)
Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan
Document retrieval with one wildcard. Theor. Comput. Sci. 635 (2016)
Hicham El-Zein, J. Ian Munro, Matthew Robertson
Raising Permutations to Powers in Place. ISAAC (2016)
J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. CoRR (2016)
J. Ian Munro, Patrick K. Nicholson
Succinct Posets. Algorithmica 76 (2) (2016)
Ayelet Butman, Noa Lewenstein, J. Ian Munro
Permuted scaled matching. Theor. Comput. Sci. 638 (2016)
Meng He, J. Ian Munro, Gelin Zhou
Data Structures for Path Queries. ACM Trans. Algorithms 12 (4) (2016)
J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter
Fast construction of wavelet trees. Theor. Comput. Sci. 638 (2016)
Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
Range Majorities and Minorities in Arrays. CoRR (2016)
Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, Srinivasa Rao Satti
Sorting and Selection with Equality Comparisons. WADS (2015)
Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan
On hardness of several string indexing problems. Theor. Comput. Sci. 582 (2015)
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
Optimal Search Trees with 2-Way Comparisons. ISAAC (2015)
J. Ian Munro, Yakov Nekrich
Compressed Data Structures for Dynamic Sequences. ESA (2015)
J. Ian Munro, Yakov Nekrich
Compressed Data Structures for Dynamic Sequences. CoRR (2015)
J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter
Dynamic Data Structures for Document Collections and Graphs. CoRR (2015)
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
Optimal search trees with equality tests. CoRR (2015)
Hicham El-Zein, J. Ian Munro, Siwei Yang
On the Succinct Representation of Unlabeled Permutations. ISAAC (2015)
J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan
Range Counting with Distinct Constraints. CCCG (2015)
Timothy M. Chan, J. Ian Munro, Venkatesh Raman
Finding median in read-only memory on integer input. Theor. Comput. Sci. 583 (2015)
Stephane Durocher, Hicham El-Zein, J. Ian Munro, Sharma V. Thankachan
Low space data structures for geometric range mode query. Theor. Comput. Sci. 581 (2015)
J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter
Dynamic Data Structures for Document Collections and Graphs. PODS (2015)
J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter
Fast Construction of Wavelet Trees. SPIRE (2014)
J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan
Top- k Term-Proximity in Succinct Space. ISAAC (2014)
Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou
Succinct Indices for Path Minimum, with Applications to Path Reporting. ESA (2014)
Hicham El-Zein, J. Ian Munro, Venkatesh Raman
Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes. ISAAC (2014)
Arash Farzan, J. Ian Munro
A Uniform Paradigm to Succinctly Encode Various Families of Trees. Algorithmica 68 (1) (2014)
Meng He, J. Ian Munro
Space efficient data structures for dynamic orthogonal range counting. Comput. Geom. 47 (2) (2014)
Moshe Lewenstein, J. Ian Munro, Patrick K. Nicholson, Venkatesh Raman
Improved Explicit Data Structures in the Bitprobe Model. ESA (2014)
Timothy M. Chan, J. Ian Munro, Venkatesh Raman
Selection and Sorting in the "Restore" Model. SODA (2014)
Stephane Durocher, Hicham El-Zein, J. Ian Munro, Sharma V. Thankachan
Low Space Data Structures for Geometric Range Mode Query. CCCG (2014)
J. Ian Munro
In as Few Comparisons as Possible. WALCOM (2014)
Ayelet Butman, Noa Lewenstein, J. Ian Munro
Permuted Scaled Matching. CPM (2014)
Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan
Document Retrieval with One Wildcard. MFCS (2) (2014)
Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala
The Hausdorff Core Problem on Simple Polygons. J. Comput. Geom. 5 (1) (2014)
Shrinu Kushagra, Alejandro López-Ortiz, Aurick Qiao, J. Ian Munro
Multi-Pivot Quicksort: Theory and Experiments. ALENEX (2014)
Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan
Less space: Indexing for queries with wildcards. Theor. Comput. Sci. 557 (2014)
Meng He, J. Ian Munro, Gelin Zhou
Dynamic Path Counting and Reporting in Linear Space. ISAAC (2014)
Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan
On Hardness of Several String Indexing Problems. CPM (2014)
Meng He, J. Ian Munro, Gelin Zhou
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. Algorithmica 70 (4) (2014)
J. Ian Munro, Gonzalo Navarro, Rahul Shah, Sharma V. Thankachan
Ranked Document Selection. SWAT (2014)
Timothy M. Chan, J. Ian Munro, Venkatesh Raman
Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers. ISAAC (2013)
Francisco Claude, J. Ian Munro
Adaptive Data Structures for Permutations and Binary Relations. SPIRE (2013)

J. Ian Munro.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

J. Ian Munro