J. Ian Munro

According to our database1, J. Ian Munro
  • authored at least 246 papers between 1971 and 2017.
  • has a "Dijkstra number"2 of four.

Awards

ACM Fellow

ACM Fellow 2008, "For contributions to algorithms and data structures.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Top-k Term-Proximity in Succinct Space.
Algorithmica, 2017

Succinct Indices for Path Minimum, with Applications.
Algorithmica, 2017

Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Compressed Representations of Graphs.
Encyclopedia of Algorithms, 2016

Fast construction of wavelet trees.
Theor. Comput. Sci., 2016

Document retrieval with one wildcard.
Theor. Comput. Sci., 2016

Dynamic range majority data structures.
Theor. Comput. Sci., 2016

Permuted scaled matching.
Theor. Comput. Sci., 2016

Data Structures for Path Queries.
ACM Trans. Algorithms, 2016

Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time.
CoRR, 2016

Range Majorities and Minorities in Arrays.
CoRR, 2016

Succinct Posets.
Algorithmica, 2016

Succinct Data Structures ... Potential for Symbolic Computation?
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Raising Permutations to Powers in Place.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015
On hardness of several string indexing problems.
Theor. Comput. Sci., 2015

Low space data structures for geometric range mode query.
Theor. Comput. Sci., 2015

Finding median in read-only memory on integer input.
Theor. Comput. Sci., 2015

Dynamic Data Structures for Document Collections and Graphs.
CoRR, 2015

Compressed Data Structures for Dynamic Sequences.
CoRR, 2015

Optimal search trees with equality tests.
CoRR, 2015

Sorting and Selection with Equality Comparisons.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Dynamic Data Structures for Document Collections and Graphs.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

On the Succinct Representation of Unlabeled Permutations.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Optimal Search Trees with 2-Way Comparisons.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Compressed Data Structures for Dynamic Sequences.
Proceedings of the Algorithms - ESA 2015, 2015

Range Counting with Distinct Constraints.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
Less space: Indexing for queries with wildcards.
Theor. Comput. Sci., 2014

The Hausdorff Core Problem on Simple Polygons.
JoCG, 2014

Space efficient data structures for dynamic orthogonal range counting.
Comput. Geom., 2014

A Framework for Succinct Labeled Ordinal Trees over Large Alphabets.
Algorithmica, 2014

A Uniform Paradigm to Succinctly Encode Various Families of Trees.
Algorithmica, 2014

In as Few Comparisons as Possible.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Ranked Document Selection.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

Fast Construction of Wavelet Trees.
Proceedings of the String Processing and Information Retrieval, 2014

Selection and Sorting in the "Restore" Model.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Document Retrieval with One Wildcard.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Top- k Term-Proximity in Succinct Space.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Dynamic Path Counting and Reporting in Linear Space.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Improved Explicit Data Structures in the Bitprobe Model.
Proceedings of the Algorithms - ESA 2014, 2014

Succinct Indices for Path Minimum, with Applications to Path Reporting.
Proceedings of the Algorithms - ESA 2014, 2014

On Hardness of Several String Indexing Problems.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

Permuted Scaled Matching.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

Low Space Data Structures for Geometric Range Mode Query.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Multi-Pivot Quicksort: Theory and Experiments.
Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

2013
Succinct encoding of arbitrary graphs.
Theor. Comput. Sci., 2013

A novel approach for leveraging co-occurrence to improve the false positive error in signature files.
J. Discrete Algorithms, 2013

Range majority in constant time and linear space.
Inf. Comput., 2013

Succinct data structures for representing equivalence classes.
CoRR, 2013

Sorting under partial information (without the ellipsoid algorithm).
Combinatorica, 2013

Document Listing on Versioned Documents.
Proceedings of the String Processing and Information Retrieval, 2013

Adaptive Data Structures for Permutations and Binary Relations.
Proceedings of the String Processing and Information Retrieval, 2013

Less Space: Indexing for Queries with Wildcards.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Succinct Data Structures for Representing Equivalence Classes.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

The Distance 4-Sector of Two Points Is Unique.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012
Succinct representations of permutations and functions.
Theor. Comput. Sci., 2012

Succinct ordinal trees based on tree covering.
ACM Trans. Algorithms, 2012

Succinct Indices for Range Queries with applications to Orthogonal Range Maxima
CoRR, 2012

Succinct Posets
CoRR, 2012

Succinct Representation of Labeled Graphs.
Algorithmica, 2012

A Framework for Succinct Labeled Ordinal Trees over Large Alphabets.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Succinct Posets.
Proceedings of the Algorithms - ESA 2012, 2012

Succinct Data Structures for Path Queries.
Proceedings of the Algorithms - ESA 2012, 2012

The Complexity of Partial Orders.
Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, 2012

The Complexity of Partial Orders.
Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

2011
Succinct representation of dynamic trees.
Theor. Comput. Sci., 2011

Untangled monotonic chains and adaptive range search.
Theor. Comput. Sci., 2011

Succinct indexes for strings, binary relations and multilabeled trees.
ACM Trans. Algorithms, 2011

Succinct Representations of Permutations and Functions
CoRR, 2011

Dynamic Range Selection in Linear Space
CoRR, 2011

Dynamic Range Majority Data Structures
CoRR, 2011

Space Efficient Data Structures for Dynamic Orthogonal Range Counting.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

COCA Filters: Co-occurrence Aware Bloom Filters.
Proceedings of the String Processing and Information Retrieval, 2011

Finding Frequent Elements in Compressed 2D Arrays and Strings.
Proceedings of the String Processing and Information Retrieval, 2011

Path Queries in Weighted Trees.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Dynamic Range Selection in Linear Space.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Dynamic Range Majority Data Structures.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Range Majority in Constant Time and Linear Space.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
An Efficient Algorithm for Partial Order Production.
SIAM J. Comput., 2010

Sorting with networks of data structures.
Discrete Applied Mathematics, 2010

Succinct Representations of Dynamic Strings
CoRR, 2010

Range Reporting for Moving Points on a Grid
CoRR, 2010

Integer Representation and Counting in the Bit Probe Model.
Algorithmica, 2010

Sorting under partial information (without the ellipsoid algorithm).
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Succinct Representations of Dynamic Strings.
Proceedings of the String Processing and Information Retrieval, 2010

Range Queries over Untangled Chains.
Proceedings of the String Processing and Information Retrieval, 2010

Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
On the relative dominance of paging algorithms.
Theor. Comput. Sci., 2009

Preface.
ACM Journal of Experimental Algorithmics, 2009

Sorting under Partial Information (without the Ellipsoid Algorithm)
CoRR, 2009

An Application of Self-organizing Data Structures to Compression.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

An efficient algorithm for partial order production.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Untangled Monotonic Chains and Adaptive Range Search.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Dynamic Succinct Ordered Trees.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Reflections on Optimal and Nearly Optimal Binary Search Trees.
Proceedings of the Efficient Algorithms, 2009

2008
Succinct Encoding of Permutations: Applications to Text Indexing.
Proceedings of the Encyclopedia of Algorithms, 2008

An Efficient Algorithm for Partial Order Production
CoRR, 2008

A Uniform Approach Towards Succinct Representation of Trees.
Proceedings of the Algorithm Theory, 2008

Succinct Representations of Arbitrary Graphs.
Proceedings of the Algorithms, 2008

List Update Algorithms for Data Compression.
Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Lower Bounds for Succinct Data Structures.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007
Adaptive searching in succinctly encoded binary relations and tree-structured documents.
Theor. Comput. Sci., 2007

An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms.
SIAM J. Comput., 2007

Succinct indexes for strings, binary relations and multi-labeled trees.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Integer Representation and Counting in the Bit Probe Model.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

On the Relative Dominance of Paging Algorithms.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Succinct Representation of Labeled Graphs.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Succinct Ordinal Trees Based on Tree Covering.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006
The binomial transform and the analysis of skip lists.
Theor. Comput. Sci., 2006

Preface.
Theor. Comput. Sci., 2006

Foreword.
ACM Trans. Algorithms, 2006

Structure, Scoring and Purpose of Computing Competitions.
Informatics in Education, 2006

An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture
CoRR, 2006

Rank/select operations on large alphabets: a tool for text indexing.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Implicit dictionaries with O(1) modifications per update and fast search.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Succinct representation of finite abelian groups.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005
Worst case constant time priority queue.
Journal of Systems and Software, 2005

Representing Trees of Higher Degree.
Algorithmica, 2005

Fast allocation and deallocation with an improved buddy system.
Acta Inf., 2005

A categorization theorem on suffix arrays with applications to space efficient text indexes.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Towards Optimal Multiple Selection.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Cache-Oblivious Comparison-Based Algorithms on Multisets.
Proceedings of the Algorithms, 2005

2004
Succinct Representation of Data Structures.
Proceedings of the Handbook of Data Structures and Applications., 2004

Implicit B-trees: a new data structure for the dictionary problem.
J. Comput. Syst. Sci., 2004

Deterministic SkipNet.
Inf. Process. Lett., 2004

Succinct Data Structures.
Electr. Notes Theor. Comput. Sci., 2004

Fun-Sort--or the chaos of unordered binary search.
Discrete Applied Mathematics, 2004

Succinct Representations of Functions.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
On universally easy classes for NP-complete problems.
Theor. Comput. Sci., 2003

Efficient Generation of Uniform Samples from Phylogenetic Trees.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

Brief announcement: deterministic skipnet.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Identifying frequent items in sliding windows over on-line packet streams.
Proceedings of the 3rd ACM SIGCOMM Internet Measurement Conference, 2003

Succinct Representations of Permutations.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Online Routing in Convex Subdivisions.
Int. J. Comput. Geometry Appl., 2002

Efficient Tree Layout in a Multilevel Memory Hierarchy
CoRR, 2002

Efficient visibility queries in simple polygons.
Comput. Geom., 2002

Robot Localization without Depth Perception.
Proceedings of the Algorithm Theory, 2002

Cache-oblivious priority queue and graph algorithm applications.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Implicit B-Trees: New Results for the Dictionary Problem.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Frequency Estimation of Internet Packet Streams with Limited Space.
Proceedings of the Algorithms, 2002

2001
Succinct Representation of Balanced Parentheses and Static Trees.
SIAM J. Comput., 2001

Space Efficient Suffix Trees.
J. Algorithms, 2001

The Complexity of Clickomania
CoRR, 2001

Representing dynamic binary trees succinctly.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

On universally easy classes for NP-complete problems.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Worst case constant time priority queue.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Experiments on Adaptive Set Intersections for Text Retrieval Systems.
Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000
Adaptive set intersections, unions, and differences.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Online Routing in Convex Subdivisions.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

On the Competitiveness of Linear Search.
Proceedings of the Algorithms, 2000

1999
Membership in Constant Time and Almost-Minimum Space.
SIAM J. Comput., 1999

Resizable Arrays in Optimal Time and Space.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Representing Trees of Higer Degree.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Fast Allocation and Deallocation with an Improved Buddy System.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1998
Space Efficient Suffix Trees.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1997
The Diagonal Poisson Transform and its application to the analysis of a hashing scheme.
Random Struct. Algorithms, 1997

Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996
Selection from Read-Only Memory and Sorting with Minimum Data Movement.
Theor. Comput. Sci., 1996

Fast Stable In-Place Sorting with O (n) Data Moves.
Algorithmica, 1996

Neighbours on a Grid.
Proceedings of the Algorithm Theory, 1996

Efficient Suffix Trees on Secondary Storage (extended Abstract).
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Tables.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

1995
Permuting in Place.
SIAM J. Comput., 1995

The Binomial Transform and its Application to the Analysis of Skip Lists.
Proceedings of the Algorithms, 1995

1994
The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract).
Proceedings of the Algorithms, 1994

Membership in Constant Time and Minimum Space.
Proceedings of the Algorithms, 1994

1993
Maintaining Discrete Probability Distributions Optimally.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992
Selecting the Median and Two Quartiles in a Set of Numbers.
Softw., Pract. Exper., 1992

Sorting with Minimum Data Movement.
J. Algorithms, 1992

Average Search and Update Costs in Skip Lists.
BIT, 1992

Deterministic Skip Lists.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Selection from Read-Only Memory and Sorting with Optimum Data Movement.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

1991
Fringe Analysis for Extquick: An in Situ Distributive External Sorting Algorithm
Inf. Comput., June, 1991

An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time.
J. Comput. Syst. Sci., 1991

Sorting Multisets and Vectors In-Place.
Proceedings of the Algorithms and Data Structures, 1991

A Case Study in Comparison Based Complexity: Finding the Nearest Value(s).
Proceedings of the Algorithms and Data Structures, 1991

Fast Sorting In-Place Sorting with O(n) Data.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1990
Deterministic Optimal and Expedient Move-to-Rear List Organizing Strategies.
Theor. Comput. Sci., 1990

Stable in Situ Sorting and Minimum Data Movement.
BIT, 1990

Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees.
Algorithmica, 1990

Analysis of the Expected Search Cost in Skip Lists.
Proceedings of the SWAT 90, 1990

Permuting
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
Last-Come-First-Served Hashing.
J. Algorithms, 1989

Average case selection.
J. ACM, 1989

Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations.
Comput. J., 1989

Sorting with Minimum Data Movement (Preliminary Draft).
Proceedings of the Algorithms and Data Structures, 1989

1988
An Implicit Binomial Queue with Constant Insertion Time.
Proceedings of the SWAT 88, 1988

1987
Searchability in Merging and Implicit Data Structures.
BIT, 1987

Searching a Two Key Table Under a Single Key
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Variations on Visibility.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986
Heaps on Heaps.
SIAM J. Comput., 1986

An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log² n) Time.
J. Comput. Syst. Sci., 1986

Developing Implicit Data Structures.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

Techniques for Collision Resolution in Hash Tables with Open Addressing.
Proceedings of the Fall Joint Computer Conference, November 2-6, 1986, Dallas, Texas, USA, 1986

1985
The Analysis of a Fringe Heuristic for Binary Search Trees.
J. Algorithms, 1985

Efficient Uses of the Past.
J. Algorithms, 1985

Proximity of a Grid.
Proceedings of the STACS 85, 1985

The Nearest Neighbor Problem on Bounded Domains.
Proceedings of the Automata, 1985

Robin Hood Hashing (Preliminary Report)
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984
The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform.
J. Algorithms, 1984

Partial Match Retrieval in Implicit Data Structures.
Inf. Process. Lett., 1984

Fault Tolerance and Storage Reduction in Binary Search Trees
Information and Control, 1984

Average Case Selection
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

An Implicit Data Structure for the Dictionary Problem that Runs in Polylog Time
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983
Direct dynamic structures for some line segment problems.
Computer Vision, Graphics, and Image Processing, 1983

A Discipline for Robustness or Storage Reduction in Binary Search Trees.
Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1983

Searchability in Merging and Implicit Data Structures.
Proceedings of the Automata, 1983

1982
Technical Note - Reducing Space Requirements for Shortest Path Problems.
Operations Research, 1982

Database Storage Structures Research at the University of Waterloo.
IEEE Database Eng. Bull., 1982

Optimum Reorganization Points for Arbitrary Database Costs.
Acta Inf., 1982

Heaps on Heaps.
Proceedings of the Automata, 1982

1981
Continual Pattern Replication
Information and Control, March, 1981

Exegesis of Self-Organizing Linear Search.
SIAM J. Comput., 1981

Optimal Time Minimal Space Selection Algorithms.
J. ACM, 1981

A Linear Probing Sort and its Analysis (Preliminary Draft)
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

Partial Match Retrieval in Implicit Data Structures.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980
Selection and Sorting with Limited Storage.
Theor. Comput. Sci., 1980

Determining the Mode.
Theor. Comput. Sci., 1980

Implicit Data Structures for Fast Search and Update.
J. Comput. Syst. Sci., 1980

Efficient Uses of the Past
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979
Efficient Ordering of Hash Tables.
SIAM J. Comput., 1979

Implicit Data Structures (Preliminary Draft)
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

Toward Self-Organizing Linear Search (Preliminary Draught)
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978
Self-Organizing Binary Search Trees.
J. ACM, 1978

Time and Space Bounds for Selection Problems.
Proceedings of the Automata, 1978

Selection and Sorting with Limited Storage
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1977
Designing Overlay Structures.
Softw., Pract. Exper., 1977

The Analysis of an Improved Hashing Technique
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

The Parallel Complexity of Arithmetic Computation.
FCT, 1977

1976
Sorting and Searching in Multisets.
SIAM J. Comput., 1976

Self-Organizing Binary Search Trees
Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1975
The computational complexity of algebraic and numeric problems.
Elsevier computer science library 1, Elsevier, ISBN: 0444001565, 1975

1974
A O(|V|*|E|) algorithm for maximum matching of graphs.
Computing, 1974

1973
Optimal Algorithms for Parallel Polynomial Evaluation.
J. Comput. Syst. Sci., 1973

In search of the fastest algorithm.
Proceedings of the American Federation of Information Processing Societies: 1973 National Computer Conference, 1973

1972
Efficient Evaluation of Polynomial Forms.
J. Comput. Syst. Sci., 1972

1971
Efficient Determination of the Transitive Closure of a Directed Graph.
Inf. Process. Lett., 1971

Evaluating Polynomials at Many Points.
Inf. Process. Lett., 1971

Some Results Concerning Efficient and Optimal Algorithms
Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971

Optimal Algorithms for Parallel Polynomial Evaluation
Proceedings of the 12th Annual Symposium on Switching and Automata Theory, 1971


  Loading...