A fast approximation for minimum spanning trees in k-dimensional space - Pravin M. Vaidya (FOCS, 1984)

Space-Time Tradeoffs for Orthogonal Range Queries (Extended Abstract) - Pravin M. Vaidya (STOC, 1985)

An optimal algorithm for the All-Nearest-Neighbors Problem - Pravin M. Vaidya (FOCS, 1986)

Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows - Sanjiv Kapoor; Pravin M. Vaidya (STOC, 1986)

Topics in Combinatorial Algorithms (Multicommodity Flows, Quadratic Programming) - Pravin M. Vaidya (1986)

Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time. - Kenneth L. Clarkson; Sanjiv Kapoor; Pravin M. Vaidya (SCG, 1987)

An Algorithm for Linear Programming which Requires O(((m+n)n^2 + (m+n)^1.5 n)L) Arithmetic Operations - Pravin M. Vaidya (STOC, 1987)

Geometry Helps in Matching (Extended Abstract) - Pravin M. Vaidya (STOC, 1988)

On the Distribution of Comparisons in Sorting Algorithms. - Dana S. Richards; Pravin M. Vaidya (BIT, 1988)

Minimum Spanning Trees in k-Dimensional Space. - Pravin M. Vaidya (SIAM J. Comput., 1988)

Speeding-Up Linear Programming Using Fast Matrix Multiplication (Extended Abstract) - Pravin M. Vaidya (FOCS, 1989)

A New Algorithm for Minimizing Convex Functions over Convex Sets (Extended Abstract) - Pravin M. Vaidya (FOCS, 1989)

Approximate Minimum Weight Matching on Points in k-Dimensional Space. - Pravin M. Vaidya (Algorithmica, 1989)

An O(n log n) Algorithm for the All-nearest.Neighbors Problem. - Pravin M. Vaidya (Discret. Comput. Geom., 1989)

Space-Time Trade-Offs for Orthogonal Range Queries. - Pravin M. Vaidya (SIAM J. Comput., 1989)

Geometry Helps in Matching. - Pravin M. Vaidya (SIAM J. Comput., 1989)

Reducing the Parallel Complexity of Certain Linear Programming Problems (Extended Abstract) - Pravin M. Vaidya (FOCS, 1990)

An Algorithm for Linear Programming which Requires O(((m+n)n2 + (m+n)1.5n)L) Arithmetic Operations. - Pravin M. Vaidya (Math. Program., 1990)

A Fast Implementation of a Path-Following Algorithm for Maximizing a Linear Function over a Network Polytope. - Anil Joshi; Arthur S. Goldstein; Pravin M. Vaidya (Network Flows And Matching, 1991)

A Convex Optimization Approach to Transistor Sizing for CMOS Circuits. - Sachin S. Sapatnekar; Vasant B. Rao; Pravin M. Vaidya (ICCAD, 1991)

A sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions. - Pravin M. Vaidya (Discret. Comput. Geom., 1991)

A Performance Driven Macro-Cell Placement Algorithm. - Tong Gao; Pravin M. Vaidya; C. L. Liu 001 (DAC, 1992)

A scaling technique for finding the weighted analytic center of a polytope. - David S. Atkinson; Pravin M. Vaidya (Math. Program., 1992)

Convexity-based algorithms for design centering. - Sachin S. Sapatnekar; Pravin M. Vaidya; Steve M. Kang (ICCAD, 1993)

Feasible Region Approximation Using Convex Polytopes. - Sachin S. Sapatnekar; Pravin M. Vaidya; Sung-Mo Kang (ISCAS, 1993)

Sublinear-Time Parallel Algorithms for Matching and Related Problems. - Andrew V. Goldberg; Serge A. Plotkin; Pravin M. Vaidya (J. Algorithms, 1993)

An exact solution to the transistor sizing problem for CMOS circuits using convex optimization. - Sachin S. Sapatnekar; Vasant B. Rao; Pravin M. Vaidya; Sung-Mo Kang (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1993)

Convexity-based algorithms for design centering. - Sachin S. Sapatnekar; Pravin M. Vaidya; Sung-Mo Kang (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1994)

Using Geometry To Solve the Transportation Problem in the Plane. - David S. Atkinson; Pravin M. Vaidya (Algorithmica, 1995)

A cutting plane algorithm for convex programming that uses analytic centers. - David S. Atkinson; Pravin M. Vaidya (Math. Program., 1995)

Speeding up Karmarkar's algorithm for multicommodity flows. - Sanjiv Kapoor; Pravin M. Vaidya (Math. Program., 1996)

A new algorithm for minimizing convex functions over convex sets. - Pravin M. Vaidya (Math. Program., 1996)

Inductance model and analysis methodology for high-speed on-chip interconnect. - Kaushik Gala; David T. Blaauw; Vladimir Zolotov; Pravin M. Vaidya; Anil Joshi (IEEE Trans. Very Large Scale Integr. Syst., 2002)