default search action
J. Ian Munro
Ian Munro 0001
Person information
- affiliation: University of Waterloo, Cheriton School of Computer Science
Other persons with the same name
- Ian Munro 0002 — Mount Cook Airlines, Christchurch, New Zealand
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j105]Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu
, Daniel J. Zhang:
Distance queries over dynamic interval graphs. Comput. Geom. 122: 102103 (2024) - [c157]Jeremy Chizewer, Stephen Melczer, J. Ian Munro, Ava Pun:
Enumeration and Succinct Encoding of AVL Trees. AofA 2024: 2:1-2:12 - [c156]Meng He, J. Ian Munro, Kaiyu Wu:
Succinct Data Structures for Path Graphs and Chordal Graphs Revisited. DCC 2024: 492-501 - [c155]Meng He, J. Ian Munro, Kaiyu Wu:
Succinct Data Structures for Bounded Degree/Chromatic Number Interval Graphs. DCC 2024: 502-511 - 2023
- [c154]Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang:
Distance Queries over Dynamic Interval Graphs. ISAAC 2023: 18:1-18:19 - [i37]Jeremy Chizewer, Stephen Melczer, J. Ian Munro, Ava Pun:
A Compact Representation for AVL Trees. CoRR abs/2311.15511 (2023) - 2022
- [j104]Marek Chrobak, Mordecai J. Golin
On Huang and Wong's algorithm for generalized binary split trees. Acta Informatica 59(6): 687-708 (2022) - [j103]Marek Chrobak, Mordecai J. Golin
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons. ACM Trans. Algorithms 18(1): 2:1-2:11 (2022) - [c153]Rathish Das, Meng He
Shortest Beer Path Queries in Interval Graphs. ISAAC 2022: 59:1-59:17 - [c152]Rathish Das, Meng He
Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries. SPIRE 2022: 217-232 - [i36]Rathish Das, Meng He
Shortest Beer Path Queries in Interval Graphs. CoRR abs/2209.14401 (2022) - 2021
- [j102]Djamal Belazzougui, Travis Gagie
Range Majorities and Minorities in Arrays. Algorithmica 83(6): 1707-1733 (2021) - [j101]Marek Chrobak, Mordecai J. Golin
On the cost of unsuccessful searches in search trees with two-way comparisons. Inf. Comput. 281: 104707 (2021) - [c151]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: 70:1-70:18 - [c150]Rathish Das, Andrea Lincoln
Dynamic Boolean Formula Evaluation. ISAAC 2021: 61:1-61:19 - [i35]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 abs/2103.01052 (2021) - [i34]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
A Simple Algorithm for Optimal Search Trees with Two-Way Comparisons. CoRR abs/2103.01084 (2021) - [i33]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 abs/2104.13457 (2021) - 2020
- [j100]J. Ian Munro, Gonzalo Navarro
Fast Compressed Self-indexes with Deterministic Linear-Time Construction. Algorithmica 82(2): 316-337 (2020) - [j99]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): 418-432 (2020) - [j98]J. Ian Munro, Gonzalo Navarro, Rahul Shah, Sharma V. Thankachan:
Ranked document selection. Theor. Comput. Sci. 812: 149-159 (2020) - [c149]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
Text Indexing and Searching in Sublinear Time. CPM 2020: 24:1-24:15 - [c148]Philip Bille
Space Efficient Construction of Lyndon Arrays in Linear Time. ICALP 2020: 14:1-14:18 - [c147]Meng He
Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. ISAAC 2020: 25:1-25:18 - [c146]J. Ian Munro
Space-Efficient Data Structures for Lattices. SWAT 2020: 31:1-31:22 - [i32]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 abs/2005.07644 (2020)
2010 – 2019
- 2019
- [c145]J. Ian Munro, Yakov Nekrich
Dynamic Planar Point Location in External Memory. SoCG 2019: 52:1-52:15 - [c144]Arnab Ganguly, J. Ian Munro, Yakov Nekrich
Categorical Range Reporting with Frequencies. ICDT 2019: 9:1-9:19 - [c143]Hicham El-Zein, Meng He
On Approximate Range Mode and Range Selection. ISAAC 2019: 57:1-57:14 - [e4]Marni Mishna, J. Ian Munro:
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019, San Diego, CA, USA, January 6, 2019. SIAM 2019 [contents] - [i31]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
On Huang and Wong's Algorithm for Generalized Binary Split Trees. CoRR abs/1901.03783 (2019) - [i30]J. Ian Munro, Bryce Sandlund, Corwin Sinnamon:
Space-Efficient Data Structures for Lattices. CoRR abs/1902.05166 (2019) - [i29]J. Ian Munro, Sebastian Wild
Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space. CoRR abs/1903.02533 (2019) - [i28]J. Ian Munro, Yakov Nekrich:
Dynamic Planar Point Location in External Memory. CoRR abs/1903.06601 (2019) - [i27]Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund:
On Approximate Range Mode and Range Selection. CoRR abs/1907.08579 (2019) - [i26]J. Ian Munro, Richard Peng, Sebastian Wild, Lingyi Zhang:
Dynamic Optimality Refuted - For Tournament Heaps. CoRR abs/1908.00563 (2019) - [i25]Philip Bille, Jonas Ellert
Space Efficient Construction of Lyndon Arrays in Linear Time. CoRR abs/1911.03542 (2019) - 2018
- [j97]Meng He
Dynamic Path Queries in Linear Space. Algorithmica 80(12): 3728-3765 (2018) - [j96]Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Selection and Sorting in the "Restore" Model. ACM Trans. Algorithms 14(2): 11:1-11:18 (2018) - [c142]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: 8:1-8:14 - [c141]Hicham El-Zein, Meng He
Improved Time and Space Bounds for Dynamic Range Mode. ESA 2018: 25:1-25:13 - [c140]Mordecai J. Golin
Dynamic Trees with Almost-Optimal Access Cost. ESA 2018: 38:1-38:14 - [c139]J. Ian Munro, Sebastian Wild
Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. ESA 2018: 63:1-63:16 - [c138]J. Ian Munro, Kaiyu Wu:
Succinct Data Structures for Chordal Graphs. ISAAC 2018: 67:1-67:12 - [c137]J. Ian Munro, Corwin Sinnamon:
Time and Space Efficient Representations of Distributive Lattices. SODA 2018: 550-567 - [c136]Hicham El-Zein, J. Ian Munro, Yakov Nekrich
Succinct Dynamic One-Dimensional Point Reporting. SWAT 2018: 17:1-17:11 - [i24]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 abs/1802.09505 (2018) - [i23]J. Ian Munro, Sebastian Wild
Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. CoRR abs/1805.04154 (2018) - [i22]Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich:
Dynamic Trees with Almost-Optimal Access Cost. CoRR abs/1806.10498 (2018) - [i21]Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund:
Improved Time and Space Bounds for Dynamic Range Mode. CoRR abs/1807.03827 (2018) - 2017
- [j95]J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan:
Top-k Term-Proximity in Succinct Space. Algorithmica 78(2): 379-393 (2017) - [j94]Timothy M. Chan, Meng He
Succinct Indices for Path Minimum, with Applications. Algorithmica 78(2): 453-491 (2017) - [j93]Hicham El-Zein
On the Succinct Representation of Equivalence Classes. Algorithmica 78(3): 1020-1040 (2017) - [j92]Varunkumar Jayapaul
Finding modes with equality comparisons. Theor. Comput. Sci. 704: 28-41 (2017) - [c135]Hicham El-Zein, J. Ian Munro, Yakov Nekrich
Succinct Color Searching in One Dimension. ISAAC 2017: 30:1-30:11 - [c134]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. ISAAC 2017: 57:1-57:12 - [c133]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. SODA 2017: 408-424 - [i20]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. CoRR abs/1707.01743 (2017) - [i19]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Text Indexing and Searching in Sublinear Time. CoRR abs/1712.07431 (2017) - 2016
- [j91]J. Ian Munro, Patrick K. Nicholson
Succinct Posets. Algorithmica 76(2): 445-473 (2016) - [j90]Meng He
Data Structures for Path Queries. ACM Trans. Algorithms 12(4): 53:1-53:32 (2016) - [j89]Moshe Lewenstein, J. Ian Munro, Yakov Nekrich
Document retrieval with one wildcard. Theor. Comput. Sci. 635: 94-101 (2016) - [j88]Ayelet Butman, Noa Lewenstein, J. Ian Munro:
Permuted scaled matching. Theor. Comput. Sci. 638: 27-32 (2016) - [j87]J. Ian Munro, Yakov Nekrich
Fast construction of wavelet trees. Theor. Comput. Sci. 638: 91-97 (2016) - [j86]Amr Elmasry, Meng He
Dynamic range majority data structures. Theor. Comput. Sci. 647: 59-73 (2016) - [c132]Hicham El-Zein, J. Ian Munro, Matthew Robertson:
Raising Permutations to Powers in Place. ISAAC 2016: 29:1-29:12 - [c131]J. Ian Munro:
Succinct Data Structures ... Potential for Symbolic Computation? ISSAC 2016: 5-8 - [r3]J. Ian Munro, Patrick K. Nicholson:
Compressed Representations of Graphs. Encyclopedia of Algorithms 2016: 382-386 - [i18]Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Range Majorities and Minorities in Arrays. CoRR abs/1606.04495 (2016) - [i17]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. CoRR abs/1607.04346 (2016) - 2015
- [j85]Stephane Durocher, Hicham El-Zein
Low space data structures for geometric range mode query. Theor. Comput. Sci. 581: 97-101 (2015) - [j84]Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan
On hardness of several string indexing problems. Theor. Comput. Sci. 582: 74-82 (2015) - [j83]Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Finding median in read-only memory on integer input. Theor. Comput. Sci. 583: 51-56 (2015) - [c130]J. Ian Munro, Yakov Nekrich
Range Counting with Distinct Constraints. CCCG 2015 - [c129]J. Ian Munro, Yakov Nekrich
Compressed Data Structures for Dynamic Sequences. ESA 2015: 891-902 - [c128]Hicham El-Zein, J. Ian Munro, Siwei Yang:
On the Succinct Representation of Unlabeled Permutations. ISAAC 2015: 49-59 - [c127]Marek Chrobak, Mordecai J. Golin
Optimal Search Trees with 2-Way Comparisons. ISAAC 2015: 71-82 - [c126]J. Ian Munro, Yakov Nekrich
Dynamic Data Structures for Document Collections and Graphs. PODS 2015: 277-289 - [c125]Varunkumar Jayapaul
Sorting and Selection with Equality Comparisons. WADS 2015: 434-445 - [i16]J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter:
Dynamic Data Structures for Document Collections and Graphs. CoRR abs/1503.05977 (2015) - [i15]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
Optimal search trees with equality tests. CoRR abs/1505.00357 (2015) - [i14]J. Ian Munro, Yakov Nekrich:
Compressed Data Structures for Dynamic Sequences. CoRR abs/1507.06866 (2015) - 2014
- [j82]Arash Farzan, J. Ian Munro:
A Uniform Paradigm to Succinctly Encode Various Families of Trees. Algorithmica 68(1): 16-40 (2014) - [j81]Meng He
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. Algorithmica 70(4): 696-717 (2014) - [j80]Meng He
Space efficient data structures for dynamic orthogonal range counting. Comput. Geom. 47(2): 268-281 (2014) - [j79]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): 14-40 (2014) - [j78]Moshe Lewenstein
Less space: Indexing for queries with wildcards. Theor. Comput. Sci. 557: 120-127 (2014) - [c124]Shrinu Kushagra, Alejandro López-Ortiz, Aurick Qiao, J. Ian Munro:
Multi-Pivot Quicksort: Theory and Experiments. ALENEX 2014: 47-60 - [c123]Stephane Durocher, Hicham El-Zein, J. Ian Munro, Sharma V. Thankachan:
Low Space Data Structures for Geometric Range Mode Query. CCCG 2014 - [c122]Ayelet Butman, Noa Lewenstein, J. Ian Munro:
Permuted Scaled Matching. CPM 2014: 70-78 - [c121]Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan:
On Hardness of Several String Indexing Problems. CPM 2014: 242-251 - [c120]Timothy M. Chan, Meng He
Succinct Indices for Path Minimum, with Applications to Path Reporting. ESA 2014: 247-259 - [c119]Moshe Lewenstein, J. Ian Munro, Patrick K. Nicholson, Venkatesh Raman:
Improved Explicit Data Structures in the Bitprobe Model. ESA 2014: 630-641 - [c118]J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan:
Top- k Term-Proximity in Succinct Space. ISAAC 2014: 169-180 - [c117]Hicham El-Zein, J. Ian Munro, Venkatesh Raman:
Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes. ISAAC 2014: 543-552 - [c116]Meng He
Dynamic Path Counting and Reporting in Linear Space. ISAAC 2014: 565-577 - [c115]Moshe Lewenstein, J. Ian Munro, Yakov Nekrich
Document Retrieval with One Wildcard. MFCS (2) 2014: 529-540 - [c114]Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Selection and Sorting in the "Restore" Model. SODA 2014: 995-1004 - [c113]J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter:
Fast Construction of Wavelet Trees. SPIRE 2014: 101-110 - [c112]J. Ian Munro, Gonzalo Navarro, Rahul Shah, Sharma V. Thankachan:
Ranked Document Selection. SWAT 2014: 344-356 - [c111]J. Ian Munro:
In as Few Comparisons as Possible. WALCOM 2014: 5-6 - 2013
- [j77]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
Sorting under partial information (without the ellipsoid algorithm). Comb. 33(6): 655-697 (2013) - [j76]Stephane Durocher, Meng He
Range majority in constant time and linear space. Inf. Comput. 222: 169-179 (2013) - [j75]Pedram Ghodsnia, Kamran Tirdad, J. Ian Munro, Alejandro López-Ortiz:
A novel approach for leveraging co-occurrence to improve the false positive error in signature files. J. Discrete Algorithms 18: 63-74 (2013) - [j74]Arash Farzan, J. Ian Munro:
Succinct encoding of arbitrary graphs. Theor. Comput. Sci. 513: 38-52 (2013) - [c110]Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan:
Less Space: Indexing for Queries with Wildcards. ISAAC 2013: 89-99 - [c109]Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers. ISAAC 2013: 405-412 - [c108]Moshe Lewenstein, J. Ian Munro, Venkatesh Raman:
Succinct Data Structures for Representing Equivalence Classes. ISAAC 2013: 502-512 - [c107]Robert Fraser, Meng He
The Distance 4-Sector of Two Points Is Unique. ISAAC 2013: 612-622 - [c106]Francisco Claude, J. Ian Munro:
Adaptive Data Structures for Permutations and Binary Relations. SPIRE 2013: 64-71 - [c105]Francisco Claude, J. Ian Munro:
Document Listing on Versioned Documents. SPIRE 2013: 72-83 - [i13]Moshe Lewenstein, J. Ian Munro, Venkatesh Raman:
Succinct data structures for representing equivalence classes. CoRR abs/1306.4287 (2013) - 2012
- [j73]Jérémy Barbay
Succinct Representation of Labeled Graphs. Algorithmica 62(1-2): 224-257 (2012) - [j72]Meng He
Succinct ordinal trees based on tree covering. ACM Trans. Algorithms 8(4): 42:1-42:32 (2012) - [j71]J. Ian Munro, Rajeev Raman
Succinct representations of permutations and functions. Theor. Comput. Sci. 438: 74-88 (2012) - [c104]J. Ian Munro:
The Complexity of Partial Orders. ALENEX 2012: 64 - [c103]J. Ian Munro:
The Complexity of Partial Orders. ANALCO 2012: 40 - [c102]Meng He
Succinct Data Structures for Path Queries. ESA 2012: 575-586 - [c101]J. Ian Munro, Patrick K. Nicholson:
Succinct Posets. ESA 2012: 743-754 - [c100]Arash Farzan, J. Ian Munro, Rajeev Raman
Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima. ICALP (1) 2012: 327-338 - [c99]Meng He
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. ISAAC 2012: 537-547 - [i12]J. Ian Munro, Patrick K. Nicholson:
Succinct Posets. CoRR abs/1204.1957 (2012) - [i11]Arash Farzan, J. Ian Munro, Rajeev Raman:
Succinct Indices for Range Queries with applications to Orthogonal Range Maxima. CoRR abs/1204.4835 (2012) - 2011
- [j70]Jérémy Barbay
Succinct indexes for strings, binary relations and multilabeled trees. ACM Trans. Algorithms 7(4): 52:1-52:27 (2011) - [j69]Arash Farzan, J. Ian Munro:
Succinct representation of dynamic trees. Theor. Comput. Sci. 412(24): 2668-2678 (2011) - [j68]Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He
Untangled monotonic chains and adaptive range search. Theor. Comput. Sci. 412(32): 4200-4211 (2011) - [c98]Stephane Durocher, Meng He
Range Majority in Constant Time and Linear Space. ICALP (1) 2011: 244-255 - [c97]Meng He
Path Queries in Weighted Trees. ISAAC 2011: 140-149 - [c96]Amr Elmasry, Meng He
Dynamic Range Majority Data Structures. ISAAC 2011: 150-159 - [c95]Meng He
Dynamic Range Selection in Linear Space. ISAAC 2011: 160-169 - [c94]Travis Gagie
Finding Frequent Elements in Compressed 2D Arrays and Strings. SPIRE 2011: 295-300 - [c93]Kamran Tirdad, Pedram Ghodsnia, J. Ian Munro, Alejandro López-Ortiz:
COCA Filters: Co-occurrence Aware Bloom Filters. SPIRE 2011: 313-325 - [c92]Meng He
Space Efficient Data Structures for Dynamic Orthogonal Range Counting. WADS 2011: 500-511 - [i10]Meng He, J. Ian Munro, Patrick K. Nicholson:
Dynamic Range Majority Data Structures. CoRR abs/1104.5517 (2011) - [i9]Meng He, J. Ian Munro, Patrick K. Nicholson:
Dynamic Range Selection in Linear Space. CoRR abs/1106.5076 (2011) - [i8]J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct Representations of Permutations and Functions. CoRR abs/1108.1983 (2011) - 2010
- [j67]M. Ziaur Rahman, J. Ian Munro:
Integer Representation and Counting in the Bit Probe Model. Algorithmica 56(1): 105-127 (2010) - [j66]Therese Biedl, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, J. Ian Munro:
Sorting with networks of data structures. Discret. Appl. Math. 158(15): 1579-1586 (2010) - [j65]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
An Efficient Algorithm for Partial Order Production. SIAM J. Comput. 39(7): 2927-2940 (2010) - [c91]Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro:
Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. SODA 2010: 1448-1456 - [c90]Francisco Claude, J. Ian Munro, Patrick K. Nicholson:
Range Queries over Untangled Chains. SPIRE 2010: 82-93 - [c89]Meng He
Succinct Representations of Dynamic Strings. SPIRE 2010: 334-346 - [c88]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
Sorting under partial information (without the ellipsoid algorithm). STOC 2010: 359-368 - [i7]Marek Karpinski, J. Ian Munro, Yakov Nekrich:
Range Reporting for Moving Points on a Grid. CoRR abs/1002.3511 (2010) - [i6]Meng He, J. Ian Munro:
Succinct Representations of Dynamic Strings. CoRR abs/1005.4652 (2010)
2000 – 2009
- 2009
- [j64]J. Ian Munro, Dorothea Wagner:
Preface. ACM J. Exp. Algorithmics 14 (2009) - [j63]Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro:
On the relative dominance of paging algorithms. Theor. Comput. Sci. 410(38-40): 3694-3701 (2009) - [c87]J. Ian Munro:
Reflections on Optimal and Nearly Optimal Binary Search Trees. Efficient Algorithms 2009: 115-120 - [c86]Arash Farzan, J. Ian Munro:
Dynamic Succinct Ordered Trees. ICALP (1) 2009: 439-450 - [c85]Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He
Untangled Monotonic Chains and Adaptive Range Search. ISAAC 2009: 203-212 - [c84]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
An efficient algorithm for partial order production. STOC 2009: 93-100 - [c83]Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala:
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance. WADS 2009: 218-229 - [c82]Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro:
An Application of Self-organizing Data Structures to Compression. SEA 2009: 137-148 - [i5]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
Sorting under Partial Information (without the Ellipsoid Algorithm). CoRR abs/0911.0086 (2009) - 2008
- [c81]J. Ian Munro:
Lower Bounds for Succinct Data Structures. CPM 2008: 3 - [c80]Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro:
List Update Algorithms for Data Compression. DCC 2008: 512 - [c79]Arash Farzan, J. Ian Munro:
Succinct Representations of Arbitrary Graphs. ESA 2008: 393-404 - [c78]Arash Farzan, J. Ian Munro:
A Uniform Approach Towards Succinct Representation of Trees. SWAT 2008: 173-184 - [e3]J. Ian Munro, Dorothea Wagner:
Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, ALENEX 2008, San Francisco, California, USA, January 19, 2008. SIAM 2008, ISBN 978-1-61197-288-7 [contents] - [r2]Jérémy Barbay, J. Ian Munro:
Succinct Encoding of Permutations: Applications to Text Indexing. Encyclopedia of Algorithms 2008 - [i4]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
An Efficient Algorithm for Partial Order Production. CoRR abs/0811.2572 (2008) - 2007
- [j62]Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro:
An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms. SIAM J. Comput. 36(6): 1672-1695 (2007) - [j61]Jérémy Barbay
Adaptive searching in succinctly encoded binary relations and tree-structured documents. Theor. Comput. Sci. 387(3): 284-297 (2007) - [c77]Meng He
Succinct Ordinal Trees Based on Tree Covering. ICALP 2007: 509-520 - [c76]M. Ziaur Rahman, J. Ian Munro:
Integer Representation and Counting in the Bit Probe Model. ISAAC 2007: 5-16 - [c75]Jérémy Barbay
Succinct Representation of Labeled Graphs. ISAAC 2007: 316-328 - [c74]Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro:
On the Relative Dominance of Paging Algorithms. ISAAC 2007: 488-499 - [c73]Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao:
Succinct indexes for strings, binary relations and multi-labeled trees. SODA 2007: 680-689 - 2006
- [j60]Gordon V. Cormack, J. Ian Munro, Troy Vasiga, Graeme Kemkes:
Structure, Scoring and Purpose of Computing Competitions. Informatics Educ. 5(1): 15-36 (2006) - [j59]Alejandro López-Ortiz, J. Ian Munro:
Foreword. ACM Trans. Algorithms 2(4): 491 (2006) - [j58]Patricio V. Poblete, J. Ian Munro, Thomas Papadakis:
The binomial transform and the analysis of skip lists. Theor. Comput. Sci. 352(1-3): 136-158 (2006) - [j57]Kyung-Yong Chwa, J. Ian Munro:
Preface. Theor. Comput. Sci. 363(1): 1 (2006) - [c72]Jérémy Barbay
Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents. CPM 2006: 24-35 - [c71]Andrej Brodnik
An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture. IFIP TCS 2006: 103-114 - [c70]Arash Farzan, J. Ian Munro:
Succinct representation of finite abelian groups. ISSAC 2006: 87-92 - [c69]Alexander Golynski, J. Ian Munro, S. Srinivasa Rao:
Rank/select operations on large alphabets: a tool for text indexing. SODA 2006: 368-373 - [c68]Gianni Franceschini, J. Ian Munro:
Implicit dictionaries with O(1) modifications per update and fast search. SODA 2006: 404-413 - [i3]Andrej Brodnik, Johan Karlsson, J. Ian Munro, Andreas Nilsson:
An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture. CoRR abs/cs/0601081 (2006) - 2005
- [j56]Gerth Stølting Brodal
Fast allocation and deallocation with an improved buddy system. Acta Informatica 41(4-5): 273-291 (2005) - [j55]David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman
Representing Trees of Higher Degree. Algorithmica 43(4): 275-292 (2005) - [j54]Andrej Brodnik
Worst case constant time priority queue. J. Syst. Softw. 78(3): 249-256 (2005) - [c67]Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro:
Cache-Oblivious Comparison-Based Algorithms on Multisets. ESA 2005: 305-316 - [c66]Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders:
Towards Optimal Multiple Selection. ICALP 2005: 103-114 - [c65]Meng He, J. Ian Munro, S. Srinivasa Rao:
A categorization theorem on suffix arrays with applications to space efficient text indexes. SODA 2005: 23-32 - 2004
- [j53]Therese Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin
Fun-Sort--or the chaos of unordered binary search. Discret. Appl. Math. 144(3): 231-236 (2004) - [j52]Nicholas J. A. Harvey, J. Ian Munro:
Deterministic SkipNet. Inf. Process. Lett. 90(4): 205-208 (2004) - [j51]Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli
Implicit B-trees: a new data structure for the dictionary problem. J. Comput. Syst. Sci. 68(4): 788-807 (2004) - [j50]Ian Munro, John Mingers:
Response to Richard Ormerod. J. Oper. Res. Soc. 55(1): 90-93 (2004) - [c64]J. Ian Munro, S. Srinivasa Rao
Succinct Representations of Functions. ICALP 2004: 1006-1015 - [c63]J. Ian Munro:
Succinct Data Structures. CATS 2004: 3 - [e2]Kyung-Yong Chwa, J. Ian Munro:
Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings. Lecture Notes in Computer Science 3106, Springer 2004, ISBN 3-540-22856-X [contents] - [e1]J. Ian Munro:
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004. SIAM 2004, ISBN 0-89871-558-X [contents] - [r1]J. Ian Munro, S. Srinivasa Rao
Succinct Representation of Data Structures. Handbook of Data Structures and Applications 2004 - 2003
- [j49]Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro:
On universally easy classes for NP-complete problems. Theor. Comput. Sci. 304(1-3): 471-476 (2003) - [c62]J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
Succinct Representations of Permutations. ICALP 2003: 345-356 - [c61]Lukasz Golab, David DeHaan, Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro:
Identifying frequent items in sliding windows over on-line packet streams. Internet Measurement Conference 2003: 173-178 - [c60]Nicholas J. A. Harvey, J. Ian Munro:
Brief announcement: deterministic skipnet. PODC 2003: 152 - [c59]Paul E. Kearney, J. Ian Munro, Derek Phillips:
Efficient Generation of Uniform Samples from Phylogenetic Trees. WABI 2003: 177-189 - 2002
- [j48]Prosenjit Bose
Efficient visibility queries in simple polygons. Comput. Geom. 23(3): 313-335 (2002) - [j47]Prosenjit Bose
Online Routing in Convex Subdivisions. Int. J. Comput. Geom. Appl. 12(4): 283-296 (2002) - [j46]Ian Munro, John Mingers:
The use of multimethodology in practice - results of a survey of practitioners. J. Oper. Res. Soc. 53(4): 369-378 (2002) - [c58]Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro:
Frequency Estimation of Internet Packet Streams with Limited Space. ESA 2002: 348-360 - [c57]Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli:
Implicit B-Trees: New Results for the Dictionary Problem. FOCS 2002: 145-154 - [c56]Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro:
Cache-oblivious priority queue and graph algorithm applications. STOC 2002: 268-276 - [c55]Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro:
Robot Localization without Depth Perception. SWAT 2002: 249-259 - [i2]Stephen Alstrup, Michael A. Bender, Erik D. Demaine, Martin Farach-Colton, J. Ian Munro, Theis Rauhe, Mikkel Thorup:
Efficient Tree Layout in a Multilevel Memory Hierarchy. CoRR cs.DS/0211010 (2002) - 2001
- [j45]J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
Space Efficient Suffix Trees. J. Algorithms 39(2): 205-222 (2001) - [j44]J. Ian Munro, Venkatesh Raman:
Succinct Representation of Balanced Parentheses and Static Trees. SIAM J. Comput. 31(3): 762-776 (2001) - [c54]Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro:
Experiments on Adaptive Set Intersections for Text Retrieval Systems. ALENEX 2001: 91-104 - [c53]Andrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro:
Worst case constant time priority queue. SODA 2001: 523-528 - [c52]J. Ian Munro, Venkatesh Raman, Adam J. Storm:
Representing dynamic binary trees succinctly. SODA 2001: 529-536 - [c51]Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro:
On universally easy classes for NP-complete problems. SODA 2001: 910-911 - [i1]Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro:
The Complexity of Clickomania. CoRR cs.CC/0107031 (2001) - 2000
- [c50]J. Ian Munro:
On the Competitiveness of Linear Search. ESA 2000: 338-345 - [c49]Prosenjit Bose, Pat Morin
Online Routing in Convex Subdivisions. ISAAC 2000: 47-59 - [c48]Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro:
Adaptive set intersections, unions, and differences. SODA 2000: 743-752
1990 – 1999
- 1999
- [j43]Andrej Brodnik
Membership in Constant Time and Almost-Minimum Space. SIAM J. Comput. 28(5): 1627-1640 (1999) - [c47]Erik D. Demaine, J. Ian Munro:
Fast Allocation and Deallocation with an Improved Buddy System. FSTTCS 1999: 84-96 - [c46]Andrej Brodnik
Resizable Arrays in Optimal Time and Space. WADS 1999: 37-48 - [c45]David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman:
Representing Trees of Higer Degree. WADS 1999: 169-180 - 1998
- [c44]J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
Space Efficient Suffix Trees. FSTTCS 1998: 186-196 - 1997
- [j42]Patricio V. Poblete, Alfredo Viola, J. Ian Munro:
The Diagonal Poisson Transform and its application to the analysis of a hashing scheme. Random Struct. Algorithms 10(1-2): 221-255 (1997) - [c43]J. Ian Munro, Venkatesh Raman:
Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs. FOCS 1997: 118-126 - [c42]Andrej Brodnik
Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds. WADS 1997: 426-439 - 1996
- [j41]J. Ian Munro, Venkatesh Raman:
Fast Stable In-Place Sorting with O (n) Data Moves. Algorithmica 16(2): 151-160 (1996) - [j40]J. Ian Munro, Venkatesh Raman:
Selection from Read-Only Memory and Sorting with Minimum Data Movement. Theor. Comput. Sci. 165(2): 311-323 (1996) - [c41]J. Ian Munro:
Tables. FSTTCS 1996: 37-42 - [c40]David R. Clark, J. Ian Munro:
Efficient Suffix Trees on Secondary Storage (extended Abstract). SODA 1996: 383-391 - [c39]Andrej Brodnik
Neighbours on a Grid. SWAT 1996: 309-320 - 1995
- [j39]Faith E. Fich, J. Ian Munro, Patricio V. Poblete:
Permuting in Place. SIAM J. Comput. 24(2): 266-278 (1995) - [c38]Patricio V. Poblete, J. Ian Munro, Thomas Papadakis:
The Binomial Transform and its Application to the Analysis of Skip Lists. ESA 1995: 554-569 - 1994
- [c37]Andrej Brodnik
Membership in Constant Time and Minimum Space. ESA 1994: 72-81 - [c36]Patricio V. Poblete, Alfredo Viola, J. Ian Munro:
The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract). ESA 1994: 94-105 - 1993
- [c35]Torben Hagerup, Kurt Mehlhorn, J. Ian Munro:
Maintaining Discrete Probability Distributions Optimally. ICALP 1993: 253-264 - 1992
- [j38]Thomas Papadakis, J. Ian Munro, Patricio V. Poblete:
Average Search and Update Costs in Skip Lists. BIT 32(2): 316-332 (1992) - [j37]J. Ian Munro, Venkatesh Raman:
Sorting with Minimum Data Movement. J. Algorithms 13(3): 374-393 (1992) - [j36]Walter Cunto, J. Ian Munro, Manuel Rey:
Selecting the Median and Two Quartiles in a Set of Numbers. Softw. Pract. Exp. 22(6): 439-454 (1992) - [c34]J. Ian Munro, Venkatesh Raman:
Selection from Read-Only Memory and Sorting with Optimum Data Movement. FSTTCS 1992: 380-391 - [c33]J. Ian Munro, Thomas Papadakis, Robert Sedgewick:
Deterministic Skip Lists. SODA 1992: 367-375 - 1991
- [j35]Walter Cunto, Gaston H. Gonnet, J. Ian Munro, Patricio V. Poblete:
Fringe Analysis for Extquick: An in Situ Distributive External Sorting Algorithm. Inf. Comput. 92(2): 141-160 (1991) - [j34]Amos Fiat, J. Ian Munro, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel:
An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time. J. Comput. Syst. Sci. 43(3): 406-424 (1991) - [c32]J. Ian Munro, Venkatesh Raman:
Fast Sorting In-Place Sorting with O(n) Data. FSTTCS 1991: 266-277 - [c31]Walter Cunto, J. Ian Munro, Patricio V. Poblete:
A Case Study in Comparison Based Complexity: Finding the Nearest Value(s). WADS 1991: 1-12 - [c30]J. Ian Munro, Venkatesh Raman:
Sorting Multisets and Vectors In-Place. WADS 1991: 473-480 - 1990
- [j33]Joseph C. Culberson, J. Ian Munro:
Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees. Algorithmica 5(3): 295-311 (1990) - [j32]J. Ian Munro, Venkatesh Raman, Jeffrey S. Salowe:
Stable in Situ Sorting and Minimum Data Movement. BIT 30(2): 220-234 (1990) - [j31]B. John Oommen
Deterministic Optimal and Expedient Move-to-Rear List Organizing Strategies. Theor. Comput. Sci. 74(2): 183-197 (1990) - [c29]Faith E. Fich, J. Ian Munro, Patricio V. Poblete:
Permuting. FOCS 1990: 372-379 - [c28]Thomas Papadakis, J. Ian Munro, Patricio V. Poblete:
Analysis of the Expected Search Cost in Skip Lists. SWAT 1990: 160-172
1980 – 1989
- 1989
- [j30]Joseph C. Culberson, J. Ian Munro:
Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations. Comput. J. 32(1): 68-75 (1989) - [j29]Walter Cunto, J. Ian Munro:
Average case selection. J. ACM 36(2): 270-279 (1989) - [j28]Patricio V. Poblete, J. Ian Munro:
Last-Come-First-Served Hashing. J. Algorithms 10(2): 228-248 (1989) - [c27]J. Ian Munro, Venkatesh Raman:
Sorting with Minimum Data Movement (Preliminary Draft). WADS 1989: 552-562 - 1988
- [c26]Svante Carlsson, J. Ian Munro, Patricio V. Poblete:
An Implicit Binomial Queue with Constant Insertion Time. SWAT 1988: 1-13 - 1987
- [j27]J. Ian Munro, Patricio V. Poblete:
Searchability in Merging and Implicit Data Structures. BIT 27(3): 324-329 (1987) - [c25]J. Ian Munro, Mark H. Overmars, Derick Wood:
Variations on Visibility. SCG 1987: 291-299 - [c24]J. Ian Munro:
Searching a Two Key Table Under a Single Key. STOC 1987: 383-387 - 1986
- [j26]J. Ian Munro:
An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log² n) Time. J. Comput. Syst. Sci. 33(1): 66-74 (1986) - [j25]Gaston H. Gonnet, J. Ian Munro:
Heaps on Heaps. SIAM J. Comput. 15(4): 964-971 (1986) - [c23]J. Ian Munro, Pedro Celis:
Techniques for Collision Resolution in Hash Tables with Open Addressing. FJCC 1986: 601-610 - [c22]J. Ian Munro:
Developing Implicit Data Structures. MFCS 1986: 168-176 - 1985
- [j24]Patricio V. Poblete, J. Ian Munro:
The Analysis of a Fringe Heuristic for Binary Search Trees. J. Algorithms 6(3): 336-350 (1985) - [j23]David P. Dobkin, J. Ian Munro:
Efficient Uses of the Past. J. Algorithms 6(4): 455-465 (1985) - [c21]Pedro Celis, Per-Åke Larson, J. Ian Munro:
Robin Hood Hashing (Preliminary Report). FOCS 1985: 281-288 - [c20]Rolf G. Karlsson, J. Ian Munro, Edward L. Robertson:
The Nearest Neighbor Problem on Bounded Domains. ICALP 1985: 318-327 - [c19]Rolf G. Karlsson, J. Ian Munro:
Proximity of a Grid. STACS 1985: 187-196 - 1984
- [j22]J. Ian Munro, Patricio V. Poblete:
Fault Tolerance and Storage Reduction in Binary Search Trees. Inf. Control. 62(2/3): 210-218 (1984) - [j21]Helmut Alt, Kurt Mehlhorn, J. Ian Munro:
Partial Match Retrieval in Implicit Data Structures. Inf. Process. Lett. 19(2): 61-65 (1984) - [j20]Gaston H. Gonnet, J. Ian Munro:
The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform. J. Algorithms 5(4): 451-470 (1984) - [c18]J. Ian Munro:
An Implicit Data Structure for the Dictionary Problem that Runs in Polylog Time. FOCS 1984: 369-374 - [c17]Walter Cunto, J. Ian Munro:
Average Case Selection. STOC 1984: 369-375 - 1983
- [j19]Gaston H. Gonnet, J. Ian Munro, Derick Wood:
Direct dynamic structures for some line segment problems. Comput. Vis. Graph. Image Process. 23(2): 178-186 (1983) - [c16]J. Ian Munro, Patricio V. Poblete:
Searchability in Merging and Implicit Data Structures. ICALP 1983: 527-535 - [c15]J. Ian Munro, Patricio V. Poblete:
A Discipline for Robustness or Storage Reduction in Binary Search Trees. PODS 1983: 70-75 - 1982
- [j18]Raúl J. Ramírez, Frank Wm. Tompa
Optimum Reorganization Points for Arbitrary Database Costs. Acta Informatica 18: 17-30 (1982) - [j17]Gaston H. Gonnet, Per-Åke Larson, J. Ian Munro, Doron Rotem, David J. Taylor, Frank Wm. Tompa:
Database Storage Structures Research at the University of Waterloo. IEEE Database Eng. Bull. 5(1): 49-52 (1982) - [j16]J. Ian Munro, Raúl J. Ramírez:
Technical Note - Reducing Space Requirements for Shortest Path Problems. Oper. Res. 30(5): 1009-1013 (1982) - [c14]Gaston H. Gonnet, J. Ian Munro:
Heaps on Heaps. ICALP 1982: 282-291 - 1981
- [j15]J. Ian Munro, Edward L. Robertson:
Continual Pattern Replication. Inf. Control. 48(3): 211-220 (1981) - [j14]David P. Dobkin, J. Ian Munro:
Optimal Time Minimal Space Selection Algorithms. J. ACM 28(3): 454-461 (1981) - [j13]Gaston H. Gonnet, J. Ian Munro, Hendra Suwanda:
Exegesis of Self-Organizing Linear Search. SIAM J. Comput. 10(3): 613-637 (1981) - [c13]Helmut Alt, Kurt Mehlhorn, J. Ian Munro:
Partial Match Retrieval in Implicit Data Structures. MFCS 1981: 156-161 - [c12]Gaston H. Gonnet, J. Ian Munro:
A Linear Probing Sort and its Analysis (Preliminary Draft). STOC 1981: 90-95 - 1980
- [j12]J. Ian Munro, Hendra Suwanda:
Implicit Data Structures for Fast Search and Update. J. Comput. Syst. Sci. 21(2): 236-250 (1980) - [j11]David P. Dobkin, J. Ian Munro:
Determining the Mode. Theor. Comput. Sci. 12: 255-263 (1980) - [j10]J. Ian Munro, Mike Paterson:
Selection and Sorting with Limited Storage. Theor. Comput. Sci. 12: 315-323 (1980) - [c11]David P. Dobkin, J. Ian Munro:
Efficient Uses of the Past. FOCS 1980: 200-206
1970 – 1979
- 1979
- [j9]Gaston H. Gonnet, J. Ian Munro:
Efficient Ordering of Hash Tables. SIAM J. Comput. 8(3): 463-478 (1979) - [c10]Gaston H. Gonnet, J. Ian Munro, Hendra Suwanda:
Toward Self-Organizing Linear Search (Preliminary Draught). FOCS 1979: 169-174 - [c9]J. Ian Munro, Hendra Suwanda:
Implicit Data Structures (Preliminary Draft). STOC 1979: 108-117 - 1978
- [j8]Brian Allen, J. Ian Munro:
Self-Organizing Binary Search Trees. J. ACM 25(4): 526-535 (1978) - [c8]J. Ian Munro, Mike Paterson:
Selection and Sorting with Limited Storage. FOCS 1978: 253-258 - [c7]David P. Dobkin, J. Ian Munro:
Time and Space Bounds for Selection Problems. ICALP 1978: 192-204 - 1977
- [j7]W. Morven Gentleman, J. Ian Munro:
Designing Overlay Structures. Softw. Pract. Exp. 7(4): 493-500 (1977) - [c6]J. Ian Munro:
The Parallel Complexity of Arithmetic Computation. FCT 1977: 466-475 - [c5]Gaston H. Gonnet, J. Ian Munro:
The Analysis of an Improved Hashing Technique. STOC 1977: 113-121 - 1976
- [j6]J. Ian Munro, Philip M. Spira:
Sorting and Searching in Multisets. SIAM J. Comput. 5(1): 1-8 (1976) - [c4]Brian Allen, J. Ian Munro:
Self-Organizing Binary Search Trees. FOCS 1976: 166-172 - 1975
- [b1]Allan Borodin, J. Ian Munro:
The computational complexity of algebraic and numeric problems. Elsevier computer science library 1, Elsevier 1975, ISBN 0444001565, pp. I-X, 1-174 - 1974
- [j5]Tiko Kameda, J. Ian Munro:
A O(|V|*|E|) algorithm for maximum matching of graphs. Computing 12(1): 91-98 (1974) - 1973
- [j4]J. Ian Munro, Mike Paterson:
Optimal Algorithms for Parallel Polynomial Evaluation. J. Comput. Syst. Sci. 7(2): 189-198 (1973) - [c3]J. Ian Munro:
In search of the fastest algorithm. AFIPS National Computer Conference 1973: 453 - 1972
- [j3]J. Ian Munro, Allan Borodin:
Efficient Evaluation of Polynomial Forms. J. Comput. Syst. Sci. 6(6): 625-638 (1972) - 1971
- [j2]J. Ian Munro:
Efficient Determination of the Transitive Closure of a Directed Graph. Inf. Process. Lett. 1(2): 56-58 (1971) - [j1]Allan Borodin, J. Ian Munro:
Evaluating Polynomials at Many Points. Inf. Process. Lett. 1(2): 66-68 (1971) - [c2]J. Ian Munro, Mike Paterson:
Optimal Algorithms for Parallel Polynomial Evaluation. SWAT 1971: 132-139 - [c1]J. Ian Munro:
Some Results Concerning Efficient and Optimal Algorithms. STOC 1971: 40-44
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: