Fetching the paper…

Reading the bibliography…

2013

Optimal Sorting Networks

Bundala, Daniel, Závodný, Jakub

Original
PDF
Post on X

Understand

This paper settles the optimality of sorting networks given in The Art of Computer Programming vol.

3 more than 40 years ago.
The book lists efficient sorting networks with n <= 16 inputs.
In this paper we give general combinatorial arguments showing that if a sorting network with a given depth exists then there exists one with a special form.

Optimal Sorting Networks · Around

Built on

A sorting problem
R. C. Bose and R. J. Nelson · 1962
Earlier work this paper cites.
Sorting networks and their applications
K. E. Batcher · 1968
Earlier work this paper cites.
An 0(n log n) sorting network
M. Ajtai, J. Komlós, and E. Szemerédi · 1983
Earlier work this paper cites.

Similar

Parallel complexity theory
Ian Parberry · 1987
Cited alongside, same era.
A computer assisted optimal depth lower bound for nine-input sorting networks
Ian Parberry · 1991
Cited alongside, same era.

Then

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Donald E. Knuth · 1998
Later among the works it cites.
Synthesis of parallel sorting networks using sat solvers
Andreas Morgenstern and Klaus Schneider · 2011
Later among the works it cites.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…