• Publications
  • Influence
Succinct Representation of Balanced Parentheses and Static Trees
TLDR
We consider the implementation of abstract data types for the static objects: binary tree, rooted ordered tree, and a balanced sequence of parentheses. Expand
  • 318
  • 37
Representing Trees of Higher Degree
TLDR
This paper focuses on space efficient representations of rooted trees of higher degree that permit basic navigation in constant time. Expand
  • 251
  • 36
  • PDF
Frequency Estimation of Internet Packet Streams with Limited Space
TLDR
We present an algorithm that deterministically finds (in particular) all categories having a frequency above 1/(m+1) using m counters, which we prove is best possible in the worst case. Expand
  • 491
  • 32
  • PDF
Selection and Sorting with Limited Storage
TLDR
When selecting from, or sorting, a file stored on a read-only tape and the internal storage is rather limited, several passes of the input tape may be required. Expand
  • 248
  • 31
Rank/select operations on large alphabets: a tool for text indexing
TLDR
We consider a generalization of the problem of supporting rank and select queries on binary strings. Expand
  • 199
  • 30
  • PDF
Adaptive set intersections, unions, and differences
TLDR
We consider the problems of finding the intersection, union, or difference of a collection of sorted sets. Expand
  • 182
  • 20
Selection and sorting with limited storage
  • J. Munro, M. Paterson
  • Computer Science
  • 19th Annual Symposium on Foundations of Computer…
  • 16 October 1978
TLDR
When selecting from, or sorting, a file stored on a read-only tape and the internal storage is rather limited, several passes of the input tape may be required to select the Kth highest of N inputs. Expand
  • 239
  • 16
  • PDF
Self-organizing binary search trees
  • B. Allen, J. Munro
  • Computer Science
  • 17th Annual Symposium on Foundations of Computer…
  • 1 October 1978
TLDR
We consider heuristics which attempt to maintain a binary search tree in a near optimal form, assuming that elements are requested with fixed, but unknown, independent probabilities. Expand
  • 119
  • 16
Succinct representation of balanced parentheses, static trees and planar graphs
  • J. Munro, V. Raman
  • Mathematics, Computer Science
  • Proceedings 38th Annual Symposium on Foundations…
  • 19 October 1997
TLDR
We consider the implementation of abstract data types for the static objects: binary tree, rooted ordered tree and balanced parenthesis expression. Expand
  • 179
  • 12
The computational complexity of algebraic and numeric problems
TLDR
Thank you for downloading the computational complexity of algebraic and numeric problems elsevier computer science library theory of computation series 1, but end up in harmful downloads. Expand
  • 425
  • 11