Author:
Fischer Th. M.,Wolfrum K.
Reference18 articles.
1. D. Avis, Lower bounds for geometric problems, Proc. 18th Allerton Conf. Commun., Contr., Comput. 1980, 35–40
2. M. Ben-Or, Lower bounds for algebraic computation trees, Proc. 15th STOC, 1983
3. J. L. Bentley, Multidimensional divide-and-conquer, Comm. ACM 23 (1980), 214–229
4. J. L. Bentley and H. A. Maurer, Efficient worst case data structures for range searching, Acta Informatica 13 (1980), 155–168
5. Th. Fischer, On the complexity of rectangle intersection problems under structural constraints, Preprint, 1986