- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i2 |      | Dan Geiger, Azaria Paz, Judea Pearl: On Testing Whether an Embedded Bayesian Network Represents a Probability Model. CoRR abs/1302.6809 (2013) |
| 2012 | ||
| j19 | | Azaria Paz, Jack W. Carlyle: Chaotic Evolution via Generalized Probabilistic Automata (Probabilistic Arrays). Comput. J. 55(5): 522-533 (2012) |
| i1 | | |
| 2011 | ||
| j18 | | Azaria Paz: A theory of decomposition into prime factors of layered interconnection networks. Discrete Applied Mathematics 159(7): 628-646 (2011) |
| 2010 | ||
| c21 | | |
| 2006 | ||
| j17 | | Azaria Paz: A Property of Independency Relations Induced by Probabilistic Distributions with Binary Variables. Fundam. Inform. 73(1-2): 229-236 (2006) |
| 2004 | ||
| c20 | | |
| 2003 | ||
| j16 | | Azaria Paz: An alternative version of Lauritzen et al.'s algorithm for checking representation of independencies. Soft Comput. 7(5): 344-349 (2003) |
| 2000 | ||
| j15 | | Azaria Paz, Robert Y. Geva, Milan Studený: Representation of Irrelevance Relations by Annotated Graphs. Fundam. Inform. 42(2): 149-199 (2000) |
| 1999 | ||
| c19 |  | |
| 1997 | ||
| c18 | | Azaria Paz, Jack W. Carlyle: Chaotic Evolution via Generalized Probabilistic Automata (Probabilistic Arrays). Developments in Language Theory 1997: 9-35 |
| 1996 | ||
| j14 | | Azaria Paz, Judea Pearl, Shmuel Ur: A new characterization of graphs based on interception relations. Journal of Graph Theory 22(2): 125-136 (1996) |
| 1994 | ||
| j13 | | Mody Lempel, Azaria Paz: An Algorithm for Finding a Shortest Vector in a Two-Dimensional Modular Lattice. Theor. Comput. Sci. 125(2): 229-241 (1994) |
| c17 | | Azaria Paz: An Elementary Algorithmic Problem from an Advanced Standpoint. Results and Trends in Theoretical Computer Science 1994: 344-357 |
| c16 | | Dan Geiger, Azaria Paz, Judea Pearl: On Testing Whether an Embedded Bayesian Network Represents a Probability Model. UAI 1994: 244-252 |
| 1991 | ||
| j12 | | Dan Geiger, Azaria Paz, Judea Pearl: Axioms and Algorithms for Inferences Involving Probabilistic Independence. Inf. Comput. 91(1): 128-141 (1991) |
| 1990 | ||
| c15 | | Dan Geiger, Azaria Paz, Judea Pearl: Learning Causal Trees from Dependence Information. AAAI 1990: 770-776 |
| c14 | | Azaria Paz: Usefulness and Visibility of Graph Grammars. Graph-Grammars and Their Application to Computer Science 1990: 56 |
| c13 | | Azaria Paz: The Theory of Graphoids: A Survey. Graph-Grammars and Their Application to Computer Science 1990: 610-621 |
| 1989 | ||
| j11 | | Hugo Krawczyk, Azaria Paz: The diophantine problem of Frobenius: A close bound. Discrete Applied Mathematics 23(3): 289-291 (1989) |
| c12 | | Robert Y. Geva, Azaria Paz: Toward a Complete Representation of Graphoids in Graphs (Abridged Version). WG 1989: 46-62 |
| 1987 | ||
| c11 | | Azaria Paz, Claus-Peter Schnorr: Approximating Integer Lattices by Lattices with Cyclic Factor Groups. ICALP 1987: 386-393 |
| 1986 | ||
| c10 | | Judea Pearl, Azaria Paz: Graphoids: Graph-Based Logic for Reasoning about Relevance Relations or When would x tell you more about y if you already know z? ECAI 1986: 357-363 |
| c9 | | Jack W. Carlyle, Sheila A. Greibach, Azaria Paz: Complexity of pattern generation via planar parallel binary fission/fusion grammars. Graph-Grammars and Their Application to Computer Science 1986: 515-533 |
| 1983 | ||
| j10 | | Jack W. Carlyle, Sheila A. Greibach, Azaria Paz: Matching and Spanning in Certain Planar Graphs. Mathematical Systems Theory 16(2): 159-183 (1983) |
| 1982 | ||
| c8 | | Azaria Paz: Geometry versus topology in map grammars. Graph-Grammars and Their Application to Computer Science 1982: 288-296 |
| 1981 | ||
| j9 | | Azaria Paz, Shlomo Moran: Non Deterministic Polynomial Optimization Problems and their Approximations. Theor. Comput. Sci. 15: 251-277 (1981) |
| 1978 | ||
| c7 | | Azaria Paz, Yoav Raz: Complexity of Pattern Generation by Map-L-Systems. Graph-Grammars and Their Application to Computer Science and Biology 1978: 367-378 |
| 1977 | ||
| c6 | | Azaria Paz, Shlomo Moran: Non-Deterministic Polynomial Optimization Problems and Their Approximation. ICALP 1977: 370-379 |
| 1974 | ||
| c5 | | Jack W. Carlyle, Sheila A. Greibach, Azaria Paz: A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report). SWAT (FOCS) 1974: 1-12 |
| 1973 | ||
| j8 | | Azaria Paz, Arto Salomaa: Integral Sequential Word Functions and Growth Equivalence of Lindenmayer Systems. Information and Control 23(4): 313-343 (1973) |
| 1972 | ||
| c4 | | Azaria Paz, Michael Rabinovich: Linear Automata - Approximation Problem (Extended Abstract). ICALP 1972: 99-102 |
| 1971 | ||
| j7 | | Jack W. Carlyle, Azaria Paz: Realizations by Stochastic Finite Automata. J. Comput. Syst. Sci. 5(1): 26-40 (1971) |
| 1970 | ||
| j6 | | Azaria Paz: Counterexamples and Bounds for Graphs Solvable with Finite Delay. Information and Control 16(5): 465-472 (1970) |
| 1968 | ||
| j5 | | Azaria Paz: Homomorphisms Between Stochastic Sequential Machines and Related Problems. Mathematical Systems Theory 2(3): 223-245 (1968) |
| c3 | | Azaria Paz: Infinite State Probabilistic Transition Tables and Chains Ergodic Properties. SWAT (FOCS) 1968: 42-50 |
| 1967 | ||
| j4 | | Azaria Paz: Minimization Theorems and Techniques for Sequential Stochastic Machines. Information and Control 11(1/2): 155-166 (1967) |
| j3 | | Azaria Paz: Fuzzy Star Functions, Probabilistic Automata, and Their Approximation by Nonprobabilistic Automata. J. Comput. Syst. Sci. 1(4): 371-390 (1967) |
| c2 | | Azaria Paz: Fuzzy Star Functions, Probabilistic Automata and Their Approximation by Nonprobabilistic Automata. SWAT (FOCS) 1967: 280-290 |
| 1966 | ||
| j2 | | |
| c1 | | Shimon Even, I. Kohavi, Azaria Paz: On Minimal Modulo 2 Sums of Products for Switching Functions. SWAT (FOCS) 1966: 201-206 |
| 1965 | ||
| j1 | | |
Colors in the list of coauthors
Last update Thu May 23 21:05:55 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page