The following pages link to Pravin M. Vaidya (Q687083):
Displaying 17 items.
- A scaling technique for finding the weighted analytic center of a polytope (Q687084) (← links)
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations (Q920841) (← links)
- An O(n log n) algorithm for the all-nearest-neighbors problem (Q1115187) (← links)
- On the distribution of comparisons in sorting algorithms (Q1115198) (← links)
- A sparse graph almost as good as the complete graph on points in \(k\) dimensions (Q1814131) (← links)
- Approximate minimum weight matching on points in k-dimensional space (Q1825658) (← links)
- Using geometry to solve the transportation problem in the plane (Q1894300) (← links)
- Speeding up Karmarkar's algorithm for multicommodity flows (Q1915810) (← links)
- A new algorithm for minimizing convex functions over convex sets (Q1918926) (← links)
- A cutting plane algorithm for convex programming that uses analytic centers (Q1922689) (← links)
- (Q2743980) (← links)
- Geometry Helps in Matching (Q3034826) (← links)
- Minimum Spanning Trees in <i>k</i>-Dimensional Space (Q3798263) (← links)
- Space-Time Trade-Offs for Orthogonal Range Queries (Q3833664) (← links)
- Sublinear-Time Parallel Algorithms for Matching and Related Problems (Q4033764) (← links)
- (Q4283446) (← links)
- (Q4735032) (← links)
