@inproceedings{cfee75b752b94264a8ab403a84dceb2e,
title = "The quest for optimal sorting networks: Efficient generation of two-layer prefixes",
abstract = "Previous work identifying depth-optimal n-channel sorting networks for 9 ≥ n ≥ 16 is based on exploiting symmetries of the first two layers. However, the naive generate-and-test approach typically applied does not scale. This paper revisits the problem of generating two-layer prefixes modulo symmetries. 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. An empirical evaluation demonstrates that the new method outperforms the generate-and-test approach by orders of magnitude and easily scales until n = 40.",
author = "Michael Codish and Luis Cruz-Filipe and Peter Schneider-Kamp",
note = "Publisher Copyright: {\textcopyright} 2014 IEEE.; 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2014 ; Conference date: 22-09-2014 Through 25-09-2014",
year = "2015",
month = feb,
day = "5",
doi = "10.1109/SYNASC.2014.55",
language = "American English",
series = "Proceedings - 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2014",
pages = "359--366",
editor = "Franz Winkler and Viorel Negru and Tetsuo Ida and Tudor Jebelean and Dana Petcu and Watt, {Stephen M.} and Daniela Zaharie",
booktitle = "Proceedings - 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2014",
}