2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2020
Correction to: A Practical, Provably Linear Time, In-place and Stable Merge Algorithm via the Perfect Shuffle
John Ellis, Ulrike Stege
We correct a paper previously submitted to CoRR. That paper claimed that the algorithm there described was provably of linear time complexity in the average case. The alleged proof…
cs.DS2015★ 2 cited
A Provably, Linear Time, In-place and Stable Merge Algorithm via the Perfect Shuffle
John Ellis, Ulrike Stege
We reconsider a recently published algorithm (Dalkilic et al.) for merging lists by way of the perfect shuffle. The original publication gave only experimental results which, altho…