|
Rudolf Bayer:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Witold Litwin:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Witold Litwin cite Rudolf BayerOrdered by citing publication[Change the order to 'ordered by cited']
-
Witold Litwin, Djamel Eddine Zegour, Gérard Lévy
Multilevel Trie Hashing. [Citation Graph (1, 30)][DBLP] EDBT, 1988, pp:309-335 [Conf] Cites:
-
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, Karl Unterauer
Prefix B-Trees. [Citation Graph (27, 6)][DBLP] ACM Trans. Database Syst., 1977, v:2, n:1, pp:11-26 [Journal]
-
Witold Litwin, David B. Lomet
The Bounded Disorder Access Method. [Citation Graph (7, 16)][DBLP] ICDE, 1986, pp:38-48 [Conf] Cites:
-
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, Karl Unterauer
Prefix B-Trees. [Citation Graph (27, 6)][DBLP] ACM Trans. Database Syst., 1977, v:2, n:1, pp:11-26 [Journal]
-
Witold Litwin
Trie Hashing. [Citation Graph (22, 13)][DBLP] SIGMOD Conference, 1981, pp:19-29 [Conf] Cites:
-
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, Karl Unterauer
Prefix B-Trees. [Citation Graph (27, 6)][DBLP] ACM Trans. Database Syst., 1977, v:2, n:1, pp:11-26 [Journal]
|