|
Paris C. Kanellakis:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Mihalis Yannakakis:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Mihalis Yannakakis cite Paris C. KanellakisOrdered by cited publication[Change the order to 'ordered by citing']
-
Paris C. Kanellakis, Christos H. Papadimitriou
The Complexity of Distributed Concurrency Control [Citation Graph (9, 0)][DBLP] FOCS, 1981, pp:185-197 [Conf] Is cited by:
-
Catriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan
Bounds on the Propagation of Selection into Logic Programs. [Citation Graph (31, 19)][DBLP] PODS, 1987, pp:214-226 [Conf] Is cited by:
-
Stavros S. Cosmadakis, Paris C. Kanellakis
Parallel Evaluation of Recursive Rule Queries. [Citation Graph (22, 28)][DBLP] PODS, 1986, pp:280-293 [Conf] Is cited by:
-
Paris C. Kanellakis
Constraint Programming and Database Languages: A Tutorial. [Citation Graph (9, 58)][DBLP] PODS, 1995, pp:46-53 [Conf] Is cited by:
-
Paris C. Kanellakis, Christos H. Papadimitriou
Is Distributed Locking Harder? [Citation Graph (3, 15)][DBLP] PODS, 1982, pp:98-107 [Conf] Is cited by:
-
Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer
Parallel Algorithms for Term Matching. [Citation Graph (2, 0)][DBLP] SIAM J. Comput., 1988, v:17, n:4, pp:711-731 [Journal] Is cited by:
|