Pravin M. Vaidya

zbMath Openvaidya.pravin-mMaRDI QIDQ687083

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

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 Mathematical Programming. Series A. Series B	1997-02-03	Paper
A new algorithm for minimizing convex functions over convex sets Mathematical Programming. Series A. Series B	1996-12-09	Paper
Speeding up Karmarkar's algorithm for multicommodity flows Mathematical Programming. Series A. Series B	1996-10-13	Paper
Using geometry to solve the transportation problem in the plane Algorithmica	1995-08-09	Paper
scientific article; zbMATH DE number 515932 (Why is no real title available?)	1994-05-19	Paper
A scaling technique for finding the weighted analytic center of a polytope Mathematical Programming. Series A. Series B	1994-03-21	Paper
Sublinear-Time Parallel Algorithms for Matching and Related Problems Journal of Algorithms	1993-05-16	Paper
A sparse graph almost as good as the complete graph on points in \(k\) dimensions Discrete \& Computational Geometry	1992-06-25	Paper
An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations Mathematical Programming. Series A. Series B	1990-01-01	Paper
Space-Time Trade-Offs for Orthogonal Range Queries SIAM Journal on Computing	1989-01-01	Paper
Geometry Helps in Matching SIAM Journal on Computing	1989-01-01	Paper
An O(n log n) algorithm for the all-nearest-neighbors problem Discrete \& Computational Geometry	1989-01-01	Paper
Approximate minimum weight matching on points in k-dimensional space Algorithmica	1989-01-01	Paper
scientific article; zbMATH DE number 4121751 (Why is no real title available?)	1989-01-01	Paper
Minimum Spanning Trees in k-Dimensional Space SIAM Journal on Computing	1988-01-01	Paper
On the distribution of comparisons in sorting algorithms BIT	1988-01-01	Paper

Research outcomes over time

This page was built for person: Pravin M. Vaidya