( en | de | ru )

 

Disambiguation of "Tel, Gerard"

Author of the publication

copydeleteadd this publication to your clipboard
The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes.

, and . ACM Trans. Program. Lang. Syst., 15 (1): 1-35 (1993)

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.

Gerard Spettel

Gerard Tangerding

Walter Gérard

Kaethe Gerard

Gerard Meijer

 

Other publications of authors with the same name

Complexity results for enhanced qualitative probabilistic networks., and . Int. J. Approx. Reason., 48 (3): 879-888 (2008)Distributed Infimum Approximation.. FCT, volume 278 of Lecture Notes in Computer Science, page 440-447. Springer, (1987)The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes., and . PARLE (1), volume 505 of Lecture Notes in Computer Science, page 137-149. Springer, (1991)An Assertional Proof of Rana's Algorithm., and . Inf. Process. Lett., 49 (5): 227-233 (1994)Total Algorithms.. Concurrency, volume 335 of Lecture Notes in Computer Science, page 277-291. Springer, (1988)Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes., , and . SIROCCO, page 173-187. Carleton Scientific, (1998)Synchronous, Asynchronous, and Causally Ordered Communication., , and . Distributed Comput., 9 (4): 173-191 (1996)Comments on ``On the Proof of a Distributed Algorithm'': Always-Tru is not Invariant., and . Inf. Process. Lett., 35 (6): 277-279 (1990)Maximal Matching Stabilizes in Quadratic Time.. Inf. Process. Lett., 49 (6): 271-272 (1994)Comments on "Ring Based Termination Detection Algorithm for Distributed Computations"., and . Inf. Process. Lett., 31 (3): 127-128 (1989)