|
Maurice Herlihy:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Arthur J. Bernstein:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Arthur J. Bernstein cite Maurice HerlihyOrdered by citing publication[Change the order to 'ordered by cited']
-
Arthur J. Bernstein, David Scott Gerstl, Wai-Hong Leung, Philip M. Lewis
Design and Performance of an Assertional Concurrency Control System. [Citation Graph (0, 19)][DBLP] ICDE, 1998, pp:436-445 [Conf] Cites:
-
Maurice Herlihy
Apologizing Versus Asking Permission: Optimistic Concurrency Control for Abstract Data Types. [Citation Graph (8, 34)][DBLP] ACM Trans. Database Syst., 1990, v:15, n:1, pp:96-124 [Journal]
-
Narayanan Krishnakumar, Arthur J. Bernstein
Bounded Ignorance in Replicated Systems. [Citation Graph (9, 19)][DBLP] PODS, 1991, pp:63-74 [Conf] Cites:
-
Narayanan Krishnakumar, Arthur J. Bernstein
High Throughput Escrow Algorithms for Replicated Databases. [Citation Graph (5, 8)][DBLP] VLDB, 1992, pp:175-186 [Conf] Cites:
-
Narayanan Krishnakumar, Arthur J. Bernstein
Bounded Ignorance: A Technique for Increasing Concurrency in a Replicated System. [Citation Graph (3, 40)][DBLP] ACM Trans. Database Syst., 1994, v:19, n:4, pp:586-625 [Journal] Cites:
-
Maurice Herlihy, Jeannette M. Wing
Specifying Graceful Degradation in Distributed Systems. [Citation Graph (2, 0)][DBLP] PODC, 1987, pp:167-177 [Conf]
-
Maurice Herlihy, William E. Weihl
Hybrid Concurrency Control for Abstract Data Types. [Citation Graph (17, 13)][DBLP] PODS, 1988, pp:201-210 [Conf]
-
Maurice Herlihy
Concurrency versus Availability: Atomic Mechanisms for Replicated Data. [Citation Graph (5, 0)][DBLP] ACM Trans. Comput. Syst., 1987, v:5, n:3, pp:249-274 [Journal]
-
Maurice Herlihy
Apologizing Versus Asking Permission: Optimistic Concurrency Control for Abstract Data Types. [Citation Graph (8, 34)][DBLP] ACM Trans. Database Syst., 1990, v:15, n:1, pp:96-124 [Journal]
|