| |
| 1993 | ||
|---|---|---|
| 7 | EE | Thomas Verma, Judea Pearl: Deciding Morality of Graphs is NP-complete. UAI 1993: 391-399 |
| 1992 | ||
| 6 | EE | Thomas Verma, Judea Pearl: An Algorithm for Deciding if a Set of Observed Independencies Has a Causal Explanation. UAI 1992: 323-330 |
| 1991 | ||
| 5 | Judea Pearl, Thomas Verma: A Theory of Inferred Causation. KR 1991: 441-452 | |
| 1990 | ||
| 4 | EE | Thomas Verma, Judea Pearl: Equivalence and synthesis of causal models. UAI 1990: 255-270 |
| 1989 | ||
| 3 | EE | Dan Geiger, Thomas Verma, Judea Pearl: d-Separation: From Theorems to Algorithms. UAI 1989: 139-148 |
| 1988 | ||
| 2 | EE | Thomas Verma, Judea Pearl: Causal networks: semantics and expressiveness. UAI 1988: 69-78 |
| 1987 | ||
| 1 | Judea Pearl, Thomas Verma: The Logic of Representing Dependencies by Directed Graphs. AAAI 1987: 374-379 | |
| 1 | Dan Geiger | [3] |
| 2 | Judea Pearl | [1] [2] [3] [4] [5] [6] [7] |