Sen, Sandeep Algorithms and Complexity, MPI for Informatics, Max Planck Society;
MPI-I-93-129.pdf (Any fulltext), 14MB
Sen, S.(1993). Tight bounds for some problems in computational geometry: the complete sub-logarithmic parallel time range (MPI-I-93-129). Saarbrücken: Max-Planck-Institut für Informatik.