Ian Munro
University of Waterloo
H-index: 53
North America-Canada
Top articles of Ian Munro
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Enumeration and Succinct Encoding of AVL Trees | arXiv preprint arXiv:2311.15511 | Jeremy Chizewer Stephen Melczer J Ian Munro Ava Pun | 2023/11/27 |
A Compact Representation for AVL Trees | arXiv preprint arXiv:2311.15511 | Jeremy Chizewer Stephen Melczer J Ian Munro Ava Pun | 2023/11/27 |
Distance Queries over Dynamic Interval Graphs | Jingbang Chen Meng He J Ian Munro Richard Peng Kaiyu Wu | 2023 | |
On Huang and Wong’s algorithm for generalized binary split trees | Acta Informatica | Marek Chrobak Mordecai Golin J Ian Munro Neal E Young | 2022/12 |
Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries | Rathish Das Meng He Eitan Kondratovsky J Ian Munro Kaiyu Wu | 2022/11/1 | |
Shortest beer path queries in interval graphs | arXiv preprint arXiv:2209.14401 | Rathish Das Meng He Eitan Kondratovsky J Ian Munro Anurag Murty Naredla | 2022/9/28 |
Hypersuccinct Trees–New universal tree source codes for optimal compressed tree data structures | CoRR | J Ian Munro Patrick K Nicholson Louisa Seelbach Benkner Sebastian Wild | 2021/4/27 |
Hypersuccinct Trees--New universal tree source codes for optimal compressed tree data structures and range minima | arXiv preprint arXiv:2104.13457 | J Ian Munro Patrick K Nicholson Louisa Seelbach Benkner Sebastian Wild | 2021/4/27 |
Data Structures (Dagstuhl Seminar 98091) | Ian Munro Stefan Näher Peter Widmayer | 2021 | |
Dynamic Boolean Formula Evaluation | Rathish Das Andrea Lincoln Jayson Lynch J Ian Munro | 2021 | |
A simple algorithm for optimal search trees with two-way comparisons | ACM Transactions on Algorithms | Marek Chrobak Mordecai Golin J Ian Munro Neal E Young | 2022/1 |
On the cost of unsuccessful searches in search trees with two-way comparisons | Information and Computation | Marek Chrobak Mordecai Golin J Ian Munro Neal E Young | 2021/12 |
Breadth-first rank/select in succinct trees and distance oracles for interval graphs | arXiv preprint arXiv:2005.07644 | Meng He J Ian Munro Yakov Nekrich Sebastian Wild Kaiyu Wu | 2020/5 |
Fast compressed self-indexes with deterministic linear-time construction | Algorithmica | J Ian Munro Gonzalo Navarro Yakov Nekrich | 2020/2 |
Text Indexing and Searching in Sublinear Time | arXiv preprint arXiv:1712.07431 | J Ian Munro Gonzalo Navarro Yakov Nekrich | 2017/12/20 |
Ranked Document Selection. | Theoretical Computer Science | J Ian Munro Gonzalo Navarro Rahul Shah Sharma V Thankachan | 2020/4/6 |
31st International Symposium on Algorithms and Computation (ISAAC 2020) | Sang-il Oum Ke Yi Louis Dublois Tesshu Hanaka Mehdi Khosravian Ghadikolaei | 2020 | |
Distance oracles for interval graphs via breadth-first rank/select in succinct trees | arXiv preprint arXiv:2005.07644 | Meng He J Ian Munro Yakov Nekrich Sebastian Wild Kaiyu Wu | 2020/5/15 |
Co-Authors
