| 2000 |
|---|
| 7 | | Jan Trdlicka,
Pavel Tvrdík:
Embedding complete k-ary trees into k-square 2-D meshes with optimal edge congestion.
Parallel Computing 26(6): 783-790 (2000) |
| 1999 |
|---|
| 6 | | Jan Trdlicka,
Pavel Tvrdík:
Optimal k-ary Divide and Conquer Computations on Wormhole 2-D and 3-D Meshes.
HiPC 1999: 253-260 |
| 1998 |
|---|
| 5 | EE | José D. P. Rolim,
Pavel Tvrdík,
Jan Trdlicka,
Imrich Vrto:
Bisecting De Bruijn and Kautz Graphs.
Discrete Applied Mathematics 85(1): 87-97 (1998) |
| 4 | | Jan Trdlicka,
Pavel Tvrdík:
Embedding of k-ary Complete Trees into Hypercubes with Uniform Load.
J. Parallel Distrib. Comput. 52(2): 120-131 (1998) |
| 1997 |
|---|
| 3 | | Jan Trdlicka,
Pavel Tvrdík:
Embedding Complete k-ary Trees into 2-dimensional Meshes and Tori.
Euro-Par 1997: 226-233 |
| 1996 |
|---|
| 2 | | Michal Soch,
Jan Trdlicka,
Pavel Tvrdík:
PVM, Computational Geometry, and Parallel Computing Course.
PVM 1996: 38-44 |
| 1995 |
|---|
| 1 | | José D. P. Rolim,
Pavel Tvrdík,
Jan Trdlicka,
Imrich Vrto:
Bisecting de Bruijn and Kautz Graphs.
SIROCCO 1995: 211-222 |
