|
David Harel:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Anthony J. Bonner:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Anthony J. Bonner cite David HarelOrdered by citing publication[Change the order to 'ordered by cited']
-
Giansalvatore Mecca, Anthony J. Bonner
Finite Query Languages for Sequence Databases. [Citation Graph (2, 20)][DBLP] DBPL, 1995, pp:12- [Conf] Cites:
-
Anthony J. Bonner
Modular Composition of Transaction Programs with Deductive Databases. [Citation Graph (1, 17)][DBLP] DBPL, 1997, pp:373-395 [Conf] Cites:
-
Anthony J. Bonner, Michael Kifer, Mariano P. Consens
Database Programming in Transaction Logic. [Citation Graph (3, 30)][DBLP] DBPL, 1993, pp:309-337 [Conf] Cites:
-
Ashok K. Chandra, David Harel
Computable Queries for Relational Data Bases. [Citation Graph (99, 0)][DBLP] J. Comput. Syst. Sci., 1980, v:21, n:2, pp:156-178 [Journal]
-
Ashok K. Chandra, David Harel
Structure and Complexity of Relational Queries. [Citation Graph (73, 0)][DBLP] J. Comput. Syst. Sci., 1982, v:25, n:1, pp:99-128 [Journal]
-
David Harel, Dexter Kozen, Rohit Parikh
Process Logic: Expressiveness, Decidability, Completeness. [Citation Graph (1, 0)][DBLP] J. Comput. Syst. Sci., 1982, v:25, n:2, pp:144-170 [Journal]
-
Anthony J. Bonner, Giansalvatore Mecca
Querying String Databases with Transducers. [Citation Graph (0, 14)][DBLP] DBPL, 1997, pp:118-135 [Conf] Cites:
-
Anthony J. Bonner
Hypothetical Datalog: Complexity and Expressiblity. [Citation Graph (3, 20)][DBLP] ICDT, 1988, pp:144-160 [Conf] Cites:
-
Ashok K. Chandra, David Harel
Structure and Complexity of Relational Queries [Citation Graph (9, 0)][DBLP] FOCS, 1980, pp:333-347 [Conf]
-
Ashok K. Chandra, David Harel
Horn Clauses and the Fixpoint Query Hierarchy. [Citation Graph (23, 7)][DBLP] PODS, 1982, pp:158-163 [Conf]
-
Ashok K. Chandra, David Harel
Computable Queries for Relational Data Bases. [Citation Graph (99, 0)][DBLP] J. Comput. Syst. Sci., 1980, v:21, n:2, pp:156-178 [Journal]
-
Anthony J. Bonner
Hypothetical Datalog: Negation and Linear Recursion. [Citation Graph (1, 15)][DBLP] PODS, 1989, pp:286-300 [Conf] Cites:
-
Ashok K. Chandra, David Harel
Structure and Complexity of Relational Queries [Citation Graph (9, 0)][DBLP] FOCS, 1980, pp:333-347 [Conf]
-
Ashok K. Chandra, David Harel
Computable Queries for Relational Data Bases. [Citation Graph (99, 0)][DBLP] J. Comput. Syst. Sci., 1980, v:21, n:2, pp:156-178 [Journal]
-
Anthony J. Bonner
Workflow, Transactions, and Datalog. [Citation Graph (1, 22)][DBLP] PODS, 1999, pp:294-305 [Conf] Cites:
-
David Harel
A Thesis for Bounded Concurrency. [Citation Graph (1, 0)][DBLP] MFCS, 1989, pp:35-48 [Conf]
-
Doron Drusinsky, David Harel
On the Power of Bounded Concurrency I: Finite Automata. [Citation Graph (2, 0)][DBLP] J. ACM, 1994, v:41, n:3, pp:517-539 [Journal]
-
Ashok K. Chandra, David Harel
Computable Queries for Relational Data Bases. [Citation Graph (99, 0)][DBLP] J. Comput. Syst. Sci., 1980, v:21, n:2, pp:156-178 [Journal]
-
Ashok K. Chandra, David Harel
Structure and Complexity of Relational Queries. [Citation Graph (73, 0)][DBLP] J. Comput. Syst. Sci., 1982, v:25, n:1, pp:99-128 [Journal]
-
David Harel
Statecharts: A Visual Formulation for Complex Systems. [Citation Graph (15, 0)][DBLP] Sci. Comput. Program., 1987, v:8, n:3, pp:231-274 [Journal]
-
Giansalvatore Mecca, Anthony J. Bonner
Sequences, Datalog and Transducers. [Citation Graph (5, 22)][DBLP] PODS, 1995, pp:23-35 [Conf] Cites:
|