Showing papers by "William F. Smyth published in 1993"

TL;DR: A simple FAS algorithm which guarantees a good (though not optimal) performance bound and executes in time O(m) is presented and achieves the same asymptotic performance bound that Berger-Shor does.