( en | de | ru )

 

Disambiguation of "Jacobs, David Pokrass"

Author of the publication

copydeleteadd this publication to your clipboard
Fault Tolerant Algorithms for Orderings and Colorings.

, , , and . IPDPS, IEEE Computer Society, (2004)

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.

Erich David

Ernst David

Baruch Davidoff

Frida David

Walter David

 

Other publications of authors with the same name

Verification of Non-Identities in Algebras., and . ISSAC, volume 358 of Lecture Notes in Computer Science, page 496-507. Springer, (1988)Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space., , , and . ICDCN, volume 4904 of Lecture Notes in Computer Science, page 182-190. Springer, (2008)Self-Stabilizing Graph Protocols., , , , and . Parallel Process. Lett., 18 (1): 189-199 (2008)A simple heuristic for maximizing service of carousel storage., , and . Comput. Oper. Res., 27 (13): 1351-1356 (2000)A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Grap., , , and . IPDPS, page 240. IEEE Computer Society, (2003)Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time., , and . IPDPS, IEEE Computer Society, (2002)On the computational complexity of upper fractional domination., , , and . Discret. Appl. Math., 27 (3): 195-207 (1990)Experimenting with the Identity (xy)z = y(zx)., , and . J. Symb. Comput., 16 (3): 289-293 (1993)Fault Tolerant Algorithms for Orderings and Colorings., , , and . IPDPS, IEEE Computer Society, (2004)Complexity and Unsolvability Properties of Nilpotency., and . SIAM J. Comput., 19 (1): 32-43 (1990)