Pravin M. Vaidya

Publication Activity (10 Years)

Years Active: 1984-2002
Publications (10 Years): 0

Publications

Kaushik Gala, David T. Blaauw, Vladimir Zolotov, Pravin M. Vaidya, Anil Joshi
Inductance model and analysis methodology for high-speed on-chip interconnect. IEEE Trans. Very Large Scale Integr. Syst. 10 (6) (2002)
Pravin M. Vaidya
A new algorithm for minimizing convex functions over convex sets. Math. Program. 73 (1996)
Sanjiv Kapoor, Pravin M. Vaidya
Speeding up Karmarkar's algorithm for multicommodity flows. Math. Program. 73 (1996)
David S. Atkinson, Pravin M. Vaidya
A cutting plane algorithm for convex programming that uses analytic centers. Math. Program. 69 (1995)
David S. Atkinson, Pravin M. Vaidya
Using Geometry To Solve the Transportation Problem in the Plane. Algorithmica 13 (5) (1995)
Sachin S. Sapatnekar, Pravin M. Vaidya, Sung-Mo Kang
Convexity-based algorithms for design centering. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13 (12) (1994)
Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya
Sublinear-Time Parallel Algorithms for Matching and Related Problems. J. Algorithms 14 (2) (1993)
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. Comput. Aided Des. Integr. Circuits Syst. 12 (11) (1993)
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. Kang
Convexity-based algorithms for design centering. ICCAD (1993)
Sachin S. Sapatnekar, Pravin M. Vaidya, Sung-Mo Kang
Feasible Region Approximation Using Convex Polytopes. ISCAS (1993)
Tong Gao, Pravin M. Vaidya, C. L. Liu
A Performance Driven Macro-Cell Placement Algorithm. DAC (1992)
David S. Atkinson, Pravin M. Vaidya
A scaling technique for finding the weighted analytic center of a polytope. Math. Program. 57 (1992)
Anil Joshi, Arthur S. Goldstein, Pravin M. Vaidya
A Fast Implementation of a Path-Following Algorithm for Maximizing a Linear Function over a Network Polytope. Network Flows And Matching (1991)
Pravin M. Vaidya
A sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions. Discret. Comput. Geom. 6 (1991)
Sachin S. Sapatnekar, Vasant B. Rao, Pravin M. Vaidya
A Convex Optimization Approach to Transistor Sizing for CMOS Circuits. ICCAD (1991)
Pravin M. Vaidya
n)L) Arithmetic Operations. Math. Program. 47 (1990)
Pravin M. Vaidya
Reducing the Parallel Complexity of Certain Linear Programming Problems (Extended Abstract) FOCS (1990)
Pravin M. Vaidya
Space-Time Trade-Offs for Orthogonal Range Queries. SIAM J. Comput. 18 (4) (1989)
Pravin M. Vaidya
A New Algorithm for Minimizing Convex Functions over Convex Sets (Extended Abstract) FOCS (1989)
Pravin M. Vaidya
An O(n log n) Algorithm for the All-nearest.Neighbors Problem. Discret. Comput. Geom. 4 (1989)
Pravin M. Vaidya
Speeding-Up Linear Programming Using Fast Matrix Multiplication (Extended Abstract) FOCS (1989)
Pravin M. Vaidya
Approximate Minimum Weight Matching on Points in k-Dimensional Space. Algorithmica 4 (4) (1989)
Pravin M. Vaidya
Geometry Helps in Matching. SIAM J. Comput. 18 (6) (1989)
Dana S. Richards, Pravin M. Vaidya
On the Distribution of Comparisons in Sorting Algorithms. BIT 28 (4) (1988)
Pravin M. Vaidya
Minimum Spanning Trees in k-Dimensional Space. SIAM J. Comput. 17 (3) (1988)
Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya
Sublinear-Time Parallel Algorithms for Matching and Related Problems FOCS (1988)
Pravin M. Vaidya
Geometry Helps in Matching (Extended Abstract) STOC (1988)
Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya
) Time. SCG (1987)
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)
Pravin M. Vaidya
An optimal algorithm for the All-Nearest-Neighbors Problem FOCS (1986)
Sanjiv Kapoor, Pravin M. Vaidya
Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows STOC (1986)
Pravin M. Vaidya
Space-Time Tradeoffs for Orthogonal Range Queries (Extended Abstract) STOC (1985)
Pravin M. Vaidya
A fast approximation for minimum spanning trees in k-dimensional space FOCS (1984)