Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > SORTING NETWORKS:
Reports tagged with Sorting networks:
TR22-116 | 17th August 2022
Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir Podolskii

Constant-Depth Sorting Networks

In this paper, we address sorting networks that are constructed from comparators of arity $k > 2$. That is, in our setting the arity of the comparators -- or, in other words, the number of inputs that can be sorted at the unit cost -- is a parameter. We study ... more >>>




ISSN 1433-8092 | Imprint