Pravin M. Vaidya

Available identifiers

Publication	Date of Publication	Type
A technique for bounding the number of iterations in path following algorithms	2001-09-18	Paper
A cutting plane algorithm for convex programming that uses analytic centers	1997-02-03	Paper
A new algorithm for minimizing convex functions over convex sets	1996-12-09	Paper
Speeding up Karmarkar's algorithm for multicommodity flows	1996-10-13	Paper
Using geometry to solve the transportation problem in the plane	1995-08-09	Paper
https://portal.mardi4nfdi.de/entity/Q4283446	1994-05-19	Paper
A scaling technique for finding the weighted analytic center of a polytope	1994-03-21	Paper
Sublinear-Time Parallel Algorithms for Matching and Related Problems	1993-05-16	Paper
A sparse graph almost as good as the complete graph on points in \(k\) dimensions	1992-06-25	Paper
An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations	1990-01-01	Paper
Space-Time Trade-Offs for Orthogonal Range Queries	1989-01-01	Paper
Geometry Helps in Matching	1989-01-01	Paper
An O(n log n) algorithm for the all-nearest-neighbors problem	1989-01-01	Paper
Approximate minimum weight matching on points in k-dimensional space	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4735032	1989-01-01	Paper
Minimum Spanning Trees in k-Dimensional Space	1988-01-01	Paper
On the distribution of comparisons in sorting algorithms	1988-01-01	Paper

This page was built for person: Pravin M. Vaidya