Lower Bounds on Correction Networks

13 years 10 months ago

Download www.ii.uni.wroc.pl

Abstract. Correction networks are comparator networks that sort inputs differing from sorted sequences of length N in a small number of positions. The main application of such networks is producing fault-tolerant sorting networks. We

Grzegorz Stachowiak

Real-time Traffic

Comparator Networks | Correction Networks | Fault-tolerant Sorting Networks | ISAAC 2003 |

claim paper

» A Lower Bound on WaitFree Counting

» Lower Bounds on the VCDimension of Smoothly Parametrized Function Classes

» Pseudorandom Generators TypicallyCorrect Derandomization and Circuit Lower Bounds

» InNetwork Computation in Random Wireless Networks A PAC Approach to Constant Refresh Rates...

» On NetworkError Correcting Convolutional Codes under the BSC Edge Error Model

» Competitive algorithms and lower bounds for online randomized call control in cellular net...

» Lower Bounds on the Sample Complexity of Exploration in the Multiarmed Bandit Problem

» Lower Bounds of Computational Power of a Synaptic Calculus

Post Info
More Details (n/a)

Added	07 Jul 2010
Updated	07 Jul 2010
Type	Conference
Year	2003
Where	ISAAC
Authors	Grzegorz Stachowiak

Comments (0)

Sciweavers

Lower Bounds on Correction Networks

Comparator Networks | Correction Networks | Fault-tolerant Sorting Networks | ISAAC 2003 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers