• Corpus ID: 5451516

The Art of Computer Programming, Volume III: Sorting and Searching

  title={The Art of Computer Programming, Volume III: Sorting and Searching},
  author={Donald Ervin Knuth},
  • D. Knuth
  • Published 24 April 1998
  • Computer Science
A Detailed Analysis of Quicksort Running Time
This work finds explicit expressions for the first eight moments, their scaled limits, and describes how to compute, approximately (but very accurately), percentiles of running time for any list-length.
Optimal-depth sorting networks
SAT and CP - Parallelisation and Applications
This thesis considers the parallelisation and application of SAT and CP solvers, and considers the question how many parallel sorting steps are needed to sort some inputs, and presents both lower and upper bounds for several cases.
D ec 2 01 4 Optimal-Depth Sorting Networks ∗
This article presents a general technique for obtaining optimality results, and uses it to prove the optimality of the remaining open cases of 11 ≤ n ≤ 16 inputs, and shows that the sorting networks listed by Knuth are optimal.
Optimal Sorting Networks
This paper gives general combinatorial arguments showing that if a sorting network with a given depth exists then there exists one with a special form, and constructs propositional formulas whose satisfiability is necessary for the existence of such a network.
The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes
An improved notion of symmetry is provided and a novel technique based on regular languages and graph isomorphism is shown to generate the set of non-symmetric representations that outperforms the naive generate-and-test approach by orders of magnitude and easily scales until n = 40.
Resolução da Heterogeneidade na Identificação de Pacientes (Resolution of Heterogeneity in the Identification of Patients) [in Portuguese]
The QFS measure is developed, which takes in consideration the statistical distribution of names and cultural factors and shows that QFSmeasure is superior to several existing methods for matching names.
Balanced binary trees in the Tamari lattice
It is shown that the set of balanced binary trees is closed by interval in the Tamari lattice and the intervals (T0;T1) where T0 and T1 are balanced trees are isomorphic as posets to a hypercube.
Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering
It turns out that small design decisions in how deletions are implemented have dramatic effects on the asymptotic performance of insertions, and a new variant of linear probing is presented, which is called graveyard hashing, that completely eliminates primary clustering on any sequence of operations.
Entropies and their Asymptotic Theory in the discrete case
We present some new nonparametric estimators of entropies and we establish almost sure consistency and central limit Theorems for some of the most important entropies in the discrete case. Our