|
H. V. Jagadish:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Mark Coyle:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Mark Coyle cite H. V. JagadishOrdered by citing publication[Change the order to 'ordered by cited']
-
Shashi Shekhar, Ashim Kohli, Mark Coyle
Path Computation Algorithms for Advanced Traveller Information System (ATIS). [Citation Graph (5, 22)][DBLP] ICDE, 1993, pp:31-39 [Conf] Cites:
-
H. V. Jagadish
A Compressed Transitive Closure Technique for Efficient Fixed-Point Query Processing. [Citation Graph (8, 0)][DBLP] Expert Database Conf., 1988, pp:423-446 [Conf]
-
Shaul Dar, H. V. Jagadish
A Spanning Tree Transitive Closure Algorithm. [Citation Graph (10, 24)][DBLP] ICDE, 1992, pp:2-11 [Conf]
-
Rakesh Agrawal, Alexander Borgida, H. V. Jagadish
Efficient Management of Transitive Relationships in Large Data and Knowledge Bases. [Citation Graph (21, 20)][DBLP] SIGMOD Conference, 1989, pp:253-262 [Conf]
-
H. V. Jagadish, Rakesh Agrawal, Linda Ness
A Study of Transitive Closure As a Recursion Mechanism. [Citation Graph (33, 18)][DBLP] SIGMOD Conference, 1987, pp:331-344 [Conf]
-
Rakesh Agrawal, H. V. Jagadish
Hybrid Transitive Closure Algorithms. [Citation Graph (13, 20)][DBLP] VLDB, 1990, pp:326-334 [Conf]
-
Yvonne Zhou, Shashi Shekhar, Mark Coyle
Disk Allocation Methods for Parallelizing Grid Files. [Citation Graph (6, 18)][DBLP] ICDE, 1994, pp:243-252 [Conf] Cites:
|