Logarithmic time cost optimal parallel sorting is ::::not yet:::: fast in practice!

Lasse Natvig. Logarithmic time cost optimal parallel sorting is ::::not yet:::: fast in practice!. In SC. pages 486-494, 1990. [doi]

Abstract

Abstract is missing.