( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Checkpointing strategies for database systems.

, и . ACM Conference on Computer Science, стр. 88-97. ACM, (1987)

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.

Pradip Niyogi

Pradip Chakraborty

Pradip Dey

Pradip Mainali

Pradip Kanti Majumdar

 

Другие публикации лиц с тем же именем

Loop detection in MPLS for wireless sensor networks., , , и . Microprocess. Microsystems, 28 (8): 439-445 (2004)A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation., , , и . IEEE Trans. Computers, 35 (11): 1000-1004 (1986)A new fault tolerant distributed mutual exclusion algorithm., , и . SAC, стр. 831-839. ACM, (1992)Checkpointing strategies for database systems., и . ACM Conference on Computer Science, стр. 88-97. ACM, (1987)A class of modified single stage S/E networks., и . ACM Conference on Computer Science, стр. 147-154. ACM, (1986)Using self-stabilization to design adaptive multicast protocols for mobile ad hoc networks., и . Mobile Networks and Computing, том 52 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 67-84. DIMACS/AMS, (1999)Network Cache Model for Wireless Proxy Caching., , и . MASCOTS, стр. 311-314. IEEE Computer Society, (2005)Mutual Exclusion Between Neighboring Nodes in a Tree That Stabilizes Using Read/Write Atomicity., и . Euro-Par, том 1470 из Lecture Notes in Computer Science, стр. 545-553. Springer, (1998)Self-Stabilizing Protocol for Shortest Path Tree for Multi-cast Routing in Mobile Networks (Research Note)., , и . Euro-Par, том 1900 из Lecture Notes in Computer Science, стр. 600-604. Springer, (2000)An O(n2) Self-Stabilizing Algorithm for Minimal Total Dominating Set in Arbitrary Graphs., , и . WI/IAT, стр. 49-54. IEEE, (2020)