39 citations · 161 across the 21 of their papers we have counts for
6 papers · 1 filter
Logic Programming with Graph Automorphism: Integrating naut with Prolog (Tool Description)
Michael Frank, Michael Codish
This paper presents the plnauty~library, a Prolog interface to the nauty graph-automorphism tool. Adding the capabilities of nauty to Prolog combines the strength of the "generate…
Sorting Networks: to the End and Back Again
Michael Codish, Luís Cruz-Filipe, Thorsten Ehlers +2
This paper studies new properties of the front and back ends of a sorting network, and illustrates the utility of these in the search for new bounds on optimal sorting networks. Se…
Applying Sorting Networks to Synthesize Optimized Sorting Libraries
Michael Codish, Luís Cruz-Filipe, Markus Nebel +1
This paper shows an application of the theory of sorting networks to facilitate the synthesis of optimized general purpose sorting libraries. Standard sorting libraries are often b…
Optimal-Depth Sorting Networks
Daniel Bundala, Michael Codish, Luís Cruz-Filipe +2
We solve a 40-year-old open problem on the depth optimality of sorting networks. In 1973, Donald E. Knuth detailed, in Volume 3 of "The Art of Computer Programming", sorting networ…
Sorting Networks: the End Game
Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp
This paper studies properties of the back end of a sorting network and illustrates the utility of these in the search for networks of optimal size or depth. All previous works focu…
The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes
Michael Codish, Luis Cruz-Filipe, Peter Schneider-Kamp
Previous work identifying depth-optimal -channel sorting networks for is based on exploiting symmetries of the first two layers. However, the naive generate-an…