activity
20122023
most citedThin circulant matrices and lower bounds on the complexity of some Boolean operators

5 citations · 16 across the 14 of their papers we have counts for

collaborators
Showing 2018Show all

1 paper · 1 filter

cs.DS2018

Some comments on the structure of the best known networks sorting 16 elements

Igor S. Sergeev

We propose an explanation of the structure of the best known sorting networks for 16 elements with respect to the complexity and to the depth due to Green and van Voorhis.