Theodore Johnson :
[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 Theodore Johnson Ordered by citing publication [Change the order to 'ordered by cited' ]
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:
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 Some Approaches to Index Design for Cude Forests. [Citation Graph (0, 12)][DBLP ] IEEE Data Eng. Bull., 1999, v:22, n:4, pp:22-30 [Journal ] 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:
Theodore Johnson , Dennis Shasha Utilization of B-trees with Inserts, Deletes and Modifies. [Citation Graph (9, 4)][DBLP ] PODS, 1989, pp:235-246 [Conf ]
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 ]
Theodore Johnson Approximate Analysis of Reader and Writer Access to a Shared Resource. [Citation Graph (2, 0)][DBLP ] SIGMETRICS, 1990, pp:106-114 [Conf ]
Theodore Johnson , Dennis Shasha B-Trees with Inserts and Deletes: Why Free-at-Empty Is Better Than Merge-at-Half. [Citation Graph (5, 0)][DBLP ] J. Comput. Syst. Sci., 1993, v:47, n:1, pp:45-76 [Journal ]