J. Ian Munro

University of Waterloo, Cheriton School of Computer Science

	2013
j73		Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala: Range majority in constant time and linear space. Inf. Comput. 222: 169-179 (2013)
j72		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)
	2012
j71		Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro: Succinct Representation of Labeled Graphs. Algorithmica 62(1-2): 224-257 (2012)
j70		Meng He, J. Ian Munro, Srinivasa Rao Satti: Succinct ordinal trees based on tree covering. ACM Transactions on Algorithms 8(4): 42 (2012)
j69		J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao: Succinct representations of permutations and functions. Theor. Comput. Sci. 438: 74-88 (2012)
c103		J. Ian Munro: The Complexity of Partial Orders. ALENEX 2012: 64
c102		J. Ian Munro: The Complexity of Partial Orders. ANALCO 2012: 40
c101		Meng He, J. Ian Munro, Gelin Zhou: Succinct Data Structures for Path Queries. ESA 2012: 575-586
c100		J. Ian Munro, Patrick K. Nicholson: Succinct Posets. ESA 2012: 743-754
c99		Arash Farzan, J. Ian Munro, Rajeev Raman: Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima. ICALP (1) 2012: 327-338
c98		Meng He, J. Ian Munro, Gelin Zhou: 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
j68		Jérémy Barbay, Meng He, J. Ian Munro, Srinivasa Rao Satti: Succinct indexes for strings, binary relations and multilabeled trees. ACM Transactions on Algorithms 7(4): 52 (2011)
j67		Arash Farzan, J. Ian Munro: Succinct representation of dynamic trees. Theor. Comput. Sci. 412(24): 2668-2678 (2011)
j66		Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala: Untangled monotonic chains and adaptive range search. Theor. Comput. Sci. 412(32): 4200-4211 (2011)
c97		Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala: Range Majority in Constant Time and Linear Space. ICALP (1) 2011: 244-255
c96		Meng He, J. Ian Munro, Gelin Zhou: Path Queries in Weighted Trees. ISAAC 2011: 140-149
c95		Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson: Dynamic Range Majority Data Structures. ISAAC 2011: 150-159
c94		Meng He, J. Ian Munro, Patrick K. Nicholson: Dynamic Range Selection in Linear Space. ISAAC 2011: 160-169
c93		Travis Gagie, Meng He, J. Ian Munro, Patrick K. Nicholson: Finding Frequent Elements in Compressed 2D Arrays and Strings. SPIRE 2011: 295-300
c92		Kamran Tirdad, Pedram Ghodsnia, J. Ian Munro, Alejandro López-Ortiz: COCA Filters: Co-occurrence Aware Bloom Filters. SPIRE 2011: 313-325
c91		Meng He, J. Ian Munro: 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
j65		M. Ziaur Rahman, J. Ian Munro: Integer Representation and Counting in the Bit Probe Model. Algorithmica 56(1): 105-127 (2010)
j64		Therese C. Biedl, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, J. Ian Munro: Sorting with networks of data structures. Discrete Applied Mathematics 158(15): 1579-1586 (2010)
j63		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)
c90		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
c89		Francisco Claude, J. Ian Munro, Patrick K. Nicholson: Range Queries over Untangled Chains. SPIRE 2010: 82-93
c88		Meng He, J. Ian Munro: Succinct Representations of Dynamic Strings. SPIRE 2010: 334-346
c87		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)
	2009
j62		J. Ian Munro, Dorothea Wagner: Preface. ACM Journal of Experimental Algorithmics 14 (2009)
j61		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)
c86		J. Ian Munro: Reflections on Optimal and Nearly Optimal Binary Search Trees. Efficient Algorithms 2009: 115-120
c85		Arash Farzan, J. Ian Munro: Dynamic Succinct Ordered Trees. ICALP (1) 2009: 439-450
c84		Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala: Untangled Monotonic Chains and Adaptive Range Search. ISAAC 2009: 203-212
c83		Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphael M. Jungers, J. Ian Munro: An efficient algorithm for partial order production. STOC 2009: 93-100
c82		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
c81		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, Raphael M. Jungers, J. Ian Munro: Sorting under Partial Information (without the Ellipsoid Algorithm). CoRR abs/0911.0086 (2009)
	2008
c80		J. Ian Munro: Lower Bounds for Succinct Data Structures. CPM 2008: 3
c79		Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro: List Update Algorithms for Data Compression. DCC 2008: 512
c78		Arash Farzan, J. Ian Munro: Succinct Representations of Arbitrary Graphs. ESA 2008: 393-404
c77		Arash Farzan, J. Ian Munro: A Uniform Approach Towards Succinct Representation of Trees. SWAT 2008: 173-184
r1		Jérémy Barbay, J. Ian Munro: Succinct Encoding of Permutations: Applications to Text Indexing. Encyclopedia of Algorithms 2008
e3		J. Ian Munro, Dorothea Wagner (Eds.): Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, ALENEX 2008, San Francisco, California, USA, January 19, 2008. SIAM 2008
i4		Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphael M. Jungers, J. Ian Munro: An Efficient Algorithm for Partial Order Production. CoRR abs/0811.2572 (2008)
	2007
j60		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)
j59		Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao: Adaptive searching in succinctly encoded binary relations and tree-structured documents. Theor. Comput. Sci. 387(3): 284-297 (2007)
c76		Meng He, J. Ian Munro, S. Srinivasa Rao: Succinct Ordinal Trees Based on Tree Covering. ICALP 2007: 509-520
c75		M. Ziaur Rahman, J. Ian Munro: Integer Representation and Counting in the Bit Probe Model. ISAAC 2007: 5-16
c74		Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro: Succinct Representation of Labeled Graphs. ISAAC 2007: 316-328
c73		Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro: On the Relative Dominance of Paging Algorithms. ISAAC 2007: 488-499
c72		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
j58		Gordon V. Cormack, J. Ian Munro, Troy Vasiga, Graeme Kemkes: Structure, Scoring and Purpose of Computing Competitions. Informatics in Education 5(1): 15-36 (2006)
j57		Alejandro López-Ortiz, J. Ian Munro: Foreword. ACM Transactions on Algorithms 2(4): 491 (2006)
j56		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)
j55		Kyung-Yong Chwa, J. Ian Munro: Preface. Theor. Comput. Sci. 363(1): 1 (2006)
c71		Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao: Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents. CPM 2006: 24-35
c70		Andrej Brodnik, Johan Karlsson, J. Ian Munro, Andreas Nilsson: An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture. IFIP TCS 2006: 103-114
c69		Arash Farzan, J. Ian Munro: Succinct representation of finite abelian groups. ISSAC 2006: 87-92
c68		Alexander Golynski, J. Ian Munro, S. Srinivasa Rao: Rank/select operations on large alphabets: a tool for text indexing. SODA 2006: 368-373
c67		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
j54		Gerth Stølting Brodal, Erik D. Demaine, J. Ian Munro: Fast allocation and deallocation with an improved buddy system. Acta Inf. 41(4-5): 273-291 (2005)
j53		David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao: Representing Trees of Higher Degree. Algorithmica 43(4): 275-292 (2005)
j52		Andrej Brodnik, Svante Carlsson, Michael L. Fredman, Johan Karlsson, J. Ian Munro: Worst case constant time priority queue. Journal of Systems and Software 78(3): 249-256 (2005)
c66		Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro: Cache-Oblivious Comparison-Based Algorithms on Multisets. ESA 2005: 305-316
c65		Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders: Towards Optimal Multiple Selection. ICALP 2005: 103-114
c64		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
j51		Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro: Fun-Sort--or the chaos of unordered binary search. Discrete Applied Mathematics 144(3): 231-236 (2004)
j50		J. Ian Munro: Succinct Data Structures. Electr. Notes Theor. Comput. Sci. 91: 3 (2004)
j49		Nicholas J. A. Harvey, J. Ian Munro: Deterministic SkipNet. Inf. Process. Lett. 90(4): 205-208 (2004)
j48		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)
c63		J. Ian Munro, S. Srinivasa Rao: Succinct Representations of Functions. ICALP 2004: 1006-1015
e2		Kyung-Yong Chwa, J. Ian Munro (Eds.): 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
e1		J. Ian Munro (Ed.): 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
	2003
j47		Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro: On universally easy classes for NP-complete problems. Theor. Comput. Sci. 1-3(304): 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 Comference 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
j46		Prosenjit Bose, Anna Lubiw, J. Ian Munro: Efficient visibility queries in simple polygons. Comput. Geom. 23(3): 313-335 (2002)
j45		Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro: Online Routing in Convex Subdivisions. Int. J. Comput. Geometry Appl. 12(4): 283-296 (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
j44		J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao: Space Efficient Suffix Trees. J. Algorithms 39(2): 205-222 (2001)
j43		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, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz: 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
	1999
j42		Andrej Brodnik, J. Ian Munro: 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, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick: 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
j41		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, Peter Bro Miltersen, J. Ian Munro: Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds. WADS 1997: 426-439
	1996
j40		J. Ian Munro, Venkatesh Raman: Fast Stable In-Place Sorting with O (n) Data Moves. Algorithmica 16(2): 151-160 (1996)
j39		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, J. Ian Munro: Neighbours on a Grid. SWAT 1996: 309-320
	1995
j38		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, J. Ian Munro: 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
j37		Thomas Papadakis, J. Ian Munro, Patricio V. Poblete: Average Search and Update Costs in Skip Lists. BIT 32(2): 316-332 (1992)
j36		J. Ian Munro, Venkatesh Raman: Sorting with Minimum Data Movement. J. Algorithms 13(3): 374-393 (1992)
j35		Walter Cunto, J. Ian Munro, Manuel Rey: Selecting the Median and Two Quartiles in a Set of Numbers. Softw., Pract. Exper. 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
j34		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)
j33		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
j32		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)
j31		J. Ian Munro, Venkatesh Raman, Jeffrey S. Salowe: Stable in Situ Sorting and Minimum Data Movement. BIT 30(2): 220-234 (1990)
j30		B. John Oommen, E. R. Hansen, J. Ian Munro: 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
	1989
j29		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)
j28		Walter Cunto, J. Ian Munro: Average case selection. J. ACM 36(2): 270-279 (1989)
j27		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
j26		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. Symposium on Computational Geometry 1987: 291-299
c24		J. Ian Munro: Searching a Two Key Table Under a Single Key. STOC 1987: 383-387
	1986
j25		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)
j24		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
j23		Patricio V. Poblete, J. Ian Munro: The Analysis of a Fringe Heuristic for Binary Search Trees. J. Algorithms 6(3): 336-350 (1985)
j22		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
j21		J. Ian Munro, Patricio V. Poblete: Fault Tolerance and Storage Reduction in Binary Search Trees. Information and Control 62(2/3): 210-218 (1984)
j20		Helmut Alt, Kurt Mehlhorn, J. Ian Munro: Partial Match Retrieval in Implicit Data Structures. Inf. Process. Lett. 19(2): 61-65 (1984)
j19		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
j18		Gaston H. Gonnet, J. Ian Munro, Derick Wood: Direct dynamic structures for some line segment problems. Computer Vision, Graphics, and Image Processing 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
j17		Raúl J. Ramírez, Frank Wm. Tompa, J. Ian Munro: Optimum Reorganization Points for Arbitrary Database Costs. Acta Inf. 18: 17-30 (1982)
j16		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)
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. Information and 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
	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. Exper. 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
	1974
j5		T. 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 (FOCS) 1971: 132-139
c1		J. Ian Munro: Some Results Concerning Efficient and Optimal Algorithms. STOC 1971: 40-44

Coauthor Index

Colors in the list of coauthors

Last update Tue May 21 17:12:32 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page