E. McCreight

Publications17
h-index12
Citations4,329
Highly Influential Citations327
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • A. Meyer
  • 153 Publications • 7,737 Citations
  • D. Knuth
  • 430 Publications • 69,280 Citations
  • D. Patterson
  • 411 Publications • 68,787 Citations
  • T. Gross
  • 335 Publications • 11,046 Citations
  • Publications
  • Influence
A Space-Economical Suffix Tree Construction Algorithm
A new algorithm is presented for constructing auxiliary digital search trees to aid in exact-match substring searching. This algorithm has the same asymptotic running time bound as previously…
Organization and maintenance of large ordered indexes
TLDR
The index organization described allows retrieval, insertion, and deletion of keys in time proportional to logkI where I is the size of the index and k is a device dependent natural number such that the performance of the scheme becomes near optimal.
Organization and maintenance of large ordered indices
TLDR
The index organization described allows retrieval, insertion, and deletion of keys in time proportional to logk I where I is the size of the index and k is a device dependent natural number such that the performance of the scheme becomes near optimal.
Priority Search Trees
TLDR
A new data structure that is called a priority search tree, of which two variants are introduced, operations (1), (2), and (3) can be implemented in $O(\log n)$ time, where n is the cardinality of D.
Classes of computable functions defined by bounds on computation: Preliminary Report
The structure of the functions computable in time or space bounded by t is investigated for recursive functions t. The t-computable classes are shown to be closed under increasing recursively…
A new representation for linear lists
TLDR
A key idea is the construction of a number representation behaving as described above, which can be used to model the propagation of modifications in the B-tree along the finger path, with the advantage that access is cheap in the neighborhood of each finger.
COMPUTATIONALLY COMPLEX AND PSEUDO-RANDOM ZERO-ONE VALUED FUNCTIONS††Portions of this work were carried out at Carngie-Mellon University, while the authors were in the Department of Computer Science.…
Pagination of B*-trees with variable-length records
TLDR
A strategy is presented for pagination of B*-trees with variable-length records that results in shallow trees with fast access times and the performance of this strategy in an application is presented, compared with that of another strategy, and analyzed.
Organization and Maintenance of Large Ordered Indexes (Reprint)
PROPERTIES OF BOUNDS ON COMPUTATION
TLDR
The main result illustrates a property of running times similar in interpretation to Borodin's gap theorem, based on the construction of difficult to compute characteristic functions which take the value one very infrequently.
...
1
2
...