Sorting networks and their applications (1968)

Cached

Download Links

by K. E. Batcher
Citations:501 - 0 self

Documents Related by Co-Citation

120 A logarithmic time sort for linear size networks – J H Reif, L G Valiant - 1987
168 Tight Bounds on the Complexity of Parallel Sorting – Tom Leighton - 1984
212 Hot Spot Contention and Combining in Multistage Interconnection Networks – G F Pfister, V A Norton - 1985
208 An O(n log n) sorting network – M Ajtai, J Komlós, E Szemerédi - 1983
70 Parallel Permutation and Sorting Algorithms and a New Generalized Connection Network – D Nassimi, S Sahni - 1982
111 Sorting in c log n parallel steps – M Ajtai, J Komlós, E Szemerédi - 1983
165 Parallel processing with the perfect shuffle – H Stone - 1971
1309 Introduction to Parallel Algorithms and Architectures: Arrays – F T Leighton - 1991
236 Linear Algebra Operators for GPU Implementation of Numerical Algorithms – Jens Krüger, Rüdiger Westermann - 2003
338 Virtual cut-through: a new computer communication switching technique – Parviz Kermani, Leonard Kleinrock - 1979
255 Sorting and Searching, volume 3 of The Art of Computer Programming – Donald E Knuth - 1998
60 An O(logN) Deterministic Packet Routing Scheme. STOC – E Upfal - 1998
22 Efficient Computation on Sparse Interconnection Networks – C G Plaxton - 1989
51 Randomized Routing on Fat-Trees – Ronald I. Greenberg, Charles E. Leiserson - 1996
67 Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers – Robert Cypher, C. Greg Plaxton - 1996
18 Notes on Sorting and Counting Networks – N Hardavellas, D Karakos, M Mavronicolas - 1993
39 Counting Networks with Arbitrary Fan-Out – E Aharonson, H Attiya - 1995
41 Small-Depth Counting Networks – Michael Klugerman, C. Greg Plaxton - 1992
17 Weights and Contention in Balancing Networks – W Aiello, R Venkatesan, M Yung, “Coins - 1994