Pravin M. Vaidya

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