| 2006 |
|---|
| 35 | EE | Azaria Paz:
A Property of Independency Relations Induced by Probabilistic Distributions with Binary Variables.
Fundam. Inform. 73(1-2): 229-236 (2006) |
| 2004 |
|---|
| 34 | EE | Azaria Paz:
Some Properties of Multistage Interconnection Networks.
Theory Is Forever 2004: 250-258 |
| 2003 |
|---|
| 33 | EE | Azaria Paz:
An alternative version of Lauritzen et al.'s algorithm for checking representation of independencies.
Soft Comput. 7(5): 344-349 (2003) |
| 2000 |
|---|
| 32 | | Azaria Paz,
Robert Y. Geva,
Milan Studený:
Representation of Irrelevance Relations by Annotated Graphs.
Fundam. Inform. 42(2): 149-199 (2000) |
| 1999 |
|---|
| 31 | | Octavian Soldea,
Azaria Paz:
Algorithms on Continued Fractions.
Jewels are Forever 1999: 273-284 |
| 1997 |
|---|
| 30 | | Azaria Paz,
Jack W. Carlyle:
Chaotic Evolution via Generalized Probabilistic Automata (Probabilistic Arrays).
Developments in Language Theory 1997: 9-35 |
| 1994 |
|---|
| 29 | | Azaria Paz:
An Elementary Algorithmic Problem from an Advanced Standpoint.
Results and Trends in Theoretical Computer Science 1994: 344-357 |
| 28 | EE | Dan Geiger,
Azaria Paz,
Judea Pearl:
On Testing Whether an Embedded Bayesian Network Represents a Probability Model.
UAI 1994: 244-252 |
| 27 | | 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) |
| 1991 |
|---|
| 26 | | Dan Geiger,
Azaria Paz,
Judea Pearl:
Axioms and Algorithms for Inferences Involving Probabilistic Independence
Inf. Comput. 91(1): 128-141 (1991) |
| 1990 |
|---|
| 25 | | Dan Geiger,
Azaria Paz,
Judea Pearl:
Learning Causal Trees from Dependence Information.
AAAI 1990: 770-776 |
| 24 | | Azaria Paz:
Usefulness and Visibility of Graph Grammars.
Graph-Grammars and Their Application to Computer Science 1990: 56 |
| 23 | | Azaria Paz:
The Theory of Graphoids: A Survey.
Graph-Grammars and Their Application to Computer Science 1990: 610-621 |
| 1989 |
|---|
| 22 | | Robert Y. Geva,
Azaria Paz:
Toward a Complete Representation of Graphoids in Graphs (Abridged Version).
WG 1989: 46-62 |
| 1987 |
|---|
| 21 | | Azaria Paz,
Claus-Peter Schnorr:
Approximating Integer Lattices by Lattices with Cyclic Factor Groups.
ICALP 1987: 386-393 |
| 1986 |
|---|
| 20 | | 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 |
| 19 | | 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 |
|---|
| 18 | | Jack W. Carlyle,
Sheila A. Greibach,
Azaria Paz:
Matching and Spanning in Certain Planar Graphs.
Mathematical Systems Theory 16(2): 159-183 (1983) |
| 1982 |
|---|
| 17 | | Azaria Paz:
Geometry versus topology in map grammars.
Graph-Grammars and Their Application to Computer Science 1982: 288-296 |
| 1981 |
|---|
| 16 | | Azaria Paz,
Shlomo Moran:
Non Deterministic Polynomial Optimization Problems and their Approximations.
Theor. Comput. Sci. 15: 251-277 (1981) |
| 1978 |
|---|
| 15 | | 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 |
|---|
| 14 | | Azaria Paz,
Shlomo Moran:
Non-Deterministic Polynomial Optimization Problems and Their Approximation.
ICALP 1977: 370-379 |
| 1974 |
|---|
| 13 | | Jack W. Carlyle,
Sheila A. Greibach,
Azaria Paz:
A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report)
FOCS 1974: 1-12 |
| 1973 |
|---|
| 12 | | Azaria Paz,
Arto Salomaa:
Integral Sequential Word Functions and Growth Equivalence of Lindenmayer Systems
Information and Control 23(4): 313-343 (1973) |
| 1972 |
|---|
| 11 | | Azaria Paz,
Michael Rabinovich:
Linear Automata - Approximation Problem (Extended Abstract).
ICALP 1972: 99-102 |
| 1971 |
|---|
| 10 | | Jack W. Carlyle,
Azaria Paz:
Realizations by Stochastic Finite Automata.
J. Comput. Syst. Sci. 5(1): 26-40 (1971) |
| 1970 |
|---|
| 9 | | Azaria Paz:
Counterexamples and Bounds for Graphs Solvable with Finite Delay
Information and Control 16(5): 465-472 (1970) |
| 1968 |
|---|
| 8 | | Azaria Paz:
Infinite State Probabilistic Transition Tables and Chains Ergodic Properties
FOCS 1968: 42-50 |
| 7 | | Azaria Paz:
Homomorphisms Between Stochastic Sequential Machines and Related Problems.
Mathematical Systems Theory 2(3): 223-245 (1968) |
| 1967 |
|---|
| 6 | | Azaria Paz:
Fuzzy Star Functions, Probabilistic Automata and Their Approximation by Nonprobabilistic Automata
FOCS 1967: 280-290 |
| 5 | | Azaria Paz:
Minimization Theorems and Techniques for Sequential Stochastic Machines
Information and Control 11(1/2): 155-166 (1967) |
| 4 | | Azaria Paz:
Fuzzy Star Functions, Probabilistic Automata, and Their Approximation by Nonprobabilistic Automata.
J. Comput. Syst. Sci. 1(4): 371-390 (1967) |
| 1966 |
|---|
| 3 | | Shimon Even,
I. Kohavi,
Azaria Paz:
On Minimal Modulo 2 Sums of Products for Switching Functions
FOCS 1966: 201-206 |
| 2 | | Azaria Paz:
Some aspects of Probabalistic Automata
Information and Control 9(1): 26-60 (1966) |
| 1965 |
|---|
| 1 | EE | Azaria Paz,
B. Peleg:
Ultimate-Definite and Symmetric-Definite Events and Automata.
J. ACM 12(3): 399-410 (1965) |
