|
Rudolf Bayer:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Douglas Comer:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Douglas Comer cite Rudolf BayerOrdered by citing publication[Change the order to 'ordered by cited']
-
Douglas Comer
The Ubiquitous B-Tree. [Citation Graph (144, 27)][DBLP] ACM Comput. Surv., 1979, v:11, n:2, pp:121-137 [Journal] Cites:
-
Rudolf Bayer
Binary B-Trees for Virtual Memory. [Citation Graph (1, 0)][DBLP] SIGFIDET Workshop, 1971, pp:219-235 [Conf]
-
Rudolf Bayer
Symmetric Binary B-Trees: Data Structure and Maintenance Algorithms [Citation Graph (8, 0)][DBLP] Acta Inf., 1972, v:1, n:, pp:290-306 [Journal]
-
Rudolf Bayer, Edward M. McCreight
Organization and Maintenance of Large Ordered Indices [Citation Graph (153, 0)][DBLP] Acta Inf., 1972, v:1, n:, pp:173-189 [Journal]
-
Rudolf Bayer, Mario Schkolnick
Concurrency of Operations on B-Trees. [Citation Graph (66, 0)][DBLP] Acta Inf., 1977, v:9, n:, pp:1-21 [Journal]
-
Rudolf Bayer, J. K. Metzger
On the Encipherment of Search Trees and Random Access Files. [Citation Graph (4, 3)][DBLP] ACM Trans. Database Syst., 1976, v:1, n:1, pp:37-52 [Journal]
-
Rudolf Bayer, Karl Unterauer
Prefix B-Trees. [Citation Graph (27, 6)][DBLP] ACM Trans. Database Syst., 1977, v:2, n:1, pp:11-26 [Journal]
|