|
114
|
A logarithmic time sort for linear size networks
– H J Reif, L G Valiant
- 1987
|
|
1206
|
Introduction to Parallel Algorithms and Architectures: Arrays
– F T Leighton
- 1992
|
|
163
|
Tight bounds on the complexity of parallel sorting
– F T Leighton
- 1985
|
|
200
|
hot spot’ contention and combining in multistage interconnection networks
– G Pfister, V Norton
- 1985
|
|
244
|
Sorting and Searching, volume 3 of The Art of Computer Programming
– D E Knuth
- 1973
|
|
70
|
Parallel permutation and sorting algorithms and a new generalized connection network
– D Nassimi, S Sahni
- 1982
|
|
104
|
Sorting in c log n parallel steps
– M Ajtai, J Komlós, E Szemerédi
- 1983
|
|
149
|
Parallel Processing with the Perfect Shuffle
– H S Stone
- 1971
|
|
195
|
Linear Algebra Operators for GPU Implementation of Numerical Algorithms
– Jens Krüger, Rüdiger Westermann
- 2003
|
|
314
|
Virtual cut-through: a new computer communication switching technique
– Parviz Kermani, Leonard Kleinrock
- 1979
|
|
191
|
The Cube Connected Cycles: A Versatile Network for Parallel Computers
– F P Preparata, J V Vuillemin
- 1981
|
|
179
|
An O(n log n) sorting network
– M Ajtai, J Koml'os, E Szemer'edi
- 1983
|
|
59
|
An O(log N) deterministic packet-routing scheme
– E Upfal
- 1992
|
|
22
|
Efficient Computation on Sparse Interconnection Networks
– C G Plaxton
- 1989
|
|
47
|
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
|
|
37
|
Counting Networks with Arbitrary Fan-Out
– E Aharonson, H Attiya
- 1995
|
|
18
|
Notes on Sorting and Counting Networks
– N Hardavellas, D Karakos, M Mavronicolas
- 1993
|
|
14
|
Coins, Weights and Contention in Balancing Networks
– W Aiello, R Venkatesan, M Yung
- 1994
|
