ACM - Normas
K Clarkson
Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC ’85
Optimal Expected-Time Algorithms for Closest Point Problems
Linear programming in O(n × 3d2) time
An Algorithm for Convex Polytopes
Applications of a planar separator theorem
Linear Programming in Linear Time When the Dimension Is Fixed