| 1996 |
|---|
| 31 | | Sanjiv Kapoor,
Pravin M. Vaidya:
Speeding up Karmarkar's algorithm for multicommodity flows.
Math. Program. 73: 111-127 (1996) |
| 30 | | Pravin M. Vaidya:
A new algorithm for minimizing convex functions over convex sets.
Math. Program. 73: 291-341 (1996) |
| 1995 |
|---|
| 29 | | David S. Atkinson,
Pravin M. Vaidya:
Using Geometry To Solve the Transportation Problem in the Plane.
Algorithmica 13(5): 442-461 (1995) |
| 28 | | David S. Atkinson,
Pravin M. Vaidya:
A cutting plane algorithm for convex programming that uses analytic centers.
Math. Program. 69: 1-43 (1995) |
| 1994 |
|---|
| 27 | EE | Sachin S. Sapatnekar,
Pravin M. Vaidya,
Sung-Mo Kang:
Convexity-based algorithms for design centering.
IEEE Trans. on CAD of Integrated Circuits and Systems 13(12): 1536-1549 (1994) |
| 1993 |
|---|
| 26 | EE | Sachin S. Sapatnekar,
Pravin M. Vaidya,
Steve M. Kang:
Convexity-based algorithms for design centering.
ICCAD 1993: 206-209 |
| 25 | | Sachin S. Sapatnekar,
Pravin M. Vaidya,
Sung-Mo Kang:
Feasible Region Approximation Using Convex Polytopes.
ISCAS 1993: 1786-1789 |
| 24 | EE | Sachin S. Sapatnekar,
Vasant B. Rao,
Pravin M. Vaidya,
Sung-Mo Kang:
An exact solution to the transistor sizing problem for CMOS circuits using convex optimization.
IEEE Trans. on CAD of Integrated Circuits and Systems 12(11): 1621-1634 (1993) |
| 23 | | Andrew V. Goldberg,
Serge A. Plotkin,
Pravin M. Vaidya:
Sublinear-Time Parallel Algorithms for Matching and Related Problems.
J. Algorithms 14(2): 180-213 (1993) |
| 1992 |
|---|
| 22 | EE | Tong Gao,
Pravin M. Vaidya,
C. L. Liu:
A Performance Driven Macro-Cell Placement Algorithm.
DAC 1992: 147-152 |
| 21 | | David S. Atkinson,
Pravin M. Vaidya:
A scaling technique for finding the weighted analytic center of a polytope.
Math. Program. 57: 163-192 (1992) |
| 1991 |
|---|
| 20 | | Sachin S. Sapatnekar,
Vasant B. Rao,
Pravin M. Vaidya:
A Convex Optimization Approach to Transistor Sizing for CMOS Circuits.
ICCAD 1991: 482-485 |
| 19 | | Pravin M. Vaidya:
A sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions.
Discrete & Computational Geometry 6: 369-381 (1991) |
| 1990 |
|---|
| 18 | | Pravin M. Vaidya:
Reducing the Parallel Complexity of Certain Linear Programming Problems (Extended Abstract)
FOCS 1990: 583-589 |
| 17 | | Pravin M. Vaidya:
An Algorithm for Linear Programming which Requires O(((m+n)n2 + (m+n)1.5n)L) Arithmetic Operations.
Math. Program. 47: 175-201 (1990) |
| 1989 |
|---|
| 16 | | Pravin M. Vaidya:
Speeding-Up Linear Programming Using Fast Matrix Multiplication (Extended Abstract)
FOCS 1989: 332-337 |
| 15 | | Pravin M. Vaidya:
A New Algorithm for Minimizing Convex Functions over Convex Sets (Extended Abstract)
FOCS 1989: 338-343 |
| 14 | | Pravin M. Vaidya:
Approximate Minimum Weight Matching on Points in k-Dimensional Space.
Algorithmica 4(4): 569-583 (1989) |
| 13 | | Pravin M. Vaidya:
An O(n log n) Algorithm for the All-nearest.Neighbors Problem.
Discrete & Computational Geometry 4: 101-115 (1989) |
| 12 | | Pravin M. Vaidya:
Space-Time Trade-Offs for Orthogonal Range Queries.
SIAM J. Comput. 18(4): 748-758 (1989) |
| 11 | | Pravin M. Vaidya:
Geometry Helps in Matching.
SIAM J. Comput. 18(6): 1201-1225 (1989) |
| 1988 |
|---|
| 10 | | Andrew V. Goldberg,
Serge A. Plotkin,
Pravin M. Vaidya:
Sublinear-Time Parallel Algorithms for Matching and Related Problems
FOCS 1988: 174-185 |
| 9 | | Pravin M. Vaidya:
Geometry Helps in Matching (Extended Abstract)
STOC 1988: 422-425 |
| 8 | | Dana S. Richards,
Pravin M. Vaidya:
On the Distribution of Comparisons in Sorting Algorithms.
BIT 28(4): 764-774 (1988) |
| 7 | | Pravin M. Vaidya:
Minimum Spanning Trees in k-Dimensional Space.
SIAM J. Comput. 17(3): 572-582 (1988) |
| 1987 |
|---|
| 6 | | Pravin M. Vaidya:
An Algorithm for Linear Programming which Requires O(((m+n)n^2 + (m+n)^1.5 n)L) Arithmetic Operations
STOC 1987: 29-38 |
| 5 | EE | Kenneth L. Clarkson,
Sanjiv Kapoor,
Pravin M. Vaidya:
Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time.
Symposium on Computational Geometry 1987: 251-257 |
| 1986 |
|---|
| 4 | | Pravin M. Vaidya:
An optimal algorithm for the All-Nearest-Neighbors Problem
FOCS 1986: 117-122 |
| 3 | | Sanjiv Kapoor,
Pravin M. Vaidya:
Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows
STOC 1986: 147-159 |
| 1985 |
|---|
| 2 | | Pravin M. Vaidya:
Space-Time Tradeoffs for Orthogonal Range Queries (Extended Abstract)
STOC 1985: 169-174 |
| 1984 |
|---|
| 1 | | Pravin M. Vaidya:
A fast approximation for minimum spanning trees in k-dimensional space
FOCS 1984: 403-407 |
