 | 2000 |
|---|
| 12 |       | Petrisor Panaite,
Andrzej Pelc:
Optimal Broadcasting in Faulty Trees.
J. Parallel Distrib. Comput. 60(5): 566-584 (2000) |
| 11 |  | Petrisor Panaite,
Andrzej Pelc:
Impact of topographic information on graph exploration efficiency.
Networks 36(2): 96-103 (2000) |
| 1999 |
|---|
| 10 | | Petrisor Panaite,
Andrzej Pelc:
Exploring Unknown Undirected Graphs.
J. Algorithms 33(2): 281-295 (1999) |
| 1998 |
|---|
| 9 | | Petrisor Panaite,
Andrzej Pelc:
Exploring Unknown Undirected Graphs.
SODA 1998: 316-322 |
| 8 | | Dominique Barth,
Petrisor Panaite:
Routing Permutations on Graphs via Factors.
J. Parallel Distrib. Comput. 54(2): 162-182 (1998) |
| 7 | | Dominique Barth,
Petrisor Panaite:
Undirected graphs rearrangeable by 2-length walks.
Networks 31(4): 239-247 (1998) |
| 1997 |
|---|
| 6 | | Petrisor Panaite,
Andrzej Pelc:
Universally Fault-Tolerant Broadcasting in Trees.
ICPADS 1997: 724-729 |
| 5 | | Petrisor Panaite,
Andrzej Pelc:
Optimal Fault-Tolerant Broadcasting in Trees (Extended Abstract).
ISAAC 1997: 143-152 |
| 4 | | Petrisor Panaite:
Routing Permutations on a 2D Grid with On-Way Edges.
Parallel Processing Letters 7(3): 225-235 (1997) |
| 1996 |
|---|
| 3 | | Charles Delorme,
Petrisor Panaite:
Rubik Routing Permutations on Graphs.
Euro-Par, Vol. I 1996: 283-286 |
| 2 | | Petrisor Panaite:
Hypercube Permutations Routable Under all Dimension Orderings.
Inf. Process. Lett. 59(4): 185-189 (1996) |
| 1992 |
|---|
| 1 | | Petrisor Panaite:
On Some Rado's Type Functions.
Sci. Ann. Cuza Univ. 1: 27-40 (1992) |
