|
1206
|
Introduction to Parallel Algorithms and Architectures: Arrays
– Leighton
- 1992
|
|
122
|
A planar separator theorem
– Lipton, Tarjan
- 1979
|
|
74
|
Area-Time complexity for VLSI
– Thompson
- 1979
|
|
71
|
On a combinatorial problem
– Bruijn, Erdos
- 1948
|
|
67
|
Complexity Issues in VLSI
– Leighton
- 1983
|
|
49
|
The de bruijn multiprocessor network: A versatile parallel processing and sorting network for vlsi
– Samatham, Pradhan
- 1989
|
|
49
|
Computational aspects of VLSI, Computer
– Ullman
- 1984
|
|
40
|
De Bruijn and Kautz networks: a competitor for the hypercube
– Bermond, Peyrat
- 1989
|
|
16
|
The forwarding index of communication networks
– Chung, Coffman, et al.
- 1987
|
|
11
|
Communication Throughput of Interconnection Networks
– Monien, Diekmann, et al.
- 1994
|
|
8
|
Cartesian Products of Graphs as Spanning Subgraphs of de Bruijn Graphs
– Andreae, Nolle, et al.
- 1994
|
|
6
|
On bandwidth, cutwidth and quotient graphs
– Barth, Pellegrini, et al.
- 1995
|
|
6
|
The relationship between gossiping in vertex-disjoint paths mode and bisection width
– Klasing
- 1994
|
|
4
|
A better upper bound on the bisection width of de bruijn networks
– FELDMANN, MONIEN, et al.
- 1997
|
|
4
|
On forwarding indices of networks, Discrete Applied Mathematics 23
– Heydemann, Meyer, et al.
- 1989
|
|
3
|
The bisection problem for graphs of degree 4
– Hromkovic, Monien
- 1991
|
|
3
|
Bounds for the bandwidth of the d-ary de bruijn graph
– Pellegrini
- 1993
|
|
2
|
A layout for the shuffle-exchange graph
– Hoey, Leiserson
- 1980
|
|
2
|
Elementary Theory of Numbers (Pa'nstwowe Wydawnictwo Naukowe
– Sierpi'nski
- 1964
|
|
1
|
Concentrated data stream on grids: Sorting and routing near to the bisection bound
– Kunde
- 1991
|
|
1
|
Necklaces and scalability of Kautz digraphs, in
– Tvrd'ik
- 1994
|
