We stand with Ukraine

We stand with Ukraine

Azaria Paz

According to our database¹, Azaria Paz authored at least 50 papers between 1965 and 2022.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

On csauthors.net:

Bibliography

2022

GRAPHOIDS: Graph-Based Logic for Reasoning about Relevance Relations <i>Or</i>When Would <i>x</i> Tell You More about <i>y</i> If You Already Know <i>z</i>?

[BibT_eX]

[DOI]

,

Proceedings of the Probabilistic and Causal Inference: The Works of Judea Pearl, 2022

A Note of Appreciation.

[BibT_eX]

[DOI]

Proceedings of the Probabilistic and Causal Inference: The Works of Judea Pearl, 2022

2012

Chaotic Evolution via Generalized Probabilistic Automata (Probabilistic Arrays).

[BibT_eX]

[DOI]

,

Jack W. Carlyle

Comput. J., 2012

2011

A theory of decomposition into prime factors of layered interconnection networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

2010

Confounding Equivalence in Causal Inference.

[BibT_eX]

[DOI]

,

Proceedings of the UAI 2010, 2010

2006

A Property of Independency Relations Induced by Probabilistic Distributions with Binary Variables.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

2004

Some Properties of Multistage Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the Theory Is Forever, 2004

2003

An alternative version of Lauritzen et al.'s algorithm for checking representation of independencies.

[BibT_eX]

[DOI]

Soft Comput., 2003

2000

Representation of Irrelevance Relations by Annotated Graphs.

[BibT_eX]

[DOI]

,

,

Fundam. Informaticae, 2000

1999

Algorithms on Continued Fractions.

[BibT_eX]

Octavian Soldea

,

Proceedings of the Jewels are Forever, 1999

1996

A new characterization of graphs based on interception relations.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 1996

1994

An Algorithm for Finding a Shortest Vector in a Two-Dimensional Modular Lattice.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 1994

On Testing Whether an Embedded Bayesian Network Represents a Probability Model.

[BibT_eX]

[DOI]

,

,

Proceedings of the UAI '94: Proceedings of the Tenth Annual Conference on Uncertainty in Artificial Intelligence, 1994

An Elementary Algorithmic Problem from an Advanced Standpoint.

[BibT_eX]

[DOI]

Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1991

Axioms and Algorithms for Inferences Involving Probabilistic Independence

[BibT_eX]

[DOI]

,

,

Inf. Comput., March, 1991

1990

The Theory of Graphoids: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990

Usefulness and Visibility of Graph Grammars.

[BibT_eX]

Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990

Learning Causal Trees from Dependence Information.

[BibT_eX]

[DOI]

,

,

Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, USA, July 29, 1990

1989

A 4-State Probablistic Table Approximating All 2-State Probablistic Tables.

[BibT_eX]

[DOI]

Proceedings of the A Perspective in Theoretical Computer Science, 1989

The diophantine problem of Frobenius: A close bound.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 1989

Toward a Complete Representation of Graphoids in Graphs (Abridged Version).

[BibT_eX]

[DOI]

,

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

1987

Approximating Integer Lattices by Lattices with Cyclic Factor Groups.

[BibT_eX]

[DOI]

,

Claus-Peter Schnorr

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

A duality property for the set of all feasible solutions to an integer program.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1986

Complexity of pattern generation via planar parallel binary fission/fusion grammars.

[BibT_eX]

[DOI]

Jack W. Carlyle

,

Sheila A. Greibach

,

Proceedings of the Graph-Grammars and Their Application to Computer Science, 1986

Graphoids: Graph-Based Logic for Reasoning about Relevance Relations or When would x tell you more about y if you already know z?

[BibT_eX]

,

Proceedings of the Advances in Artificial Intelligence II, 1986

1984

A note on cake cutting.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 1984

1983

Matching and Spanning in Certain Planar Graphs.

[BibT_eX]

[DOI]

Jack W. Carlyle

,

Sheila A. Greibach

,

Math. Syst. Theory, 1983

1982

Geometry versus topology in map grammars.

[BibT_eX]

[DOI]

Proceedings of the Graph-Grammars and Their Application to Computer Science, 1982

1981

Non Deterministic Polynomial Optimization Problems and their Approximations.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 1981

1978

Complexity of Pattern Generation by Map-L-Systems.

[BibT_eX]

[DOI]

,

Proceedings of the Graph-Grammars and Their Application to Computer Science and Biology, 1978

1977

Non-Deterministic Polynomial Optimization Problems and Their Approximation.

[BibT_eX]

[DOI]

,

Proceedings of the Automata, 1977

1975

Multidimensional Parallel Rewriting Systems.

[BibT_eX]

Proceedings of the Automata, Languages, Development: At the crossroads of biology, mathematics and computer science, result of an international conference held at Noordwijkerhout, The Netherlands, March 31, 1975

1974

Linear Automata Approximation Problem.

[BibT_eX]

[DOI]

,

Moshe Rabinovitz

IEEE Trans. Computers, 1974

A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report)

[BibT_eX]

[DOI]

Jack W. Carlyle

,

Sheila A. Greibach

,

Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

1973

Integral Sequential Word Functions and Growth Equivalence of Lindenmayer Systems

[BibT_eX]

[DOI]

,

Inf. Control., November, 1973

1972

Linear Automata - Approximation Problem (Extended Abstract).

[BibT_eX]

,

Michael Rabinovich

Proceedings of the Automata, 1972

1971

Whirl Decomposition of Stochastic Systems.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1971

Realizations by Stochastic Finite Automata.

[BibT_eX]

[DOI]

Jack W. Carlyle

,

J. Comput. Syst. Sci., 1971

1970

Counterexamples and Bounds for Graphs Solvable with Finite Delay

[BibT_eX]

[DOI]

Inf. Control., July, 1970

R70-45 On Decompositions of Regular Events.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1970

R70-33 Fuzzy Events Realized by Finite Probabilistic Automata.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1970

Regular Events in Stochastic Sequential Machines.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1970

1968

On Concatenative Decompositions of Regular Events.

[BibT_eX]

[DOI]

,

IEEE Trans. Computers, 1968

Homomorphisms Between Stochastic Sequential Machines and Related Problems.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1968

Infinite State Probabilistic Transition Tables and Chains Ergodic Properties

[BibT_eX]

[DOI]

Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

1967

On Minimal Modulo 2 Sums of Products for Switching Functions.

[BibT_eX]

[DOI]

,

,

IEEE Trans. Electron. Comput., 1967

Fuzzy Star Functions, Probabilistic Automata, and Their Approximation by Nonprobabilistic Automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1967

Minimization Theorems and Techniques for Sequential Stochastic Machines

[BibT_eX]

[DOI]

Inf. Control., 1967

1966

Some aspects of Probabilistic Automata

[BibT_eX]

[DOI]

Inf. Control., February, 1966

1965

Ultimate-Definite and Symmetric-Definite Events and Automata.

[BibT_eX]

[DOI]

,

J. ACM, 1965

Loading...