Petr Salinger

According to our database, Petr Salinger authored at least 8 papers between 1998 and 2006.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2006

Broadcasting in all-output-port cube-connected cycles with distance-insensitive switching.

Petr Salinger, Pavel Tvrdík

J. Parallel Distributed Comput., 2006

2002

Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing.

Petr Salinger, Pavel Tvrdík

Parallel Comput., 2002

Broadcasting in All-Output-Port Meshes of Trees with Distance-Insensitive Switching.

Petr Salinger, Pavel Tvrdík

J. Parallel Distributed Comput., 2002

2001

All-to-All Scatter in de Bruijn and Kautz Networks.

Petr Salinger, Pavel Tvrdík

Comput. Artif. Intell., 2001

Broadcasting in all-output-port cube-connected cycles with distance-insensitive routing.

Petr Salinger, Pavel Tvrdík

Proceedings of the SIROCCO 8, 2001

2000

Optimal Broadcasting in All-Port Meshes of Trees with Distance-Insensitive Routing.

Petr Salinger, Pavel Tvrdík

Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

Broadcasting in All-Port Wormhole 3-D Meshes of Trees (Research Note).

Petr Salinger, Pavel Tvrdík

Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1998

All-to-all Scatter in Kautz Networks.

Petr Salinger, Pavel Tvrdík

Proceedings of the Euro-Par '98 Parallel Processing, 1998