| |
| 2001 | ||
|---|---|---|
| 8 | Gheorghe Antonoiu, Pradip K. Srimani: Self-stabilizing depth-first multi-token circulation in tree networks. Parallel Algorithms Appl. 16(1): 17-35 (2001) | |
| 1999 | ||
| 7 | EE | Gheorghe Antonoiu, Pradip K. Srimani: Mutual Exclusion Between Neighboring Nodes in an Arbitrary System Graph Tree That Stabilizes Using Read/Write Atomicity. Euro-Par 1999: 823-830 |
| 6 | Gheorghe Antonoiu, Pradip K. Srimani: A Self-Stabilizing Distributed Algorithm to Find the Median of a Tree Graph. J. Comput. Syst. Sci. 58(1): 215-221 (1999) | |
| 5 | EE | Gheorghe Antonoiu, Pradip K. Srimani: Self-stabilizing Protocol for Mutual Exclusion among Neighboring Nodes in a Tree Structured Distributed System. Parallel Algorithms Appl. 14(1): 1-18 (1999) |
| 1998 | ||
| 4 | EE | Gheorghe Antonoiu, Pradip K. Srimani: Mutual Exclusion Between Neighboring Nodes in a Tree That Stabilizes Using Read/Write Atomicity. Euro-Par 1998: 545-553 |
| 1997 | ||
| 3 | Gheorghe Antonoiu, Pradip K. Srimani: Distributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction. Euro-Par 1997: 480-487 | |
| 2 | EE | Gheorghe Antonoiu, Pradip K. Srimani: A Self-stabilizing Distributed Algorithm to Find the Center of a Tree Graph. Parallel Algorithms Appl. 10(3-4): 237-248 (1997) |
| 1996 | ||
| 1 | Gheorghe Antonoiu, Pradip K. Srimani: A Self-Stabilizing Leader Election Algorithm for Tree Graphs. J. Parallel Distrib. Comput. 34(2): 227-232 (1996) | |
| 1 | Pradip K. Srimani | [1] [2] [3] [4] [5] [6] [7] [8] |