Pravin M. Vaidya

According to our database, Pravin M. Vaidya authored at least 33 papers between 1984 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2002

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

1996

A new algorithm for minimizing convex functions over convex sets.

Pravin M. Vaidya

Math. Program., 1996

Speeding up Karmarkar's algorithm for multicommodity flows.

Sanjiv Kapoor, Pravin M. Vaidya

Math. Program., 1996

1995

A cutting plane algorithm for convex programming that uses analytic centers.

David S. Atkinson, Pravin M. Vaidya

Math. Program., 1995

Using Geometry To Solve the Transportation Problem in the Plane.

David S. Atkinson, Pravin M. Vaidya

Algorithmica, 1995

1994

Convexity-based algorithms for design centering.

Sachin S. Sapatnekar, Pravin M. Vaidya, Sung-Mo Kang

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1994

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

Sublinear-Time Parallel Algorithms for Matching and Related Problems.

Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya

J. Algorithms, 1993

Feasible Region Approximation Using Convex Polytopes.

Sachin S. Sapatnekar, Pravin M. Vaidya, Sung-Mo Kang

Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993

Convexity-based algorithms for design centering.

Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. Kang

Proceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design, 1993

1992

A scaling technique for finding the weighted analytic center of a polytope.

David S. Atkinson, Pravin M. Vaidya

Math. Program., 1992

A Performance Driven Macro-Cell Placement Algorithm.

Tong Gao, Pravin M. Vaidya, C. L. Liu

Proceedings of the 29th Design Automation Conference, 1992

1991

A sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions.

Pravin M. Vaidya

Discret. Comput. Geom., 1991

A Convex Optimization Approach to Transistor Sizing for CMOS Circuits.

Sachin S. Sapatnekar, Vasant B. Rao, Pravin M. Vaidya

Proceedings of the 1991 IEEE/ACM International Conference on Computer-Aided Design, 1991

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

Proceedings of the Network Flows And Matching, 1991

1990

An Algorithm for Linear Programming which Requires O(((m+n)n² + (m+n)^1.5n)L) Arithmetic Operations.

Pravin M. Vaidya

Math. Program., 1990

Reducing the Parallel Complexity of Certain Linear Programming Problems (Extended Abstract)

Pravin M. Vaidya

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

Geometry Helps in Matching.

Pravin M. Vaidya

SIAM J. Comput., 1989

Space-Time Trade-Offs for Orthogonal Range Queries.

Pravin M. Vaidya

SIAM J. Comput., 1989

An O(n log n) Algorithm for the All-nearest.Neighbors Problem.

Pravin M. Vaidya

Discret. Comput. Geom., 1989

Approximate Minimum Weight Matching on Points in k-Dimensional Space.

Pravin M. Vaidya

Algorithmica, 1989

A New Algorithm for Minimizing Convex Functions over Convex Sets (Extended Abstract)

Pravin M. Vaidya

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Speeding-Up Linear Programming Using Fast Matrix Multiplication (Extended Abstract)

Pravin M. Vaidya

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

Minimum Spanning Trees in k-Dimensional Space.

Pravin M. Vaidya

SIAM J. Comput., 1988

On the Distribution of Comparisons in Sorting Algorithms.

Dana S. Richards, Pravin M. Vaidya

BIT, 1988

Geometry Helps in Matching (Extended Abstract)

Pravin M. Vaidya

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1987

An Algorithm for Linear Programming which Requires O(((m+n)n^2 + (m+n)^1.5 n)L) Arithmetic Operations

Pravin M. Vaidya

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)²) Time.

Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986

Topics in Combinatorial Algorithms (Multicommodity Flows, Quadratic Programming)

Pravin M. Vaidya

PhD thesis, 1986

Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows

Sanjiv Kapoor, Pravin M. Vaidya

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

An optimal algorithm for the All-Nearest-Neighbors Problem

Pravin M. Vaidya

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985

Space-Time Tradeoffs for Orthogonal Range Queries (Extended Abstract)

Pravin M. Vaidya

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1984

A fast approximation for minimum spanning trees in k-dimensional space

Pravin M. Vaidya

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984