Dennis Shasha :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Theodore Johnson :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Which papers of Theodore Johnson cite Dennis Shasha 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:
Vladimir Lanin , Dennis Shasha A Symmetric Concurrent B-Tree Algorithm. [Citation Graph (10, 0)][DBLP ] FJCC, 1986, pp:380-389 [Conf ]
Theodore Johnson , Dennis Shasha Utilization of B-trees with Inserts, Deletes and Modifies. [Citation Graph (9, 4)][DBLP ] PODS, 1989, pp:235-246 [Conf ]
Dennis Shasha What Good are Concurrent Search Structure Algorithms for databases Anyway? [Citation Graph (11, 0)][DBLP ] IEEE Database Eng. Bull., 1985, v:8, n:2, pp:84-90 [Journal ]
Theodore Johnson , Padmashree Krishna Lazy Updates for Distributed Search Structure. [Citation Graph (8, 9)][DBLP ] SIGMOD Conference, 1993, pp:337-346 [Conf ] 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 ]
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 ]
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:
Vladimir Lanin , Dennis Shasha A Symmetric Concurrent B-Tree Algorithm. [Citation Graph (10, 0)][DBLP ] FJCC, 1986, pp:380-389 [Conf ]
Nathan Goodman , Dennis Shasha Semantically-based Concurrency Control for Search Structures. [Citation Graph (10, 23)][DBLP ] PODS, 1985, pp:8-19 [Conf ]
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 ]
Dennis Shasha What Good are Concurrent Search Structure Algorithms for databases Anyway? [Citation Graph (11, 0)][DBLP ] IEEE Database Eng. Bull., 1985, v:8, n:2, pp:84-90 [Journal ]
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 ]
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 ]