• Publications
  • Influence
A Reliable Randomized Algorithm for the Closest-Pair Problem
TLDR
In 1976, Rabin described a randomized algorithm for the closest-pair problem that takes linear expected time. Expand
  • 202
  • 12
  • PDF
In-Place Calculation of Minimum-Redundancy Codes
TLDR
The optimal prefixfree code problem is to determine, for a given array p=[p i ¦i∈{1...n}] of weights, an integer array l of codeword lengths such that \(\sum\nolimits_{i = 1}^n {2^{ - l_i } \leqslant 1}\)is minmized. Expand
  • 70
  • 8
  • PDF
Comparison of algorithms for standard median filtering
TLDR
Standard median filtering that is searched repeatedly for a median from a sample set which changes only slightly between the subsequent searches is discussed. Expand
  • 56
  • 5
Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth
TLDR
We show that if a flow network haskinput/output terminals (for the traditional maximum-flow problem,k=2), its external flow pattern (the possible values of flow into and out of the terminals) has two characterizations of size independent of the total number of vertices: a set of 2k+1 inequalities inkvariables representing flow values at the terminals, and a mimicking network with at most 22kvertices and the same external flowpattern as the original network. Expand
  • 49
  • 5
Practical In-Place Mergesort
TLDR
Two in-place variants of the classical mergesort algorithm are analysed in detail. Expand
  • 65
  • 4
Asymptotically efficient in-place merging
Two linear-time algorithms for in-place/ merging are presented. Both algorithms perform at most m(t+1)+n/2t+o(m) comparisons, where m and n are the sizes of the input sequences, m⩽n, andExpand
  • 34
  • 4
Heaps and Heapsort on Secondary Storage
TLDR
A heap structure designed for secondary storage is suggested that tries to make the best use of the available buffer space in primary memory. Expand
  • 45
  • 4
  • PDF
In-Place Sorting with Fewer Moves
TLDR
It is shown that an array of n elements can be sorted using O(1) extra space, O(nlogn/loglogn) element moves, and nlog2n+O(nlogLogn) comparisons, but due to the constant factors involved the algorithm is predominantly of theoretical interest. Expand
  • 29
  • 4
Branch Mispredictions Don't Affect Mergesort
TLDR
In quicksort, due to branch mispredictions, a skewed pivot-selection strategy can lead to a better performance than the exact-median pivot- selection strategy, even if the exact median is given for free. Expand
  • 19
  • 4
  • PDF
Characterizations of k-terminal flow networks and computing network flows in partial k-trees
TLDR
We show that if a flow network has k input/output terminals (for the traditional maximum-flow problem, k = 2), its external flow pattern has two characterizations of size independent of the total number of vertices: a set of at most 2” inequalities in k variables representing flow values at the terminals, and a mimicking network with at most 22k vertices and the same external flowpattern as the original network. Expand
  • 15
  • 4