default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAzaria Paz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[p3]Judea Pearl, Azaria Paz:
GRAPHOIDS: Graph-Based Logic for Reasoning about Relevance Relations OrWhen Would x Tell You More about y If You Already Know z? Probabilistic and Causal Inference 2022: 189-200- [p2]Azaria Paz:
A Note of Appreciation. Probabilistic and Causal Inference 2022: 667-670
2010 – 2019
- 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
- [j28]Azaria Paz, Jack W. Carlyle:
Chaotic Evolution via Generalized Probabilistic Automata (Probabilistic Arrays). Comput. J. 55(5): 522-533 (2012) - [i1]Judea Pearl, Azaria Paz:
Confounding Equivalence in Causal Inference. CoRR abs/1203.3505 (2012) - 2011
- [j27]Azaria Paz:
A theory of decomposition into prime factors of layered interconnection networks. Discret. Appl. Math. 159(7): 628-646 (2011) - 2010
- [c22]Judea Pearl, Azaria Paz:
Confounding Equivalence in Causal Inference. UAI 2010: 433-441
2000 – 2009
- 2006
- [j26]Azaria Paz:
A Property of Independency Relations Induced by Probabilistic Distributions with Binary Variables. Fundam. Informaticae 73(1-2): 229-236 (2006) - 2004
- [c21]Azaria Paz:
Some Properties of Multistage Interconnection Networks. Theory Is Forever 2004: 250-258 - 2003
- [j25]Azaria Paz:
An alternative version of Lauritzen et al.'s algorithm for checking representation of independencies. Soft Comput. 7(5): 344-349 (2003) - 2000
- [j24]Azaria Paz, Robert Y. Geva, Milan Studený
:
Representation of Irrelevance Relations by Annotated Graphs. Fundam. Informaticae 42(2): 149-199 (2000)
1990 – 1999
- 1999
- [c20]Octavian Soldea, Azaria Paz:
Algorithms on Continued Fractions. Jewels are Forever 1999: 273-284 - 1997
- [c19]Azaria Paz, Jack W. Carlyle:
Chaotic Evolution via Generalized Probabilistic Automata (Probabilistic Arrays). Developments in Language Theory 1997: 9-35 - 1996
- [j23]Azaria Paz, Judea Pearl, Shmuel Ur:
A new characterization of graphs based on interception relations. J. Graph Theory 22(2): 125-136 (1996) - 1994
- [j22]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) - [c18]Azaria Paz:
An Elementary Algorithmic Problem from an Advanced Standpoint. Results and Trends in Theoretical Computer Science 1994: 344-357 - [c17]Dan Geiger, Azaria Paz, Judea Pearl:
On Testing Whether an Embedded Bayesian Network Represents a Probability Model. UAI 1994: 244-252 - 1991
- [j21]Dan Geiger, Azaria Paz, Judea Pearl:
Axioms and Algorithms for Inferences Involving Probabilistic Independence. Inf. Comput. 91(1): 128-141 (1991) - 1990
- [c16]Dan Geiger, Azaria Paz, Judea Pearl:
Learning Causal Trees from Dependence Information. AAAI 1990: 770-776 - [c15]Azaria Paz:
Usefulness and Visibility of Graph Grammars. Graph-Grammars and Their Application to Computer Science 1990: 56 - [c14]Azaria Paz:
The Theory of Graphoids: A Survey. Graph-Grammars and Their Application to Computer Science 1990: 610-621
1980 – 1989
- 1989
- [j20]Hugo Krawczyk, Azaria Paz:
The diophantine problem of Frobenius: A close bound. Discret. Appl. Math. 23(3): 289-291 (1989) - [c13]Robert Y. Geva, Azaria Paz:
Toward a Complete Representation of Graphoids in Graphs (Abridged Version). WG 1989: 46-62 - [p1]Azaria Paz:
A 4-State Probablistic Table Approximating All 2-State Probablistic Tables. A Perspective in Theoretical Computer Science 1989: 221-228 - 1987
- [c12]Azaria Paz, Claus-Peter Schnorr:
Approximating Integer Lattices by Lattices with Cyclic Factor Groups. ICALP 1987: 386-393 - 1986
- [j19]Azaria Paz:
A duality property for the set of all feasible solutions to an integer program. Discret. Appl. Math. 14(1): 57-66 (1986) - [c11]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 - [c10]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 - 1984
- [j18]Shimon Even, Azaria Paz:
A note on cake cutting. Discret. Appl. Math. 7(3): 285-296 (1984) - 1983
- [j17]Jack W. Carlyle, Sheila A. Greibach, Azaria Paz:
Matching and Spanning in Certain Planar Graphs. Math. Syst. Theory 16(2): 159-183 (1983) - 1982
- [c9]Azaria Paz:
Geometry versus topology in map grammars. Graph-Grammars and Their Application to Computer Science 1982: 288-296 - 1981
- [j16]Azaria Paz, Shlomo Moran:
Non Deterministic Polynomial Optimization Problems and their Approximations. Theor. Comput. Sci. 15: 251-277 (1981)
1970 – 1979
- 1978
- [c8]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
- [c7]Azaria Paz, Shlomo Moran:
Non-Deterministic Polynomial Optimization Problems and Their Approximation. ICALP 1977: 370-379 - 1975
- [c6]Azaria Paz:
Multidimensional Parallel Rewriting Systems. Automata, Languages, Development 1975: 509-515 - 1974
- [j15]Azaria Paz, Moshe Rabinovitz:
Linear Automata Approximation Problem. IEEE Trans. Computers 23(3): 249-255 (1974) - [c5]Jack W. Carlyle, Sheila A. Greibach, Azaria Paz:
A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report). SWAT 1974: 1-12 - 1973
- [j14]Azaria Paz, Arto Salomaa:
Integral Sequential Word Functions and Growth Equivalence of Lindenmayer Systems. Inf. Control. 23(4): 313-343 (1973) - 1972
- [c4]Azaria Paz, Michael Rabinovich:
Linear Automata - Approximation Problem (Extended Abstract). ICALP 1972: 99-102 - 1971
- [j13]Jack W. Carlyle, Azaria Paz:
Realizations by Stochastic Finite Automata. J. Comput. Syst. Sci. 5(1): 26-40 (1971) - [j12]Azaria Paz:
Whirl Decomposition of Stochastic Systems. IEEE Trans. Computers 20(10): 1208-1211 (1971) - 1970
- [j11]Azaria Paz:
Counterexamples and Bounds for Graphs Solvable with Finite Delay. Inf. Control. 16(5): 465-472 (1970) - [j10]Azaria Paz:
Regular Events in Stochastic Sequential Machines. IEEE Trans. Computers 19(5): 456-457 (1970) - [j9]Azaria Paz:
R70-33 Fuzzy Events Realized by Finite Probabilistic Automata. IEEE Trans. Computers 19(9): 858 (1970) - [j8]Azaria Paz:
R70-45 On Decompositions of Regular Events. IEEE Trans. Computers 19(10): 990 (1970)
1960 – 1969
- 1968
- [j7]Azaria Paz:
Homomorphisms Between Stochastic Sequential Machines and Related Problems. Math. Syst. Theory 2(3): 223-245 (1968) - [j6]Azaria Paz, Bezalel Peleg:
On Concatenative Decompositions of Regular Events. IEEE Trans. Computers 17(3): 229-237 (1968) - [c3]Azaria Paz:
Infinite State Probabilistic Transition Tables and Chains Ergodic Properties. SWAT 1968: 42-50 - 1967
- [j5]Azaria Paz:
Minimization Theorems and Techniques for Sequential Stochastic Machines. Inf. Control. 11(1/2): 155-166 (1967) - [j4]Azaria Paz:
Fuzzy Star Functions, Probabilistic Automata, and Their Approximation by Nonprobabilistic Automata. J. Comput. Syst. Sci. 1(4): 371-390 (1967) - [j3]Shimon Even, Igal Kohavi, Azaria Paz:
On Minimal Modulo 2 Sums of Products for Switching Functions. IEEE Trans. Electron. Comput. 16(5): 671-674 (1967) - [c2]Azaria Paz:
Fuzzy Star Functions, Probabilistic Automata and Their Approximation by Nonprobabilistic Automata. SWAT 1967: 280-290 - 1966
- [j2]Azaria Paz:
Some aspects of Probabilistic Automata. Inf. Control. 9(1): 26-60 (1966) - [c1]Shimon Even, Igal Kohavi, Azaria Paz:
On Minimal Modulo 2 Sums of Products for Switching Functions. SWAT 1966: 201-206 - 1965
- [j1]Azaria Paz, Bezalel Peleg:
Ultimate-Definite and Symmetric-Definite Events and Automata. J. ACM 12(3): 399-410 (1965)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
