Conference paper
Neave effect also occurs with Tausworthe sequences
Shu Tezuka
WSC 1991
This paper presents a deterministic sorting algorithm, called Sharesort, that sorts n records on an n-processor hypercube, shuffle-exchange, or cube-connected cycles in O(log n(log log n)2) time in the worst case. The algorithm requires only a constant amount of storage at each processor. The fastest previous deterministic algorithm for this problem was Batcher's bitonic sort, which runs in O(log2 n) time. © 1993.
Shu Tezuka
WSC 1991
Peter Wendt
Electronic Imaging: Advanced Devices and Systems 1990
Imran Nasim, Melanie Weber
SCML 2024
Karthik Visweswariah, Sanjeev Kulkarni, et al.
IEEE International Symposium on Information Theory - Proceedings