Skip to content
cs-conference-ranking.org

Pravin M. Vaidya

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

14

Venues

5

Active years

1984–1993

Best venue rank

A*

Where they publish

Papers

14 indexed papers, newest first.

YearVenueTitleAuthors
1993ICCADConvexity-based algorithms for design centering.Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. Kang
1993ISCASFeasible Region Approximation Using Convex Polytopes.Sachin S. Sapatnekar, Pravin M. Vaidya, Sung-Mo Kang
1992DACA Performance Driven Macro-Cell Placement Algorithm.Tong Gao, Pravin M. Vaidya, C. L. Liu
1991ICCADA Convex Optimization Approach to Transistor Sizing for CMOS Circuits.Sachin S. Sapatnekar, Vasant B. Rao, Pravin M. Vaidya
1990FOCSReducing the Parallel Complexity of Certain Linear Programming Problems (Extended Abstract)Pravin M. Vaidya
1989FOCSSpeeding-Up Linear Programming Using Fast Matrix Multiplication (Extended Abstract)Pravin M. Vaidya
1989FOCSA New Algorithm for Minimizing Convex Functions over Convex Sets (Extended Abstract)Pravin M. Vaidya
1988FOCSSublinear-Time Parallel Algorithms for Matching and Related ProblemsAndrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya
1988STOCGeometry Helps in Matching (Extended Abstract)Pravin M. Vaidya
1987STOCAn Algorithm for Linear Programming which Requires O(((m+n)n^2 + (m+n)^1.5 n)L) Arithmetic OperationsPravin M. Vaidya
1986FOCSAn optimal algorithm for the All-Nearest-Neighbors ProblemPravin M. Vaidya
1986STOCFast Algorithms for Convex Quadratic Programming and Multicommodity FlowsSanjiv Kapoor, Pravin M. Vaidya
1985STOCSpace-Time Tradeoffs for Orthogonal Range Queries (Extended Abstract)Pravin M. Vaidya
1984FOCSA fast approximation for minimum spanning trees in k-dimensional spacePravin M. Vaidya