Pavel Tvrdik Visiting Associate Professor Computer Sciences Department University of Wisconsin - Madison 1210 West Dayton Street Madison, WI 53706 USA Room: 6378 Telephone: (26)5-5907 Email: tvrdik@cs.wisc.edu on the leave from: Department of Computer Science & Engineering Faculty of Electrical Engineering Czech Technical University, Prague

Biography:

Assoc. Prof. in Computer Science, CTU Prague, 1996
CSc. (equiv. of PhD) in Computer Science, CTU Prague, 1991
Ing. (equiv. of MSc) in Computer Science, CTU Prague, 1980

Current Research Interests:

• interconnection networks and communication algorithms
• parallel algorithms and computer architectures
• graph theory and combinatorics

Teaching:

CS838 - Topics in Parallel Computing

Editorship:

Editorial Board of Parallel and Distributed Computing Practices, 1997-1998

Recent Conference Committees:

• Program Committee, 2nd IASTED Int. Conf. on Par. and Distr. Comp. and Networks, Brisbane, Australia, Dec.14-16, 1998
• Program Committee, 5th Int. IEEE/ACM Conf. on High Perf. Computing, Madras, India, Dec. 1998
• Program Committee, 5th Colloquium SIROCCO, Italy, June 98
• Program Committee, European PVM User Group Meeting, Krakow, Poland, Oct 1997
• Co-Chair, International Workshop on Interconnection Networks, Prague, Czech Rep., Jul 1997
• Program Committee, European PVM User Group Meeting, Munich, Germany, Oct 1996

Selected Recent Publications:

1. J. Trdlicka and P. Tvrdik. Embedding of k-ary complete trees into hypercubes with uniform load . Journal of Parallel and Distributed Computing, 52(1):120--131, 1998.
2. P. Tvrdik, R. Harbane, and M.-C. Heydemann. Uniform homomorphisms of de Bruijn and Kautz networks. Discrete Applied Mathematics, 83(1-3):279-301, 1998.
3. J. Rolim, P. Tvrdik, J. Trdlicka, and I. Vrto. Bisecting de Bruijn and Kautz graphs. Discrete Applied Mathematics, 85(1):87-97, 1998.
4. P. Kopriva and P. Tvrdik. Decomposition of de Bruijn networks. In C.-N. Chen and L. Ni, editors, Proceedings of the 1998 Int. Conf. on Parallel and Distributed Systems, pages 580--587, Tainan, Taiwan, Dec. 1998. IEEE CS Press, Los Alamitos, USA, 1998.
5. J. Trdlicka and P. Tvrdik. Embedding complete $k$-ary trees into 3-D meshes with optimal edge congestion. In G. Gupta and H. Shen, editors, Proc. of the 2nd IASTED Int. Conf. on Parallel and Distributed Computing and Networks, pages 666--671, Brisbane, Australia, Dec. 1998. Acta Press, Anaheim, USA, 1998.
6. M. Soch and P. Tvrdik. Optimal gossip in noncombining 3-D tori with constant buffers. In G. Gupta and H. Shen, editors, Proc. of the 2nd IASTED Int. Conf. on Parallel and Distributed Computing and Networks, pages 666--671, Brisbane, Australia, Dec. 1998. Acta Press, Anaheim, USA, 1998.
7. J. Trdlicka and P. Tvrdik. Embedding complete $k$-ary trees into 2-D meshes with optimal edge congestion. In Y. Pan, S. G. Akl, and K. Li, editors, Proceedings of the 10th IASTED International Conference on Parallel and Distributed Computing Systems, pages 51--55, Las Vegas, Nevada, USA, Oct. 1998. Acta Press, Anaheim, USA, 1998.
8. M. Soch and P. Tvrdik. Time-optimal gossip in noncombing 2-D tori with constant buffers. In D. Pritchard and J. Reeve, editors, Euro-Par'98 Parallel Processing, number 1470 in Lecture Notes in Computer Science, pages 1047--1050, Southamptom, G.B., Sept. 1998. Springer Verlag, Berlin, 1998.
9. P. Salinger and P. Tvrdik. All-to-all scatter in Kautz networks. In D. Pritchard and J. Reeve, editors, Euro-Par'98 Parallel Processing, number 1470 in Lecture Notes in Computer Science, pages 1057--1061, Southamptom, G.B., Sept. 1998. Springer Verlag, Berlin, 1998.
10. M. Soch and P. Tvrdik. Optimal gossip in noncombining 2-D meshes. In D. Krizanc and P. Widmayer, editors, SIROCCO 97. The 4th International Colloquium on Structural Information and Communication Complexity, Ascona, Switzerland, pages 253-265. Carleton Scientific, Canada, 1997.
11. M. Soch and P. Tvrdik. Optimal gossip in store-and-forward noncombining 2-D tori. In C. Lengauer, M. Griebl, and S. Gorlatch, editors, Euro-Par'97 Parallel Processing, number 1300 in Lecture Notes in Computer Science, pages 234-241. Springer Verlag, 1997.
12. M. Soch, P. Tvrdik, and M. Volf. Parallel graph-partitioning using the mob heuristic. In M. Bubak, J. Dongarra, and J. Wasniewski, editors, Recent Advances in Parallel Virtual Machine and Message Passing Interface, number 1332 in Lecture Notes in Computer Science, pages 383-389. Springer Verlag, 1997.
13. J. Trdlicka and P. Tvrdik. Embedding complete k-ary trees in 2-dimensional meshes and tori. In C. Lengauer, M. Griebl, and S. Gorlatch, editors, Euro-Par'97 Parallel Processing, number 1300 in Lecture Notes in Computer Science, pages 226-233. Springer Verlag, 1997.
14. T. L. Casavant, P. Tvrdik, and F. Plasil, editors. Parallel Computers: Theory and Practice. IEEE CS Press, Los Alamitos, CA, USA, 1995.