Author of the publication

Complexity results for enhanced qualitative probabilistic networks.

, and . Int. J. Approx. Reason., 48 (3): 879-888 (2008)

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.

 

Other publications of authors with the same name

An Assertional Proof of Rana's Algorithm., and . Inf. Process. Lett., 49 (5): 227-233 (1994)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)Distributed Infimum Approximation.. FCT, volume 278 of Lecture Notes in Computer Science, page 440-447. Springer, (1987)Complexity results for enhanced qualitative probabilistic networks., and . Int. J. Approx. Reason., 48 (3): 879-888 (2008)Maximal Matching Stabilizes in Quadratic Time.. Inf. Process. Lett., 49 (6): 271-272 (1994)Comments on ``On the Proof of a Distributed Algorithm'': Always-Tru is not Invariant., and . Inf. Process. Lett., 35 (6): 277-279 (1990)Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes., , and . SIROCCO, page 173-187. Carleton Scientific, (1998)Comments on "Ring Based Termination Detection Algorithm for Distributed Computations"., and . Inf. Process. Lett., 31 (3): 127-128 (1989)Network Orientation.. Int. J. Found. Comput. Sci., 5 (1): 23-57 (1994)Synchronizing ABD networks., , and . IEEE/ACM Trans. Netw., 2 (1): 66-69 (1994)