Petrisor Panaite

According to our database, Petrisor Panaite authored at least 11 papers between 1992 and 2000.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2000

Impact of topographic information on graph exploration efficiency.

Petrisor Panaite, Andrzej Pelc

Networks, 2000

Optimal Broadcasting in Faulty Trees.

Petrisor Panaite, Andrzej Pelc

J. Parallel Distributed Comput., 2000

1999

Exploring Unknown Undirected Graphs.

Petrisor Panaite, Andrzej Pelc

J. Algorithms, 1999

1998

Undirected graphs rearrangeable by 2-length walks.

Dominique Barth, Petrisor Panaite

Networks, 1998

Routing Permutations on Graphs via Factors.

Dominique Barth, Petrisor Panaite

J. Parallel Distributed Comput., 1998

1997

Routing Permutations on a 2D Grid with On-Way Edges.

Petrisor Panaite

Parallel Process. Lett., 1997

Optimal Fault-Tolerant Broadcasting in Trees (Extended Abstract).

Petrisor Panaite, Andrzej Pelc

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Universally Fault-Tolerant Broadcasting in Trees.

Petrisor Panaite, Andrzej Pelc

Proceedings of the 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 1997

1996

Hypercube Permutations Routable Under all Dimension Orderings.

Petrisor Panaite

Inf. Process. Lett., 1996

Rubik Routing Permutations on Graphs.

Charles Delorme, Petrisor Panaite

Proceedings of the Euro-Par '96 Parallel Processing, 1996

1992

On Some Rado's Type Functions.

Petrisor Panaite

Sci. Ann. Cuza Univ., 1992