Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference20 articles.
1. [AS] C. R. Aragon and R. G. Seidel, Randomized Search Trees,Proc. 30th IEEE Symp. on Foundations of Computer Science (1989), pp. 540–545.
2. [CK] D. R. Chand and S. S. Kapur, An Algorithm for Convex Polytopes,J. Assoc. Comput. Mach. 17 (1970), 78–86.
3. [C1] K. L. Clarkson, Linear Programming inO(n3 d2) Time,Inform. Process. Lett. 22 (1986), 21–24.
4. [C2] K. L. Clarkson, Las Vegas Algorithms for Linear and Integer Programming when the Dimension is Small, Manuscript(Oct. 1989): a preliminary version appeared inProc. 29th IEEE Symp. on Foundations of Computer Science (1988), pp. 452–456.
5. [CS] K. L. Clarkson and P. W. Shor, Applications of Random Sampling in Computational Geometry, II,Discrete Comput. Geom. 4 (1989), 387–422.
Cited by
148 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献