The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

J. Ian Munro: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Brian Allen, J. Ian Munro
    Self-Organizing Binary Search Trees. [Citation Graph (3, 0)][DBLP]
    J. ACM, 1978, v:25, n:4, pp:526-535 [Journal]
  2. Gaston H. Gonnet, J. Ian Munro, Hendra Suwanda
    Exegesis of Self-Organizing Linear Search. [Citation Graph (3, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:3, pp:613-637 [Journal]
  3. J. Ian Munro, Mike Paterson
    Selection and Sorting with Limited Storage. [Citation Graph (3, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:315-323 [Journal]
  4. David P. Dobkin, J. Ian Munro
    Efficient Uses of the Past [Citation Graph (2, 0)][DBLP]
    FOCS, 1980, pp:200-206 [Conf]
  5. J. Ian Munro
    Efficient Determination of the Transitive Closure of a Directed Graph. [Citation Graph (2, 0)][DBLP]
    Inf. Process. Lett., 1971, v:1, n:2, pp:56-58 [Journal]
  6. Gaston H. Gonnet, J. Ian Munro
    The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform. [Citation Graph (2, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:4, pp:451-470 [Journal]
  7. J. Ian Munro
    Searching a Two Key Table Under a Single Key [Citation Graph (1, 0)][DBLP]
    STOC, 1987, pp:383-387 [Conf]
  8. Gaston H. Gonnet, J. Ian Munro
    Heaps on Heaps. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:4, pp:964-971 [Journal]
  9. J. Ian Munro, Philip M. Spira
    Sorting and Searching in Multisets. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1976, v:5, n:1, pp:1-8 [Journal]
  10. David P. Dobkin, J. Ian Munro
    Determining the Mode. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:255-263 [Journal]
  11. B. John Oommen, E. R. Hansen, J. Ian Munro
    Deterministic Optimal and Expedient Move-to-Rear List Organizing Strategies. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:74, n:2, pp:183-197 [Journal]
  12. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    Experiments on Adaptive Set Intersections for Text Retrieval Systems. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:91-104 [Conf]
  13. J. Ian Munro, Mark H. Overmars, Derick Wood
    Variations on Visibility. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:291-299 [Conf]
  14. Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
    Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents. [Citation Graph (0, 0)][DBLP]
    CPM, 2006, pp:24-35 [Conf]
  15. Andrej Brodnik, J. Ian Munro
    Membership in Constant Time and Minimum Space. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:72-81 [Conf]
  16. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    Frequency Estimation of Internet Packet Streams with Limited Space. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:348-360 [Conf]
  17. Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro
    Cache-Oblivious Comparison-Based Algorithms on Multisets. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:305-316 [Conf]
  18. J. Ian Munro
    On the Competitiveness of Linear Search. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:338-345 [Conf]
  19. Patricio V. Poblete, J. Ian Munro, Thomas Papadakis
    The Binomial Transform and its Application to the Analysis of Skip Lists. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:554-569 [Conf]
  20. Patricio V. Poblete, Alfredo Viola, J. Ian Munro
    The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:94-105 [Conf]
  21. J. Ian Munro
    The Parallel Complexity of Arithmetic Computation. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:466-475 [Conf]
  22. J. Ian Munro, Pedro Celis
    Techniques for Collision Resolution in Hash Tables with Open Addressing. [Citation Graph (0, 0)][DBLP]
    FJCC, 1986, pp:601-610 [Conf]
  23. Brian Allen, J. Ian Munro
    Self-Organizing Binary Search Trees [Citation Graph (0, 0)][DBLP]
    FOCS, 1976, pp:166-172 [Conf]
  24. Pedro Celis, Per-Åke Larson, J. Ian Munro
    Robin Hood Hashing (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:281-288 [Conf]
  25. Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli
    Implicit B-Trees: New Results for the Dictionary Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:145-154 [Conf]
  26. Faith E. Fich, J. Ian Munro, Patricio V. Poblete
    Permuting [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:372-379 [Conf]
  27. Gaston H. Gonnet, J. Ian Munro, Hendra Suwanda
    Toward Self-Organizing Linear Search (Preliminary Draught) [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:169-174 [Conf]
  28. J. Ian Munro
    An Implicit Data Structure for the Dictionary Problem that Runs in Polylog Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:369-374 [Conf]
  29. J. Ian Munro, Mike Paterson
    Optimal Algorithms for Parallel Polynomial Evaluation [Citation Graph (0, 0)][DBLP]
    FOCS, 1971, pp:132-139 [Conf]
  30. J. Ian Munro, Mike Paterson
    Selection and Sorting with Limited Storage [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:253-258 [Conf]
  31. J. Ian Munro, Venkatesh Raman
    Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:118-126 [Conf]
  32. Erik D. Demaine, J. Ian Munro
    Fast Allocation and Deallocation with an Improved Buddy System. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:84-96 [Conf]
  33. J. Ian Munro
    Tables. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:37-42 [Conf]
  34. J. Ian Munro, Venkatesh Raman
    Fast Sorting In-Place Sorting with O(n) Data. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:266-277 [Conf]
  35. J. Ian Munro, Venkatesh Raman
    Selection from Read-Only Memory and Sorting with Optimum Data Movement. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:380-391 [Conf]
  36. J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
    Space Efficient Suffix Trees. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:186-196 [Conf]
  37. David P. Dobkin, J. Ian Munro
    Time and Space Bounds for Selection Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1978, pp:192-204 [Conf]
  38. Gaston H. Gonnet, J. Ian Munro
    Heaps on Heaps. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:282-291 [Conf]
  39. Torben Hagerup, Kurt Mehlhorn, J. Ian Munro
    Maintaining Discrete Probability Distributions Optimally. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:253-264 [Conf]
  40. Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders
    Towards Optimal Multiple Selection. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:103-114 [Conf]
  41. Rolf G. Karlsson, J. Ian Munro, Edward L. Robertson
    The Nearest Neighbor Problem on Bounded Domains. [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:318-327 [Conf]
  42. J. Ian Munro, Patricio V. Poblete
    Searchability in Merging and Implicit Data Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:527-535 [Conf]
  43. J. Ian Munro, S. Srinivasa Rao
    Succinct Representations of Functions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:1006-1015 [Conf]
  44. J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
    Succinct Representations of Permutations. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:345-356 [Conf]
  45. 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. [Citation Graph (0, 0)][DBLP]
    Internet Measurement Comference, 2003, pp:173-178 [Conf]
  46. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:47-59 [Conf]
  47. Arash Farzan, J. Ian Munro
    Succinct representation of finite abelian groups. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2006, pp:87-92 [Conf]
  48. Helmut Alt, Kurt Mehlhorn, J. Ian Munro
    Partial Match Retrieval in Implicit Data Structures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1981, pp:156-161 [Conf]
  49. J. Ian Munro
    Developing Implicit Data Structures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:168-176 [Conf]
  50. Nicholas J. A. Harvey, J. Ian Munro
    Brief announcement: deterministic skipnet. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:152- [Conf]
  51. J. Ian Munro, Patricio V. Poblete
    A Discipline for Robustness or Storage Reduction in Binary Search Trees. [Citation Graph (0, 3)][DBLP]
    PODS, 1983, pp:70-75 [Conf]
  52. Andrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro
    Worst case constant time priority queue. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:523-528 [Conf]
  53. David R. Clark, J. Ian Munro
    Efficient Suffix Trees on Secondary Storage (extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:383-391 [Conf]
  54. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    Adaptive set intersections, unions, and differences. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:743-752 [Conf]
  55. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    On universally easy classes for NP-complete problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:910-911 [Conf]
  56. Gianni Franceschini, J. Ian Munro
    Implicit dictionaries with O(1) modifications per update and fast search. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:404-413 [Conf]
  57. Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
    Rank/select operations on large alphabets: a tool for text indexing. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:368-373 [Conf]
  58. Meng He, J. Ian Munro, S. Srinivasa Rao
    A categorization theorem on suffix arrays with applications to space efficient text indexes. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:23-32 [Conf]
  59. J. Ian Munro, Thomas Papadakis, Robert Sedgewick
    Deterministic Skip Lists. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:367-375 [Conf]
  60. J. Ian Munro, Venkatesh Raman, Adam J. Storm
    Representing dynamic binary trees succinctly. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:529-536 [Conf]
  61. Rolf G. Karlsson, J. Ian Munro
    Proximity of a Grid. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:187-196 [Conf]
  62. Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro
    Cache-oblivious priority queue and graph algorithm applications. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:268-276 [Conf]
  63. Walter Cunto, J. Ian Munro
    Average Case Selection [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:369-375 [Conf]
  64. Gaston H. Gonnet, J. Ian Munro
    The Analysis of an Improved Hashing Technique [Citation Graph (0, 0)][DBLP]
    STOC, 1977, pp:113-121 [Conf]
  65. Gaston H. Gonnet, J. Ian Munro
    A Linear Probing Sort and its Analysis (Preliminary Draft) [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:90-95 [Conf]
  66. J. Ian Munro
    Some Results Concerning Efficient and Optimal Algorithms [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:40-44 [Conf]
  67. J. Ian Munro, Hendra Suwanda
    Implicit Data Structures (Preliminary Draft) [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:108-117 [Conf]
  68. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    Robot Localization without Depth Perception. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:249-259 [Conf]
  69. Andrej Brodnik, J. Ian Munro
    Neighbours on a Grid. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:309-320 [Conf]
  70. Svante Carlsson, J. Ian Munro, Patricio V. Poblete
    An Implicit Binomial Queue with Constant Insertion Time. [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:1-13 [Conf]
  71. Thomas Papadakis, J. Ian Munro, Patricio V. Poblete
    Analysis of the Expected Search Cost in Skip Lists. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:160-172 [Conf]
  72. Paul E. Kearney, J. Ian Munro, Derek Phillips
    Efficient Generation of Uniform Samples from Phylogenetic Trees. [Citation Graph (0, 0)][DBLP]
    WABI, 2003, pp:177-189 [Conf]
  73. David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman
    Representing Trees of Higer Degree. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:169-180 [Conf]
  74. Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick
    Resizable Arrays in Optimal Time and Space. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:37-48 [Conf]
  75. Andrej Brodnik, Peter Bro Miltersen, J. Ian Munro
    Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:426-439 [Conf]
  76. Walter Cunto, J. Ian Munro, Patricio V. Poblete
    A Case Study in Comparison Based Complexity: Finding the Nearest Value(s). [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:1-12 [Conf]
  77. J. Ian Munro, Venkatesh Raman
    Sorting with Minimum Data Movement (Preliminary Draft). [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:552-562 [Conf]
  78. J. Ian Munro, Venkatesh Raman
    Sorting Multisets and Vectors In-Place. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:473-480 [Conf]
  79. Gerth Stølting Brodal, Erik D. Demaine, J. Ian Munro
    Fast allocation and deallocation with an improved buddy system. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2005, v:41, n:4-5, pp:273-291 [Journal]
  80. Raúl J. Ramírez, Frank Wm. Tompa, J. Ian Munro
    Optimum Reorganization Points for Arbitrary Database Costs. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1982, v:18, n:, pp:17-30 [Journal]
  81. David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
    Representing Trees of Higher Degree. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:43, n:4, pp:275-292 [Journal]
  82. Joseph C. Culberson, J. Ian Munro
    Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1990, v:5, n:3, pp:295-311 [Journal]
  83. J. Ian Munro, Venkatesh Raman
    Fast Stable In-Place Sorting with O (n) Data Moves. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:2, pp:151-160 [Journal]
  84. J. Ian Munro, Patricio V. Poblete
    Searchability in Merging and Implicit Data Structures. [Citation Graph (0, 0)][DBLP]
    BIT, 1987, v:27, n:3, pp:324-329 [Journal]
  85. J. Ian Munro, Venkatesh Raman, Jeffrey S. Salowe
    Stable in Situ Sorting and Minimum Data Movement. [Citation Graph (0, 0)][DBLP]
    BIT, 1990, v:30, n:2, pp:220-234 [Journal]
  86. Thomas Papadakis, J. Ian Munro, Patricio V. Poblete
    Average Search and Update Costs in Skip Lists. [Citation Graph (0, 0)][DBLP]
    BIT, 1992, v:32, n:2, pp:316-332 [Journal]
  87. Joseph C. Culberson, J. Ian Munro
    Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1989, v:32, n:1, pp:68-75 [Journal]
  88. Prosenjit Bose, Anna Lubiw, J. Ian Munro
    Efficient visibility queries in simple polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:3, pp:313-335 [Journal]
  89. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro
    The Complexity of Clickomania [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  90. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  91. Gaston H. Gonnet, J. Ian Munro, Derick Wood
    Direct dynamic structures for some line segment problems. [Citation Graph (0, 0)][DBLP]
    Computer Vision, Graphics, and Image Processing, 1983, v:23, n:2, pp:178-186 [Journal]
  92. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:144, n:3, pp:231-236 [Journal]
  93. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Database Eng. Bull., 1982, v:5, n:1, pp:49-52 [Journal]
  94. J. Ian Munro
    Succinct Data Structures. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:91, n:, pp:3- [Journal]
  95. Walter Cunto, Gaston H. Gonnet, J. Ian Munro, Patricio V. Poblete
    Fringe Analysis for Extquick: An in Situ Distributive External Sorting Algorithm [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:92, n:2, pp:141-160 [Journal]
  96. J. Ian Munro, Patricio V. Poblete
    Fault Tolerance and Storage Reduction in Binary Search Trees [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:62, n:2/3, pp:210-218 [Journal]
  97. J. Ian Munro, Edward L. Robertson
    Continual Pattern Replication [Citation Graph (0, 0)][DBLP]
    Information and Control, 1981, v:48, n:3, pp:211-220 [Journal]
  98. 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. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:4, pp:283-296 [Journal]
  99. Helmut Alt, Kurt Mehlhorn, J. Ian Munro
    Partial Match Retrieval in Implicit Data Structures. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:2, pp:61-65 [Journal]
  100. Allan Borodin, J. Ian Munro
    Evaluating Polynomials at Many Points. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1971, v:1, n:2, pp:66-68 [Journal]
  101. Nicholas J. A. Harvey, J. Ian Munro
    Deterministic SkipNet. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:4, pp:205-208 [Journal]
  102. Walter Cunto, J. Ian Munro
    Average case selection. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:2, pp:270-279 [Journal]
  103. David P. Dobkin, J. Ian Munro
    Optimal Time Minimal Space Selection Algorithms. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:3, pp:454-461 [Journal]
  104. David P. Dobkin, J. Ian Munro
    Efficient Uses of the Past. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:4, pp:455-465 [Journal]
  105. J. Ian Munro, Venkatesh Raman
    Sorting with Minimum Data Movement. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:3, pp:374-393 [Journal]
  106. J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
    Space Efficient Suffix Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:39, n:2, pp:205-222 [Journal]
  107. Patricio V. Poblete, J. Ian Munro
    The Analysis of a Fringe Heuristic for Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:3, pp:336-350 [Journal]
  108. Patricio V. Poblete, J. Ian Munro
    Last-Come-First-Served Hashing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:2, pp:228-248 [Journal]
  109. 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. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:43, n:3, pp:406-424 [Journal]
  110. Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli
    Implicit B-trees: a new data structure for the dictionary problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:4, pp:788-807 [Journal]
  111. J. Ian Munro
    An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log² n) Time. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:33, n:1, pp:66-74 [Journal]
  112. J. Ian Munro, Allan Borodin
    Efficient Evaluation of Polynomial Forms. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1972, v:6, n:6, pp:625-638 [Journal]
  113. J. Ian Munro, Mike Paterson
    Optimal Algorithms for Parallel Polynomial Evaluation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1973, v:7, n:2, pp:189-198 [Journal]
  114. J. Ian Munro, Hendra Suwanda
    Implicit Data Structures for Fast Search and Update. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:21, n:2, pp:236-250 [Journal]
  115. Andrej Brodnik, Svante Carlsson, Michael L. Fredman, Johan Karlsson, J. Ian Munro
    Worst case constant time priority queue. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 2005, v:78, n:3, pp:249-256 [Journal]
  116. Patricio V. Poblete, Alfredo Viola, J. Ian Munro
    The Diagonal Poisson Transform and its application to the analysis of a hashing scheme. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:1-2, pp:221-255 [Journal]
  117. Andrej Brodnik, J. Ian Munro
    Membership in Constant Time and Almost-Minimum Space. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1627-1640 [Journal]
  118. Faith E. Fich, J. Ian Munro, Patricio V. Poblete
    Permuting in Place. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:266-278 [Journal]
  119. Gaston H. Gonnet, J. Ian Munro
    Efficient Ordering of Hash Tables. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:3, pp:463-478 [Journal]
  120. J. Ian Munro, Venkatesh Raman
    Succinct Representation of Balanced Parentheses and Static Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:762-776 [Journal]
  121. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:6, pp:1672-1695 [Journal]
  122. Walter Cunto, J. Ian Munro, Manuel Rey
    Selecting the Median and Two Quartiles in a Set of Numbers. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1992, v:22, n:6, pp:439-454 [Journal]
  123. W. Morven Gentleman, J. Ian Munro
    Designing Overlay Structures. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1977, v:7, n:4, pp:493-500 [Journal]
  124. Alejandro López-Ortiz, J. Ian Munro
    Foreword. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:4, pp:491- [Journal]
  125. Kyung-Yong Chwa, J. Ian Munro
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:363, n:1, pp:1- [Journal]
  126. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
    On universally easy classes for NP-complete problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:471-476 [Journal]
  127. J. Ian Munro, Venkatesh Raman
    Selection from Read-Only Memory and Sorting with Minimum Data Movement. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:165, n:2, pp:311-323 [Journal]
  128. Patricio V. Poblete, J. Ian Munro, Thomas Papadakis
    The binomial transform and the analysis of skip lists. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:352, n:1-3, pp:136-158 [Journal]
  129. Meng He, J. Ian Munro, S. Srinivasa Rao
    Succinct Ordinal Trees Based on Tree Covering. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:509-520 [Conf]
  130. Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao
    Succinct indexes for strings, binary relations and multi-labeled trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:680-689 [Conf]
  131. Andrej Brodnik, Johan Karlsson, J. Ian Munro, Andreas Nilsson
    An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  132. Reflections on Optimal and Nearly Optimal Binary Search Trees. [Citation Graph (, )][DBLP]


  133. Lower Bounds for Succinct Data Structures. [Citation Graph (, )][DBLP]


  134. List Update Algorithms for Data Compression. [Citation Graph (, )][DBLP]


  135. Succinct Representations of Arbitrary Graphs. [Citation Graph (, )][DBLP]


  136. Dynamic Succinct Ordered Trees. [Citation Graph (, )][DBLP]


  137. An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture. [Citation Graph (, )][DBLP]


  138. Integer Representation and Counting in the Bit Probe Model. [Citation Graph (, )][DBLP]


  139. Succinct Representation of Labeled Graphs. [Citation Graph (, )][DBLP]


  140. On the Relative Dominance of Paging Algorithms. [Citation Graph (, )][DBLP]


  141. Untangled Monotonic Chains and Adaptive Range Search. [Citation Graph (, )][DBLP]


  142. Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. [Citation Graph (, )][DBLP]


  143. An efficient algorithm for partial order production. [Citation Graph (, )][DBLP]


  144. Sorting under partial information (without the ellipsoid algorithm). [Citation Graph (, )][DBLP]


  145. A Uniform Approach Towards Succinct Representation of Trees. [Citation Graph (, )][DBLP]


  146. Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance. [Citation Graph (, )][DBLP]


  147. An Application of Self-organizing Data Structures to Compression. [Citation Graph (, )][DBLP]


  148. Integer Representation and Counting in the Bit Probe Model. [Citation Graph (, )][DBLP]


  149. A O(|V|*|E|) algorithm for maximum matching of graphs. [Citation Graph (, )][DBLP]


  150. An Efficient Algorithm for Partial Order Production [Citation Graph (, )][DBLP]


  151. Sorting under Partial Information (without the Ellipsoid Algorithm) [Citation Graph (, )][DBLP]


  152. Range Reporting for Moving Points on a Grid [Citation Graph (, )][DBLP]


  153. Succinct Representations of Dynamic Strings [Citation Graph (, )][DBLP]


  154. Sorting with networks of data structures. [Citation Graph (, )][DBLP]


Search in 0.039secs, Finished in 0.044secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002