J. Ian Munro - RankMe

305 papers A* 48A 23B 51C 10Misc 1Journal 140Unranked 27

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Succinct encodings of binary trees with application to AVL trees. Theor. Comput. Sci. Jeremy Chizewer, Stephen Melczer, J. Ian Munro, Ava Pun
2024	J	`jnl`	Distance queries over dynamic interval graphs. Comput. Geom. Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang
2024	C	`conf`	Enumeration and Succinct Encoding of AVL Trees. AofA Jeremy Chizewer, Stephen Melczer, J. Ian Munro, Ava Pun
2024	B	`conf`	Succinct Data Structures for Bounded Degree/Chromatic Number Interval Graphs. DCC Meng He, J. Ian Munro, Kaiyu Wu
2024	B	`conf`	Succinct Data Structures for Path Graphs and Chordal Graphs Revisited. DCC Meng He, J. Ian Munro, Kaiyu Wu
2023	J	`jnl`	A Compact Representation for AVL Trees. CoRR Jeremy Chizewer, Stephen Melczer, J. Ian Munro, Ava Pun
2023	B	`conf`	Distance Queries over Dynamic Interval Graphs. ISAAC Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang
2022	J	`jnl`	A Simple Algorithm for Optimal Search Trees with Two-way Comparisons. ACM Trans. Algorithms Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2022	C	`conf`	Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries. SPIRE Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Kaiyu Wu
2022	J	`jnl`	On Huang and Wong's algorithm for generalized binary split trees. Acta Informatica Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2022	B	`conf`	Shortest Beer Path Queries in Interval Graphs. ISAAC Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu
2022	J	`jnl`	Shortest Beer Path Queries in Interval Graphs. CoRR Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu
2021	J	`jnl`	A Simple Algorithm for Optimal Search Trees with Two-Way Comparisons. CoRR Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2021	B	`conf`	Dynamic Boolean Formula Evaluation. ISAAC Rathish Das, Andrea Lincoln, Jayson Lynch, J. Ian Munro
2021	A	`conf`	Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima. ESA J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, Sebastian Wild
2021	J	`jnl`	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	J	`jnl`	On the Cost of Unsuccessful Searches in Search Trees with Two-way Comparisons. CoRR Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2021	J	`jnl`	On the cost of unsuccessful searches in search trees with two-way comparisons. Inf. Comput. Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2021	J	`jnl`	Range Majorities and Minorities in Arrays. Algorithmica Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2020	J	`jnl`	Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs. CoRR Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu
2020	B	`conf`	Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. ISAAC Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu
2020	J	`jnl`	Fast Compressed Self-indexes with Deterministic Linear-Time Construction. Algorithmica J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2020	J	`jnl`	Faster algorithms for some optimization problems on collinear points. J. Comput. Geom. Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
2020	J	`jnl`	Ranked document selection. Theor. Comput. Sci. J. Ian Munro, Gonzalo Navarro, Rahul Shah, Sharma V. Thankachan
2020	A*	`conf`	Space Efficient Construction of Lyndon Arrays in Linear Time. ICALP Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, J. Ian Munro, Eva Rotenberg
2020	—	`conf`	Space-Efficient Data Structures for Lattices. SWAT J. Ian Munro, Bryce Sandlund, Corwin Sinnamon
2020	B	`conf`	Text Indexing and Searching in Sublinear Time. CPM J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2019	A	`conf`	Categorical Range Reporting with Frequencies. ICDT Arnab Ganguly, J. Ian Munro, Yakov Nekrich, Rahul Shah, Sharma V. Thankachan
2019	J	`jnl`	Dynamic Optimality Refuted - For Tournament Heaps. CoRR J. Ian Munro, Richard Peng, Sebastian Wild, Lingyi Zhang
2019	A*	`conf`	Dynamic Planar Point Location in External Memory. SoCG J. Ian Munro, Yakov Nekrich
2019	J	`jnl`	Dynamic Planar Point Location in External Memory. CoRR J. Ian Munro, Yakov Nekrich
2019	J	`jnl`	Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space. CoRR J. Ian Munro, Sebastian Wild
2019	B	`conf`	On Approximate Range Mode and Range Selection. ISAAC Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund
2019	J	`jnl`	On Approximate Range Mode and Range Selection. CoRR Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund
2019	J	`jnl`	On Huang and Wong's Algorithm for Generalized Binary Split Trees. CoRR Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2019	—	`ed.`	Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019, San Diego, CA, USA, January 6, 2019. ANALCO Marni Mishna, J. Ian Munro
2019	J	`jnl`	Space-Efficient Data Structures for Lattices. CoRR J. Ian Munro, Bryce Sandlund, Corwin Sinnamon
2018	J	`jnl`	Dynamic Path Queries in Linear Space. Algorithmica Meng He, J. Ian Munro, Gelin Zhou
2018	A	`conf`	Dynamic Trees with Almost-Optimal Access Cost. ESA Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich
2018	J	`jnl`	Dynamic Trees with Almost-Optimal Access Cost. CoRR Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich
2018	A*	`conf`	Faster Algorithms for some Optimization Problems on Collinear Points. SoCG Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
2018	J	`jnl`	Faster Algorithms for some Optimization Problems on Collinear Points. CoRR Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
2018	A	`conf`	Improved Time and Space Bounds for Dynamic Range Mode. ESA Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund
2018	J	`jnl`	Improved Time and Space Bounds for Dynamic Range Mode. CoRR Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund
2018	A	`conf`	Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. ESA J. Ian Munro, Sebastian Wild
2018	J	`jnl`	Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. CoRR J. Ian Munro, Sebastian Wild
2018	J	`jnl`	Selection and Sorting in the "Restore" Model. ACM Trans. Algorithms Timothy M. Chan, J. Ian Munro, Venkatesh Raman
2018	B	`conf`	Succinct Data Structures for Chordal Graphs. ISAAC J. Ian Munro, Kaiyu Wu
2018	—	`conf`	Succinct Dynamic One-Dimensional Point Reporting. SWAT Hicham El-Zein, J. Ian Munro, Yakov Nekrich
2018	A*	`conf`	Time and Space Efficient Representations of Distributive Lattices. SODA J. Ian Munro, Corwin Sinnamon
2017	B	`conf`	Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. ISAAC J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2017	J	`jnl`	Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. CoRR J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2017	J	`jnl`	Finding modes with equality comparisons. Theor. Comput. Sci. Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
2017	J	`jnl`	On the Succinct Representation of Equivalence Classes. Algorithmica Hicham El-Zein, Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Timothy M. Chan
2017	A*	`conf`	Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. SODA J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2017	B	`conf`	Succinct Color Searching in One Dimension. ISAAC Hicham El-Zein, J. Ian Munro, Yakov Nekrich
2017	J	`jnl`	Succinct Indices for Path Minimum, with Applications. Algorithmica Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou
2017	J	`jnl`	Text Indexing and Searching in Sublinear Time. CoRR J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2017	J	`jnl`	Top-k Term-Proximity in Succinct Space. Algorithmica J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan
2016	—	`ch.`	Compressed Representations of Graphs. Encyclopedia of Algorithms J. Ian Munro, Patrick K. Nicholson
2016	J	`jnl`	Data Structures for Path Queries. ACM Trans. Algorithms Meng He, J. Ian Munro, Gelin Zhou
2016	J	`jnl`	Document retrieval with one wildcard. Theor. Comput. Sci. Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan
2016	J	`jnl`	Dynamic range majority data structures. Theor. Comput. Sci. Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson
2016	J	`jnl`	Fast construction of wavelet trees. Theor. Comput. Sci. J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter
2016	J	`jnl`	Permuted scaled matching. Theor. Comput. Sci. Ayelet Butman, Noa Lewenstein, J. Ian Munro
2016	B	`conf`	Raising Permutations to Powers in Place. ISAAC Hicham El-Zein, J. Ian Munro, Matthew Robertson
2016	J	`jnl`	Range Majorities and Minorities in Arrays. CoRR Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2016	J	`jnl`	Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. CoRR J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2016	B	`conf`	Succinct Data Structures ... Potential for Symbolic Computation? ISSAC J. Ian Munro
2016	J	`jnl`	Succinct Posets. Algorithmica J. Ian Munro, Patrick K. Nicholson
2015	A	`conf`	Compressed Data Structures for Dynamic Sequences. ESA J. Ian Munro, Yakov Nekrich
2015	J	`jnl`	Compressed Data Structures for Dynamic Sequences. CoRR J. Ian Munro, Yakov Nekrich
2015	A*	`conf`	Dynamic Data Structures for Document Collections and Graphs. PODS J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter
2015	J	`jnl`	Dynamic Data Structures for Document Collections and Graphs. CoRR J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter
2015	J	`jnl`	Finding median in read-only memory on integer input. Theor. Comput. Sci. Timothy M. Chan, J. Ian Munro, Venkatesh Raman
2015	J	`jnl`	Low space data structures for geometric range mode query. Theor. Comput. Sci. Stephane Durocher, Hicham El-Zein, J. Ian Munro, Sharma V. Thankachan
2015	J	`jnl`	On hardness of several string indexing problems. Theor. Comput. Sci. Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan
2015	B	`conf`	On the Succinct Representation of Unlabeled Permutations. ISAAC Hicham El-Zein, J. Ian Munro, Siwei Yang
2015	B	`conf`	Optimal Search Trees with 2-Way Comparisons. ISAAC Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2015	J	`jnl`	Optimal search trees with equality tests. CoRR Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2015	—	`conf`	Range Counting with Distinct Constraints. CCCG J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan
2015	B	`conf`	Sorting and Selection with Equality Comparisons. WADS Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, Srinivasa Rao Satti
2014	J	`jnl`	A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. Algorithmica Meng He, J. Ian Munro, Gelin Zhou
2014	J	`jnl`	A Uniform Paradigm to Succinctly Encode Various Families of Trees. Algorithmica Arash Farzan, J. Ian Munro
2014	—	`conf`	Document Retrieval with One Wildcard. MFCS (2) Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan
2014	B	`conf`	Dynamic Path Counting and Reporting in Linear Space. ISAAC Meng He, J. Ian Munro, Gelin Zhou
2014	C	`conf`	Fast Construction of Wavelet Trees. SPIRE J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter
2014	A	`conf`	Improved Explicit Data Structures in the Bitprobe Model. ESA Moshe Lewenstein, J. Ian Munro, Patrick K. Nicholson, Venkatesh Raman
2014	B	`conf`	In as Few Comparisons as Possible. WALCOM J. Ian Munro
2014	J	`jnl`	Less space: Indexing for queries with wildcards. Theor. Comput. Sci. Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan
2014	—	`conf`	Low Space Data Structures for Geometric Range Mode Query. CCCG Stephane Durocher, Hicham El-Zein, J. Ian Munro, Sharma V. Thankachan
2014	A	`conf`	Multi-Pivot Quicksort: Theory and Experiments. ALENEX Shrinu Kushagra, Alejandro López-Ortiz, Aurick Qiao, J. Ian Munro
2014	B	`conf`	On Hardness of Several String Indexing Problems. CPM Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan
2014	B	`conf`	Permuted Scaled Matching. CPM Ayelet Butman, Noa Lewenstein, J. Ian Munro
2014	—	`conf`	Ranked Document Selection. SWAT J. Ian Munro, Gonzalo Navarro, Rahul Shah, Sharma V. Thankachan
2014	A*	`conf`	Selection and Sorting in the "Restore" Model. SODA Timothy M. Chan, J. Ian Munro, Venkatesh Raman
2014	J	`jnl`	Space efficient data structures for dynamic orthogonal range counting. Comput. Geom. Meng He, J. Ian Munro
2014	A	`conf`	Succinct Indices for Path Minimum, with Applications to Path Reporting. ESA Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou
2014	J	`jnl`	The Hausdorff Core Problem on Simple Polygons. J. Comput. Geom. Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala
2014	B	`conf`	Top- k Term-Proximity in Succinct Space. ISAAC J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan
2014	B	`conf`	Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes. ISAAC Hicham El-Zein, J. Ian Munro, Venkatesh Raman
2013	J	`jnl`	A novel approach for leveraging co-occurrence to improve the false positive error in signature files. J. Discrete Algorithms Pedram Ghodsnia, Kamran Tirdad, J. Ian Munro, Alejandro López-Ortiz
2013	C	`conf`	Adaptive Data Structures for Permutations and Binary Relations. SPIRE Francisco Claude, J. Ian Munro
2013	C	`conf`	Document Listing on Versioned Documents. SPIRE Francisco Claude, J. Ian Munro
2013	B	`conf`	Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers. ISAAC Timothy M. Chan, J. Ian Munro, Venkatesh Raman
2013	B	`conf`	Less Space: Indexing for Queries with Wildcards. ISAAC Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan
2013	J	`jnl`	Range majority in constant time and linear space. Inf. Comput. Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala
2013	J	`jnl`	Sorting under partial information (without the ellipsoid algorithm). Comb. Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro
2013	B	`conf`	Succinct Data Structures for Representing Equivalence Classes. ISAAC Moshe Lewenstein, J. Ian Munro, Venkatesh Raman
2013	J	`jnl`	Succinct data structures for representing equivalence classes. CoRR Moshe Lewenstein, J. Ian Munro, Venkatesh Raman
2013	J	`jnl`	Succinct encoding of arbitrary graphs. Theor. Comput. Sci. Arash Farzan, J. Ian Munro
2013	B	`conf`	The Distance 4-Sector of Two Points Is Unique. ISAAC Robert Fraser, Meng He, Akitoshi Kawamura, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson
2012	B	`conf`	A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. ISAAC Meng He, J. Ian Munro, Gelin Zhou
2012	A	`conf`	Succinct Data Structures for Path Queries. ESA Meng He, J. Ian Munro, Gelin Zhou
2012	—	`conf`	Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima. ICALP (1) Arash Farzan, J. Ian Munro, Rajeev Raman
2012	J	`jnl`	Succinct Indices for Range Queries with applications to Orthogonal Range Maxima CoRR Arash Farzan, J. Ian Munro, Rajeev Raman
2012	J	`jnl`	Succinct Posets CoRR J. Ian Munro, Patrick K. Nicholson
2012	A	`conf`	Succinct Posets. ESA J. Ian Munro, Patrick K. Nicholson
2012	J	`jnl`	Succinct Representation of Labeled Graphs. Algorithmica Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro
2012	J	`jnl`	Succinct ordinal trees based on tree covering. ACM Trans. Algorithms Meng He, J. Ian Munro, Srinivasa Rao Satti
2012	J	`jnl`	Succinct representations of permutations and functions. Theor. Comput. Sci. J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
2012	A	`conf`	The Complexity of Partial Orders. ALENEX J. Ian Munro
2012	—	`conf`	The Complexity of Partial Orders. ANALCO J. Ian Munro
2011	C	`conf`	COCA Filters: Co-occurrence Aware Bloom Filters. SPIRE Kamran Tirdad, Pedram Ghodsnia, J. Ian Munro, Alejandro López-Ortiz
2011	J	`jnl`	Dynamic Range Majority Data Structures CoRR Meng He, J. Ian Munro, Patrick K. Nicholson
2011	B	`conf`	Dynamic Range Majority Data Structures. ISAAC Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson
2011	J	`jnl`	Dynamic Range Selection in Linear Space CoRR Meng He, J. Ian Munro, Patrick K. Nicholson
2011	B	`conf`	Dynamic Range Selection in Linear Space. ISAAC Meng He, J. Ian Munro, Patrick K. Nicholson
2011	C	`conf`	Finding Frequent Elements in Compressed 2D Arrays and Strings. SPIRE Travis Gagie, Meng He, J. Ian Munro, Patrick K. Nicholson
2011	B	`conf`	Path Queries in Weighted Trees. ISAAC Meng He, J. Ian Munro, Gelin Zhou
2011	—	`conf`	Range Majority in Constant Time and Linear Space. ICALP (1) Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala
2011	B	`conf`	Space Efficient Data Structures for Dynamic Orthogonal Range Counting. WADS Meng He, J. Ian Munro
2011	J	`jnl`	Succinct Representations of Permutations and Functions CoRR J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
2011	J	`jnl`	Succinct indexes for strings, binary relations and multilabeled trees. ACM Trans. Algorithms Jérémy Barbay, Meng He, J. Ian Munro, Srinivasa Rao Satti
2011	J	`jnl`	Succinct representation of dynamic trees. Theor. Comput. Sci. Arash Farzan, J. Ian Munro
2011	J	`jnl`	Untangled monotonic chains and adaptive range search. Theor. Comput. Sci. Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala
2010	J	`jnl`	An Efficient Algorithm for Partial Order Production. SIAM J. Comput. Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro
2010	A*	`conf`	Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. SODA Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro
2010	J	`jnl`	Integer Representation and Counting in the Bit Probe Model. Algorithmica M. Ziaur Rahman, J. Ian Munro
2010	C	`conf`	Range Queries over Untangled Chains. SPIRE Francisco Claude, J. Ian Munro, Patrick K. Nicholson
2010	J	`jnl`	Range Reporting for Moving Points on a Grid CoRR Marek Karpinski, J. Ian Munro, Yakov Nekrich
2010	A*	`conf`	Sorting under partial information (without the ellipsoid algorithm). STOC Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro
2010	J	`jnl`	Sorting with networks of data structures. Discret. Appl. Math. Therese Biedl, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, J. Ian Munro
2010	J	`jnl`	Succinct Representations of Dynamic Strings CoRR Meng He, J. Ian Munro
2010	C	`conf`	Succinct Representations of Dynamic Strings. SPIRE Meng He, J. Ian Munro
2009	B	`conf`	An Application of Self-organizing Data Structures to Compression. SEA Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro
2009	A*	`conf`	An efficient algorithm for partial order production. STOC Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro
2009	—	`conf`	Dynamic Succinct Ordered Trees. ICALP (1) Arash Farzan, J. Ian Munro
2009	B	`conf`	Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance. WADS Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala
2009	J	`jnl`	On the relative dominance of paging algorithms. Theor. Comput. Sci. Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro
2009	J	`jnl`	Preface. ACM J. Exp. Algorithmics J. Ian Munro, Dorothea Wagner
2009	—	`conf`	Reflections on Optimal and Nearly Optimal Binary Search Trees. Efficient Algorithms J. Ian Munro
2009	J	`jnl`	Sorting under Partial Information (without the Ellipsoid Algorithm) CoRR Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro
2009	B	`conf`	Untangled Monotonic Chains and Adaptive Range Search. ISAAC Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala
2008	—	`conf`	A Uniform Approach Towards Succinct Representation of Trees. SWAT Arash Farzan, J. Ian Munro
2008	J	`jnl`	An Efficient Algorithm for Partial Order Production CoRR Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro
2008	B	`conf`	List Update Algorithms for Data Compression. DCC Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro
2008	B	`conf`	Lower Bounds for Succinct Data Structures. CPM J. Ian Munro
2008	A	`ed.`	Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, ALENEX 2008, San Francisco, California, USA, January 19, 2008 ALENEX J. Ian Munro, Dorothea Wagner
2008	—	`ch.`	Succinct Encoding of Permutations: Applications to Text Indexing. Encyclopedia of Algorithms Jérémy Barbay, J. Ian Munro
2008	A	`conf`	Succinct Representations of Arbitrary Graphs. ESA Arash Farzan, J. Ian Munro
2007	J	`jnl`	Adaptive searching in succinctly encoded binary relations and tree-structured documents. Theor. Comput. Sci. Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
2007	J	`jnl`	An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms. SIAM J. Comput. Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro
2007	B	`conf`	Integer Representation and Counting in the Bit Probe Model. ISAAC M. Ziaur Rahman, J. Ian Munro
2007	B	`conf`	On the Relative Dominance of Paging Algorithms. ISAAC Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro
2007	A*	`conf`	Succinct Ordinal Trees Based on Tree Covering. ICALP Meng He, J. Ian Munro, S. Srinivasa Rao
2007	B	`conf`	Succinct Representation of Labeled Graphs. ISAAC Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro
2007	A*	`conf`	Succinct indexes for strings, binary relations and multi-labeled trees. SODA Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao
2006	B	`conf`	Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents. CPM Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
2006	J	`jnl`	An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture CoRR Andrej Brodnik, Johan Karlsson, J. Ian Munro, Andreas Nilsson
2006	—	`conf`	An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture. IFIP TCS Andrej Brodnik, Johan Karlsson, J. Ian Munro, Andreas Nilsson
2006	J	`jnl`	Foreword. ACM Trans. Algorithms Alejandro López-Ortiz, J. Ian Munro
2006	A*	`conf`	Implicit dictionaries with SODA Gianni Franceschini, J. Ian Munro
2006	J	`jnl`	Preface. Theor. Comput. Sci. Kyung-Yong Chwa, J. Ian Munro
2006	A*	`conf`	Rank/select operations on large alphabets: a tool for text indexing. SODA Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
2006	J	`jnl`	Structure, Scoring and Purpose of Computing Competitions. Informatics Educ. Gordon V. Cormack, J. Ian Munro, Troy Vasiga, Graeme Kemkes
2006	B	`conf`	Succinct representation of finite abelian groups. ISSAC Arash Farzan, J. Ian Munro
2006	J	`jnl`	The binomial transform and the analysis of skip lists. Theor. Comput. Sci. Patricio V. Poblete, J. Ian Munro, Thomas Papadakis
2005	A*	`conf`	A categorization theorem on suffix arrays with applications to space efficient text indexes. SODA Meng He, J. Ian Munro, S. Srinivasa Rao
2005	A	`conf`	Cache-Oblivious Comparison-Based Algorithms on Multisets. ESA Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro
2005	J	`jnl`	Fast allocation and deallocation with an improved buddy system. Acta Informatica Gerth Stølting Brodal, Erik D. Demaine, J. Ian Munro
2005	J	`jnl`	Representing Trees of Higher Degree. Algorithmica David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
2005	A*	`conf`	Towards Optimal Multiple Selection. ICALP Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders
2005	J	`jnl`	Worst case constant time priority queue. J. Syst. Softw. Andrej Brodnik, Svante Carlsson, Michael L. Fredman, Johan Karlsson, J. Ian Munro
2004	Misc	`ed.`	Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings COCOON Kyung-Yong Chwa, J. Ian Munro
2004	J	`jnl`	Deterministic SkipNet. Inf. Process. Lett. Nicholas J. A. Harvey, J. Ian Munro
2004	J	`jnl`	Fun-Sort--or the chaos of unordered binary search. Discret. Appl. Math. Therese Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro
2004	J	`jnl`	Implicit J. Comput. Syst. Sci. Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli
2004	A*	`ed.`	Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004 SODA J. Ian Munro
2004	—	`conf`	Succinct Data Structures. CATS J. Ian Munro
2004	—	`ch.`	Succinct Representation of Data Structures. Handbook of Data Structures and Applications J. Ian Munro, S. Srinivasa Rao
2004	A*	`conf`	Succinct Representations of Functions. ICALP J. Ian Munro, S. Srinivasa Rao
2003	A*	`conf`	Brief announcement: deterministic skipnet. PODC Nicholas J. A. Harvey, J. Ian Munro
2003	C	`conf`	Efficient Generation of Uniform Samples from Phylogenetic Trees. WABI Paul E. Kearney, J. Ian Munro, Derek Phillips
2003	A	`conf`	Identifying frequent items in sliding windows over on-line packet streams. Internet Measurement Conference Lukasz Golab, David DeHaan, Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
2003	J	`jnl`	On universally easy classes for NP-complete problems. Theor. Comput. Sci. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
2003	A*	`conf`	Succinct Representations of Permutations. ICALP J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
2002	A*	`conf`	Cache-oblivious priority queue and graph algorithm applications. STOC Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro
2002	J	`jnl`	Efficient Tree Layout in a Multilevel Memory Hierarchy CoRR Stephen Alstrup, Michael A. Bender, Erik D. Demaine, Martin Farach-Colton, J. Ian Munro, Theis Rauhe, Mikkel Thorup
2002	J	`jnl`	Efficient visibility queries in simple polygons. Comput. Geom. Prosenjit Bose, Anna Lubiw, J. Ian Munro
2002	A	`conf`	Frequency Estimation of Internet Packet Streams with Limited Space. ESA Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
2002	A*	`conf`	Implicit B-Trees: New Results for the Dictionary Problem. FOCS Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli
2002	J	`jnl`	Online Routing in Convex Subdivisions. Int. J. Comput. Geom. Appl. Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro
2002	—	`conf`	Robot Localization without Depth Perception. SWAT Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
2001	A	`conf`	Experiments on Adaptive Set Intersections for Text Retrieval Systems. ALENEX Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
2001	A*	`conf`	On universally easy classes for NP-complete problems. SODA Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
2001	A*	`conf`	Representing dynamic binary trees succinctly. SODA J. Ian Munro, Venkatesh Raman, Adam J. Storm
2001	J	`jnl`	Space Efficient Suffix Trees. J. Algorithms J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
2001	J	`jnl`	Succinct Representation of Balanced Parentheses and Static Trees. SIAM J. Comput. J. Ian Munro, Venkatesh Raman
2001	J	`jnl`	The Complexity of Clickomania CoRR Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro
2001	A*	`conf`	Worst case constant time priority queue. SODA Andrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro
2000	A*	`conf`	Adaptive set intersections, unions, and differences. SODA Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
2000	A	`conf`	On the Competitiveness of Linear Search. ESA J. Ian Munro
2000	B	`conf`	Online Routing in Convex Subdivisions. ISAAC Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz
1999	—	`conf`	Fast Allocation and Deallocation with an Improved Buddy System. FSTTCS Erik D. Demaine, J. Ian Munro
1999	J	`jnl`	Membership in Constant Time and Almost-Minimum Space. SIAM J. Comput. Andrej Brodnik, J. Ian Munro
1999	B	`conf`	Representing Trees of Higer Degree. WADS David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman
1999	B	`conf`	Resizable Arrays in Optimal Time and Space. WADS Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick
1998	—	`conf`	Space Efficient Suffix Trees. FSTTCS J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
1997	A*	`conf`	Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs. FOCS J. Ian Munro, Venkatesh Raman
1997	J	`jnl`	The Diagonal Poisson Transform and its application to the analysis of a hashing scheme. Random Struct. Algorithms Patricio V. Poblete, Alfredo Viola, J. Ian Munro
1997	B	`conf`	Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds. WADS Andrej Brodnik, Peter Bro Miltersen, J. Ian Munro
1996	A*	`conf`	Efficient Suffix Trees on Secondary Storage (extended Abstract). SODA David R. Clark, J. Ian Munro
1996	J	`jnl`	Fast Stable In-Place Sorting with Algorithmica J. Ian Munro, Venkatesh Raman
1996	—	`conf`	Neighbours on a Grid. SWAT Andrej Brodnik, J. Ian Munro
1996	J	`jnl`	Selection from Read-Only Memory and Sorting with Minimum Data Movement. Theor. Comput. Sci. J. Ian Munro, Venkatesh Raman
1996	—	`conf`	Tables. FSTTCS J. Ian Munro
1995	J	`jnl`	Permuting in Place. SIAM J. Comput. Faith E. Fich, J. Ian Munro, Patricio V. Poblete
1995	A	`conf`	The Binomial Transform and its Application to the Analysis of Skip Lists. ESA Patricio V. Poblete, J. Ian Munro, Thomas Papadakis
1994	A	`conf`	Membership in Constant Time and Minimum Space. ESA Andrej Brodnik, J. Ian Munro
1994	A	`conf`	The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract). ESA Patricio V. Poblete, Alfredo Viola, J. Ian Munro
1993	A*	`conf`	Maintaining Discrete Probability Distributions Optimally. ICALP Torben Hagerup, Kurt Mehlhorn, J. Ian Munro
1992	J	`jnl`	Average Search and Update Costs in Skip Lists. BIT Thomas Papadakis, J. Ian Munro, Patricio V. Poblete
1992	A*	`conf`	Deterministic Skip Lists. SODA J. Ian Munro, Thomas Papadakis, Robert Sedgewick
1992	J	`jnl`	Selecting the Median and Two Quartiles in a Set of Numbers. Softw. Pract. Exp. Walter Cunto, J. Ian Munro, Manuel Rey
1992	—	`conf`	Selection from Read-Only Memory and Sorting with Optimum Data Movement. FSTTCS J. Ian Munro, Venkatesh Raman
1992	J	`jnl`	Sorting with Minimum Data Movement. J. Algorithms J. Ian Munro, Venkatesh Raman
1991	B	`conf`	A Case Study in Comparison Based Complexity: Finding the Nearest Value(s). WADS Walter Cunto, J. Ian Munro, Patricio V. Poblete
1991	J	`jnl`	An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time. J. Comput. Syst. Sci. Amos Fiat, J. Ian Munro, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel
1991	—	`conf`	Fast Sorting In-Place Sorting with O(n) Data. FSTTCS J. Ian Munro, Venkatesh Raman
1991	J	`jnl`	Fringe Analysis for Extquick: An in Situ Distributive External Sorting Algorithm Inf. Comput. Walter Cunto, Gaston H. Gonnet, J. Ian Munro, Patricio V. Poblete
1991	B	`conf`	Sorting Multisets and Vectors In-Place. WADS J. Ian Munro, Venkatesh Raman
1990	—	`conf`	Analysis of the Expected Search Cost in Skip Lists. SWAT Thomas Papadakis, J. Ian Munro, Patricio V. Poblete
1990	J	`jnl`	Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees. Algorithmica Joseph C. Culberson, J. Ian Munro
1990	J	`jnl`	Deterministic Optimal and Expedient Move-to-Rear List Organizing Strategies. Theor. Comput. Sci. B. John Oommen, E. R. Hansen, J. Ian Munro
1990	A*	`conf`	Permuting FOCS Faith E. Fich, J. Ian Munro, Patricio V. Poblete
1990	J	`jnl`	Stable in Situ Sorting and Minimum Data Movement. BIT J. Ian Munro, Venkatesh Raman, Jeffrey S. Salowe
1989	J	`jnl`	Average case selection. J. ACM Walter Cunto, J. Ian Munro
1989	J	`jnl`	Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations. Comput. J. Joseph C. Culberson, J. Ian Munro
1989	J	`jnl`	Last-Come-First-Served Hashing. J. Algorithms Patricio V. Poblete, J. Ian Munro
1989	B	`conf`	Sorting with Minimum Data Movement (Preliminary Draft). WADS J. Ian Munro, Venkatesh Raman
1988	—	`conf`	An Implicit Binomial Queue with Constant Insertion Time. SWAT Svante Carlsson, J. Ian Munro, Patricio V. Poblete
1987	J	`jnl`	Searchability in Merging and Implicit Data Structures. BIT J. Ian Munro, Patricio V. Poblete
1987	A*	`conf`	Searching a Two Key Table Under a Single Key STOC J. Ian Munro
1987	—	`conf`	Variations on Visibility. SCG J. Ian Munro, Mark H. Overmars, Derick Wood
1986	J	`jnl`	An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log² n) Time. J. Comput. Syst. Sci. J. Ian Munro
1986	B	`conf`	Developing Implicit Data Structures. MFCS J. Ian Munro
1986	J	`jnl`	Heaps on Heaps. SIAM J. Comput. Gaston H. Gonnet, J. Ian Munro
1986	—	`conf`	Techniques for Collision Resolution in Hash Tables with Open Addressing. FJCC J. Ian Munro, Pedro Celis
1985	J	`jnl`	Efficient Uses of the Past. J. Algorithms David P. Dobkin, J. Ian Munro
1985	A	`conf`	Proximity of a Grid. STACS Rolf G. Karlsson, J. Ian Munro
1985	A*	`conf`	Robin Hood Hashing (Preliminary Report) FOCS Pedro Celis, Per-Åke Larson, J. Ian Munro
1985	J	`jnl`	The Analysis of a Fringe Heuristic for Binary Search Trees. J. Algorithms Patricio V. Poblete, J. Ian Munro
1985	A*	`conf`	The Nearest Neighbor Problem on Bounded Domains. ICALP Rolf G. Karlsson, J. Ian Munro, Edward L. Robertson
1984	A*	`conf`	An Implicit Data Structure for the Dictionary Problem that Runs in Polylog Time FOCS J. Ian Munro
1984	A*	`conf`	Average Case Selection STOC Walter Cunto, J. Ian Munro
1984	J	`jnl`	Fault Tolerance and Storage Reduction in Binary Search Trees Inf. Control. J. Ian Munro, Patricio V. Poblete
1984	J	`jnl`	Partial Match Retrieval in Implicit Data Structures. Inf. Process. Lett. Helmut Alt, Kurt Mehlhorn, J. Ian Munro
1984	J	`jnl`	The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform. J. Algorithms Gaston H. Gonnet, J. Ian Munro
1983	A*	`conf`	A Discipline for Robustness or Storage Reduction in Binary Search Trees. PODS J. Ian Munro, Patricio V. Poblete
1983	J	`jnl`	Direct dynamic structures for some line segment problems. Comput. Vis. Graph. Image Process. Gaston H. Gonnet, J. Ian Munro, Derick Wood
1983	A*	`conf`	Searchability in Merging and Implicit Data Structures. ICALP J. Ian Munro, Patricio V. Poblete
1982	J	`jnl`	Database Storage Structures Research at the University of Waterloo. IEEE Database Eng. Bull. Gaston H. Gonnet, Per-Åke Larson, J. Ian Munro, Doron Rotem, David J. Taylor, Frank Wm. Tompa
1982	A*	`conf`	Heaps on Heaps. ICALP Gaston H. Gonnet, J. Ian Munro
1982	J	`jnl`	Optimum Reorganization Points for Arbitrary Database Costs. Acta Informatica Raúl J. Ramírez, Frank Wm. Tompa, J. Ian Munro
1982	J	`jnl`	Technical Note - Reducing Space Requirements for Shortest Path Problems. Oper. Res. J. Ian Munro, Raúl J. Ramírez
1981	A*	`conf`	A Linear Probing Sort and its Analysis (Preliminary Draft) STOC Gaston H. Gonnet, J. Ian Munro
1981	J	`jnl`	Continual Pattern Replication Inf. Control. J. Ian Munro, Edward L. Robertson
1981	J	`jnl`	Exegesis of Self-Organizing Linear Search. SIAM J. Comput. Gaston H. Gonnet, J. Ian Munro, Hendra Suwanda
1981	J	`jnl`	Optimal Time Minimal Space Selection Algorithms. J. ACM David P. Dobkin, J. Ian Munro
1981	B	`conf`	Partial Match Retrieval in Implicit Data Structures. MFCS Helmut Alt, Kurt Mehlhorn, J. Ian Munro
1980	J	`jnl`	Determining the Mode. Theor. Comput. Sci. David P. Dobkin, J. Ian Munro
1980	A*	`conf`	Efficient Uses of the Past FOCS David P. Dobkin, J. Ian Munro
1980	J	`jnl`	Implicit Data Structures for Fast Search and Update. J. Comput. Syst. Sci. J. Ian Munro, Hendra Suwanda
1980	J	`jnl`	Selection and Sorting with Limited Storage. Theor. Comput. Sci. J. Ian Munro, Mike Paterson
1979	J	`jnl`	Efficient Ordering of Hash Tables. SIAM J. Comput. Gaston H. Gonnet, J. Ian Munro
1979	A*	`conf`	Implicit Data Structures (Preliminary Draft) STOC J. Ian Munro, Hendra Suwanda
1979	A*	`conf`	Toward Self-Organizing Linear Search (Preliminary Draught) FOCS Gaston H. Gonnet, J. Ian Munro, Hendra Suwanda
1978	A*	`conf`	Selection and Sorting with Limited Storage FOCS J. Ian Munro, Mike Paterson
1978	J	`jnl`	Self-Organizing Binary Search Trees. J. ACM Brian Allen, J. Ian Munro
1978	A*	`conf`	Time and Space Bounds for Selection Problems. ICALP David P. Dobkin, J. Ian Munro
1977	J	`jnl`	Designing Overlay Structures. Softw. Pract. Exp. W. Morven Gentleman, J. Ian Munro
1977	A*	`conf`	The Analysis of an Improved Hashing Technique STOC Gaston H. Gonnet, J. Ian Munro
1977	B	`conf`	The Parallel Complexity of Arithmetic Computation. FCT J. Ian Munro
1976	A*	`conf`	Self-Organizing Binary Search Trees FOCS Brian Allen, J. Ian Munro
1976	J	`jnl`	Sorting and Searching in Multisets. SIAM J. Comput. J. Ian Munro, Philip M. Spira
1975	—	`book`	The computational complexity of algebraic and numeric problems. Allan Borodin, J. Ian Munro
1974	J	`jnl`	A O(\|V\|*\|E\|) algorithm for maximum matching of graphs. Computing Tiko Kameda, J. Ian Munro
1973	—	`conf`	In search of the fastest algorithm. AFIPS National Computer Conference J. Ian Munro
1973	J	`jnl`	Optimal Algorithms for Parallel Polynomial Evaluation. J. Comput. Syst. Sci. J. Ian Munro, Mike Paterson
1972	J	`jnl`	Efficient Evaluation of Polynomial Forms. J. Comput. Syst. Sci. J. Ian Munro, Allan Borodin
1971	J	`jnl`	Efficient Determination of the Transitive Closure of a Directed Graph. Inf. Process. Lett. J. Ian Munro
1971	J	`jnl`	Evaluating Polynomials at Many Points. Inf. Process. Lett. Allan Borodin, J. Ian Munro
1971	—	`conf`	Optimal Algorithms for Parallel Polynomial Evaluation SWAT J. Ian Munro, Mike Paterson
1971	A*	`conf`	Some Results Concerning Efficient and Optimal Algorithms STOC J. Ian Munro