|
Mario Schkolnick:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Dennis Shasha:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Dennis Shasha cite Mario SchkolnickOrdered by citing publication[Change the order to 'ordered by cited']
-
Nathan Goodman, Dennis Shasha
Semantically-based Concurrency Control for Search Structures. [Citation Graph (10, 23)][DBLP] PODS, 1985, pp:8-19 [Conf] Cites:
-
Theodore Johnson, Dennis Shasha
A Framework for the Performance Analysis of Concurrent B-tree Algorithms. [Citation Graph (7, 14)][DBLP] PODS, 1990, pp:273-287 [Conf] Cites:
-
Vladimir Lanin, Dennis Shasha
Concurrent Set Manipulation without Locking. [Citation Graph (0, 20)][DBLP] PODS, 1988, pp:211-220 [Conf] Cites:
-
John Turek, Dennis Shasha, Sundeep Prakash
Locking without Blocking: Making Lock Based Concurrent Data Structure Algorithms Nonblocking. [Citation Graph (0, 8)][DBLP] PODS, 1992, pp:212-222 [Conf] Cites:
-
Theodore Johnson, Dennis Shasha
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm. [Citation Graph (9, 19)][DBLP] VLDB, 1994, pp:439-450 [Conf] Cites:
-
Steve Rozen, Dennis Shasha
A Framework for Automating Physical Database Design. [Citation Graph (5, 18)][DBLP] VLDB, 1991, pp:401-411 [Conf] Cites:
-
Theodore Johnson, Dennis Shasha
The Performance of Current B-Tree Algorithms. [Citation Graph (4, 30)][DBLP] ACM Trans. Database Syst., 1993, v:18, n:1, pp:51-101 [Journal] Cites:
-
Dennis Shasha, Nathan Goodman
Concurrent Search Structure Algorithms. [Citation Graph (32, 35)][DBLP] ACM Trans. Database Syst., 1988, v:13, n:1, pp:53-90 [Journal] Cites:
|