1. A. Aho, J. Hoperoft and J. Ullmann: The Design and Analysis of Computer Algorithms. Addison-Wesley 1978
2. V. Akman and W.R. Franklin: On the question “is
$$
\sum {\sqrt {a_i } } < L
$$
?”. Bull. EATCS 28 (1986) 16–20
3. B. Aronov, B. Chazelle, H. Edelsbrunner, L.J. Guibas, M. Sharir and R. Wenger: Points and triangles in the plane and halving planes in space. Proc. 6th Annual Symp. Comput. Geom., Berkeley, CA, 1990 (see also: Tech. Rep. DIMACS Center, 90/9, 7 pages), pp. 112–115
4. D. Avis and M. Doskas: Algorithms for high dimensional stabbing problems. Theoret. Found. Computer Graph. CAD, Ed. R.A. Earn-shaw. Springer, Berlin Heidelberg New York 1988, pp. 199–208
5. D. Avis, J.M. Roberts and R. Wenger: Lower bounds for line stabbing. Inform. Process. Lett. 33 (1989) 2, 59–62