|
David S. Johnson:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Gio Wiederhold:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Gio Wiederhold cite David S. JohnsonOrdered by citing publication[Change the order to 'ordered by cited']
-
Domenico Saccà, Gio Wiederhold
Database Partitioning in a Cluster of Processors. [Citation Graph (1, 8)][DBLP] VLDB, 1983, pp:242-247 [Conf] Cites:
-
David S. Johnson
Approximation Algorithms for Combinatorial Problems. [Citation Graph (4, 0)][DBLP] J. Comput. Syst. Sci., 1974, v:9, n:3, pp:256-278 [Journal]
-
David S. Johnson, Alan J. Demers, Jeffrey D. Ullman, M. R. Garey, Ronald L. Graham
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms. [Citation Graph (4, 0)][DBLP] SIAM J. Comput., 1974, v:3, n:4, pp:299-325 [Journal]
-
M. R. Garey, David S. Johnson, Larry J. Stockmeyer
Some Simplified NP-Complete Graph Problems. [Citation Graph (8, 0)][DBLP] Theor. Comput. Sci., 1976, v:1, n:3, pp:237-267 [Journal]
-
Domenico Saccà, Gio Wiederhold
Database Partitioning in a Cluster of Processors. [Citation Graph (7, 15)][DBLP] ACM Trans. Database Syst., 1985, v:10, n:1, pp:29-56 [Journal] Cites:
-
David S. Johnson
Approximation Algorithms for Combinatorial Problems. [Citation Graph (4, 0)][DBLP] J. Comput. Syst. Sci., 1974, v:9, n:3, pp:256-278 [Journal]
-
David S. Johnson, Alan J. Demers, Jeffrey D. Ullman, M. R. Garey, Ronald L. Graham
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms. [Citation Graph (4, 0)][DBLP] SIAM J. Comput., 1974, v:3, n:4, pp:299-325 [Journal]
-
M. R. Garey, David S. Johnson, Larry J. Stockmeyer
Some Simplified NP-Complete Graph Problems. [Citation Graph (8, 0)][DBLP] Theor. Comput. Sci., 1976, v:1, n:3, pp:237-267 [Journal]
|