2.5n-Step Sorting on n*n Meshes in the Presence of o(sqrt(n)) Worst-Case Faults.

Chi-Hsiang Yeh Behrooz Parhami Hua Lee Emmanouel A. Varvarigos

Published in: IPPS/SPDP (1999)

Keyphrases

worst case
lower bound
np hard
approximation algorithms
greedy algorithm
upper bound
average case
running times
online algorithms
error bounds
computational complexity
fault diagnosis
post processing
multiresolution
fault detection and diagnosis
test cases
fault detection
d mesh
data sets
worst case analysis