Mark H. Overmars :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Dan E. Willard :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Which papers of Dan E. Willard cite Mark H. Overmars Ordered by citing publication [Change the order to 'ordered by cited' ]
Dan E. Willard Quasilinear Algorithms for Processing Relational Calculus Expressions. [Citation Graph (0, 26)][DBLP ] PODS, 1990, pp:243-257 [Conf ] Cites:
Mark H. Overmars , Michiel H. M. Smid Maintaining Range Trees in Secondary Memory (Extended Abstract). [Citation Graph (1, 0)][DBLP ] STACS, 1988, pp:38-51 [Conf ]
Herbert Edelsbrunner , Mark H. Overmars Batched Dynamic Solutions to Decomposable Searching Problems. [Citation Graph (1, 0)][DBLP ] J. Algorithms, 1985, v:6, n:4, pp:515-542 [Journal ]
Mark H. Overmars Efficient Data Structures for Range Searching on a Grid. [Citation Graph (1, 0)][DBLP ] J. Algorithms, 1988, v:9, n:2, pp:254-275 [Journal ]
Dan E. Willard Efficient Processing of Relational Calculus Expressions Using Range Query Theory. [Citation Graph (3, 47)][DBLP ] SIGMOD Conference, 1984, pp:164-175 [Conf ] Cites: