3 citations · 7 across the 4 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014
Faster Small-Constant-Periodic Merging Networks
Marek Piotrów
We consider the problem of merging two sorted sequences on a comparator network that is used repeatedly, that is, if the output is not sorted, the network is applied again using th…
cs.DS2014
Faster 3-Periodic Merging Networks
Marek Piotrów
We consider the problem of merging two sorted sequences on a comparator network that is used repeatedly, that is, if the output is not sorted, the network is applied again using th…