| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro |
Succinct Representation of Labeled Graphs.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Arash Farzan, J. Ian Munro, Rajeev Raman |
Succinct Indices for Range Queries with applications to Orthogonal Range Maxima |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | J. Ian Munro, Patrick K. Nicholson |
Succinct Posets |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Arash Farzan, J. Ian Munro |
Succinct representation of dynamic trees. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Meng He, J. Ian Munro, Patrick K. Nicholson |
Dynamic Range Selection in Linear Space |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Meng He, J. Ian Munro, Patrick K. Nicholson |
Dynamic Range Majority Data Structures |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
Succinct Representations of Permutations and Functions |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala |
Range Majority in Constant Time and Linear Space. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Meng He, J. Ian Munro |
Space Efficient Data Structures for Dynamic Orthogonal Range Counting. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson |
Dynamic Range Majority Data Structures. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Meng He, J. Ian Munro, Gelin Zhou |
Path Queries in Weighted Trees. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Meng He, J. Ian Munro, Patrick K. Nicholson |
Dynamic Range Selection in Linear Space. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Travis Gagie, Meng He, J. Ian Munro, Patrick K. Nicholson |
Finding Frequent Elements in Compressed 2D Arrays and Strings. |
SPIRE |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kamran Tirdad, Pedram Ghodsnia, J. Ian Munro, Alejandro López-Ortiz |
COCA Filters: Co-occurrence Aware Bloom Filters. |
SPIRE |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Ziaur Rahman, J. Ian Munro |
Integer Representation and Counting in the Bit Probe Model. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Karpinski, J. Ian Munro, Yakov Nekrich |
Range Reporting for Moving Points on a Grid |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Meng He, J. Ian Munro |
Succinct Representations of Dynamic Strings |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro |
An Efficient Algorithm for Partial Order Production. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Francisco Claude, J. Ian Munro, Patrick K. Nicholson |
Range Queries over Untangled Chains. |
SPIRE |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Meng He, J. Ian Munro |
Succinct Representations of Dynamic Strings. |
SPIRE |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro |
Sorting under partial information (without the ellipsoid algorithm). |
STOC |
2010 |
DBLP DOI BibTeX RDF |
graph entropy, partial order |
| 1 | Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro |
On the relative dominance of paging algorithms. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphael M. Jungers, J. Ian Munro |
Sorting under Partial Information (without the Ellipsoid Algorithm) |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | J. Ian Munro, Dorothea Wagner |
Preface. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Arash Farzan, J. Ian Munro |
Dynamic Succinct Ordered Trees. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro |
An Application of Self-organizing Data Structures to Compression. |
SEA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro |
Reflections on Optimal and Nearly Optimal Binary Search Trees. |
Efficient Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphael M. Jungers, J. Ian Munro |
An efficient algorithm for partial order production. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
graph entropy, partial order |
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphael M. Jungers, J. Ian Munro |
An Efficient Algorithm for Partial Order Production |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Jérémy Barbay, J. Ian Munro |
Succinct Encoding of Permutations: Applications to Text Indexing. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Arash Farzan, J. Ian Munro |
Succinct Representations of Arbitrary Graphs. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Dorothea Wagner (eds.) |
Proceedings of the Workshop on Algorithm Engineering and Experiments, ALENEX 2008, San Francisco, California, USA, January 19, 2008 |
ALENEX |
2008 |
DBLP BibTeX RDF |
|
| 1 | Arash Farzan, J. Ian Munro |
A Uniform Approach Towards Succinct Representation of Trees. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro |
Lower Bounds for Succinct Data Structures. |
CPM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro |
List Update Algorithms for Data Compression. |
DCC |
2008 |
DBLP DOI BibTeX RDF |
List Update Algorithms, Data Compression, Burrows-Wheeler Transform |
| 1 | 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. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao |
Succinct indexes for strings, binary relations and multi-labeled trees. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Meng He, J. Ian Munro, S. Srinivasa Rao |
Succinct Ordinal Trees Based on Tree Covering. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Ziaur Rahman, J. Ian Munro |
Integer Representation and Counting in the Bit Probe Model. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
bit probe model, data structure, lower bound, Gray code |
| 1 | Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro |
Succinct Representation of Labeled Graphs. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro |
On the Relative Dominance of Paging Algorithms. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kyung-Yong Chwa, J. Ian Munro |
Preface. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricio V. Poblete, J. Ian Munro, Thomas Papadakis |
The binomial transform and the analysis of skip lists. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alejandro López-Ortiz, J. Ian Munro |
Foreword. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Brodnik, Johan Karlsson, J. Ian Munro, Andreas Nilsson |
An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Alexander Golynski, J. Ian Munro, S. Srinivasa Rao |
Rank/select operations on large alphabets: a tool for text indexing. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianni Franceschini, J. Ian Munro |
Implicit dictionaries with O(1) modifications per update and fast search. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
intersection problem, multi-labeled trees, conjunctive queries, succinct data structures, labeled trees |
| 1 | Arash Farzan, J. Ian Munro |
Succinct representation of finite abelian groups. |
ISSAC |
2006 |
DBLP DOI BibTeX RDF |
space-efficient representation, finite group, succinct data structure, abelian group |
| 1 | Gerth Stølting Brodal, Erik D. Demaine, J. Ian Munro |
Fast allocation and deallocation with an improved buddy system. |
Acta Inf. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
Representing Trees of Higher Degree. |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
Cardinal trees, Ordinal trees, Digital search trees, Data structures, Data compression, Information theory, Hashing, Analysis of algorithms, Dictionary, Tries, Succinct data structures |
| 1 | Andrej Brodnik, Svante Carlsson, Michael L. Fredman, Johan Karlsson, J. Ian Munro |
Worst case constant time priority queue. |
Journal of Systems and Software |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro |
Cache-Oblivious Comparison-Based Algorithms on Multisets. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Meng He, J. Ian Munro, S. Srinivasa Rao |
A categorization theorem on suffix arrays with applications to space efficient text indexes. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders |
Towards Optimal Multiple Selection. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey, J. Ian Munro |
Deterministic SkipNet. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro |
Succinct Data Structures. |
Electr. Notes Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli |
Implicit B-trees: a new data structure for the dictionary problem. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro (eds.) |
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004 |
SODA |
2004 |
DBLP BibTeX RDF |
|
| 1 | J. Ian Munro, S. Srinivasa Rao |
Succinct Representations of Functions. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Kyung-Yong Chwa, J. Ian Munro (eds.) |
Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings |
COCOON |
2004 |
DBLP BibTeX RDF |
|
| 1 | Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro |
On universally easy classes for NP-complete problems. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
Succinct Representations of Permutations. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul E. Kearney, J. Ian Munro, Derek Phillips |
Efficient Generation of Uniform Samples from Phylogenetic Trees. |
WABI |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey, J. Ian Munro |
Brief announcement: deterministic skipnet. |
PODC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
frequent item queries, internet traffic monitoring, on-line stream analysis, sliding windows |
| 1 | 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 |
2002 |
DBLP BibTeX RDF |
|
| 1 | Prosenjit Bose, Anna Lubiw, J. Ian Munro |
Efficient visibility queries in simple polygons. |
Comput. Geom. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro |
Frequency Estimation of Internet Packet Streams with Limited Space. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro |
Robot Localization without Depth Perception. |
SWAT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli |
Implicit B-Trees: New Results for the Dictionary Problem. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro |
Cache-oblivious priority queue and graph algorithm applications. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao |
Space Efficient Suffix Trees. |
J. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro |
The Complexity of Clickomania |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | J. Ian Munro, Venkatesh Raman |
Succinct Representation of Balanced Parentheses and Static Trees. |
SIAM J. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro |
Worst case constant time priority queue. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro |
On universally easy classes for NP-complete problems. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Venkatesh Raman, Adam J. Storm |
Representing dynamic binary trees succinctly. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro |
Experiments on Adaptive Set Intersections for Text Retrieval Systems. |
ALENEX |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro |
On the Competitiveness of Linear Search. |
ESA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro |
Adaptive set intersections, unions, and differences. |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Brodnik, J. Ian Munro |
Membership in Constant Time and Almost-Minimum Space. |
SIAM J. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick |
Resizable Arrays in Optimal Time and Space. |
WADS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman |
Representing Trees of Higer Degree. |
WADS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, J. Ian Munro |
Fast Allocation and Deallocation with an Improved Buddy System. |
FSTTCS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao |
Space Efficient Suffix Trees. |
FSTTCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1997 |
DBLP BibTeX RDF |
|
| 1 | Andrej Brodnik, Peter Bro Miltersen, J. Ian Munro |
Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds. |
WADS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Venkatesh Raman |
Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
balanced parentheses, static trees, rooted ordered tree, planar graphs, abstract data types, abstract data types, binary tree, adjacency, succinct representation |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")