Abstract:
Sorting problems have long been one of the foundations of theoretical computer science. Sorting problems attempt to learn properties of an unknown total order of a known set. We test the order by comparing pairs of elements, and through repeated tests deduce some order structure on the set. The set-maxima problem is: given a family S of subsets of a set X, produce the maximal element of each element of S. Local sorting is a sub-problem of set-maxima, when S ` i
Citations
|
2005
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
1446
|
The art of Computer Programming
– Knuth
- 1981
|
|
21
|
Linear verification for spanning trees
– Komlós
- 1985
|
|
20
|
Some simple inequalities satisfied by convex functions
– Hardy, Littlewood, et al.
- 1929
|
|
15
|
Information bounds are weak in the shortest distance problem
– Graham, Yao, et al.
- 1980
|
|
13
|
Optimal randomized algorithms for local sorting and set-maxima
– Goddard, Kenyon, et al.
- 1993
|
|
9
|
Combinatorics of Finite Geometries
– Batten
- 1986
|
|
7
|
A linear time approach to the set maxima problem
– Bar-Noy, Motwani, et al.
- 1992
|
|
7
|
Tarjan, "Verification and sensitivity analysis of minimum spanning trees in linear time
– Dixon, Rauch, et al.
- 1992
|
|
5
|
A linear time algorithm for the lowest common ancestors problem (extended abstract
– Harel
- 1980
|
|
5
|
The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem
– Manber, Tompa
- 1984
|
|
3
|
Eigenvalues, Geometric Expanders, Sorting
– Alon
- 1986
|
|
1
|
private correspondence
– Koml'os
|
