|
Hans Hinterberger:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Bernhard Seeger:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Bernhard Seeger cite Hans HinterbergerOrdered by citing publication[Change the order to 'ordered by cited']
-
Thomas Brinkhoff, Hans-Peter Kriegel, Bernhard Seeger
Parallel Processing of Spatial Joins Using R-trees. [Citation Graph (6, 15)][DBLP] ICDE, 1996, pp:258-265 [Conf] Cites:
-
Hans-Peter Kriegel, Bernhard Seeger
Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions. [Citation Graph (8, 11)][DBLP] ICDE, 1987, pp:10-17 [Conf] Cites:
-
Hans-Peter Kriegel, Bernhard Seeger
PLOP-Hashing: A Grid File without Directory. [Citation Graph (12, 20)][DBLP] ICDE, 1988, pp:369-376 [Conf] Cites:
-
Hans-Peter Kriegel, Bernhard Seeger
Multidimensional Order Preserving Linear Hashing with Partial Expansions. [Citation Graph (15, 11)][DBLP] ICDT, 1986, pp:203-220 [Conf] Cites:
-
Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger
The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. [Citation Graph (177, 7)][DBLP] SIGMOD Conference, 1990, pp:322-331 [Conf] Cites:
-
Bernhard Seeger, Hans-Peter Kriegel
Techniques for Design and Implementation of Efficient Spatial Access Methods. [Citation Graph (15, 23)][DBLP] VLDB, 1988, pp:360-371 [Conf] Cites:
-
Bernhard Seeger, Hans-Peter Kriegel
The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems. [Citation Graph (26, 22)][DBLP] VLDB, 1990, pp:590-601 [Conf] Cites:
|