( en | de | ru )

 

Disambiguation of "Srimani, Pradip K."

Author of the publication

copydeleteadd this publication to your clipboard
A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph.

, , , and . IWDC, volume 2918 of Lecture Notes in Computer Science, page 26-32. Springer, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Pradip Niyogi

Pradip Chakraborty

Pradip Dey

Pradip Mainali

Pradip Kanti Majumdar

 

Other publications of authors with the same name

Mutual Exclusion Between Neighboring Nodes in a Tree That Stabilizes Using Read/Write Atomicity., and . Euro-Par, volume 1470 of Lecture Notes in Computer Science, page 545-553. Springer, (1998)Self-Stabilizing Protocol for Shortest Path Tree for Multi-cast Routing in Mobile Networks (Research Note)., , and . Euro-Par, volume 1900 of Lecture Notes in Computer Science, page 600-604. Springer, (2000)Routing in Star Graph Using Binary Labels., , and . PDPTA, page 2410-2416. CSREA Press, (1999)A Self-stabilizing Distributed Algorithm to Find the Center of a Tree Graph., and . Parallel Algorithms Appl., 10 (3-4): 237-248 (1997)Fault Tolerant Ring Embedding in tetravalent Cayley Network Graphs., and . Journal of Circuits, Systems, and Computers, 6 (5): 527-536 (1996)Editorial., , , and . Wireless Networks, 9 (2): 93-94 (2003)Fault Diameter of Star Graphs., and . Inf. Process. Lett., 48 (5): 243-251 (1993)An Analysis of Edge Fault Tolerance in Recursively Decomposable Regular Networks., , and . IEEE Trans. Computers, 43 (4): 470-475 (1994)A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation., , , and . IEEE Trans. Computers, 35 (11): 1000-1004 (1986)A New Adaptive Hardware Tree-Based Multicast Routing in K-Ary N-Cubes., , and . IEEE Trans. Computers, 50 (7): 647-659 (2001)