SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Pravin M. Vaidya: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Pravin M. Vaidya
Space-Time Tradeoffs for Orthogonal Range Queries (Extended Abstract) [Citation Graph (2, 0)][DBLP]
STOC, 1985, pp:169-174 [Conf]
Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya
Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)²) Time. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1987, pp:251-257 [Conf]
Tong Gao, Pravin M. Vaidya, C. L. Liu
A Performance Driven Macro-Cell Placement Algorithm. [Citation Graph (0, 0)][DBLP]
DAC, 1992, pp:147-152 [Conf]
Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya
Sublinear-Time Parallel Algorithms for Matching and Related Problems [Citation Graph (0, 0)][DBLP]
FOCS, 1988, pp:174-185 [Conf]
Pravin M. Vaidya
A fast approximation for minimum spanning trees in k-dimensional space [Citation Graph (0, 0)][DBLP]
FOCS, 1984, pp:403-407 [Conf]
Pravin M. Vaidya
An optimal algorithm for the All-Nearest-Neighbors Problem [Citation Graph (0, 0)][DBLP]
FOCS, 1986, pp:117-122 [Conf]
Pravin M. Vaidya
Speeding-Up Linear Programming Using Fast Matrix Multiplication (Extended Abstract) [Citation Graph (0, 0)][DBLP]
FOCS, 1989, pp:332-337 [Conf]
Pravin M. Vaidya
A New Algorithm for Minimizing Convex Functions over Convex Sets (Extended Abstract) [Citation Graph (0, 0)][DBLP]
FOCS, 1989, pp:338-343 [Conf]
Pravin M. Vaidya
Reducing the Parallel Complexity of Certain Linear Programming Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP]
FOCS, 1990, pp:583-589 [Conf]
Sachin S. Sapatnekar, Vasant B. Rao, Pravin M. Vaidya
A Convex Optimization Approach to Transistor Sizing for CMOS Circuits. [Citation Graph (0, 0)][DBLP]
ICCAD, 1991, pp:482-485 [Conf]
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. Kang
Convexity-based algorithms for design centering. [Citation Graph (0, 0)][DBLP]
ICCAD, 1993, pp:206-209 [Conf]
Sachin S. Sapatnekar, Pravin M. Vaidya, Sung-Mo Kang
Feasible Region Approximation Using Convex Polytopes. [Citation Graph (0, 0)][DBLP]
ISCAS, 1993, pp:1786-1789 [Conf]
Sanjiv Kapoor, Pravin M. Vaidya
Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows [Citation Graph (0, 0)][DBLP]
STOC, 1986, pp:147-159 [Conf]
Pravin M. Vaidya
An Algorithm for Linear Programming which Requires O(((m+n)n^2 + (m+n)^1.5 n)L) Arithmetic Operations [Citation Graph (0, 0)][DBLP]
STOC, 1987, pp:29-38 [Conf]
Pravin M. Vaidya
Geometry Helps in Matching (Extended Abstract) [Citation Graph (0, 0)][DBLP]
STOC, 1988, pp:422-425 [Conf]
David S. Atkinson, Pravin M. Vaidya
Using Geometry To Solve the Transportation Problem in the Plane. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1995, v:13, n:5, pp:442-461 [Journal]
Pravin M. Vaidya
Approximate Minimum Weight Matching on Points in k-Dimensional Space. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1989, v:4, n:4, pp:569-583 [Journal]
Dana S. Richards, Pravin M. Vaidya
On the Distribution of Comparisons in Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
BIT, 1988, v:28, n:4, pp:764-774 [Journal]
Pravin M. Vaidya
An O(n log n) Algorithm for the All-nearest.Neighbors Problem. [Citation Graph (0, 0)][DBLP]
Discrete & Computational Geometry, 1989, v:4, n:, pp:101-115 [Journal]
Pravin M. Vaidya
A sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions. [Citation Graph (0, 0)][DBLP]
Discrete & Computational Geometry, 1991, v:6, n:, pp:369-381 [Journal]
Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya
Sublinear-Time Parallel Algorithms for Matching and Related Problems. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1993, v:14, n:2, pp:180-213 [Journal]
David S. Atkinson, Pravin M. Vaidya
A scaling technique for finding the weighted analytic center of a polytope. [Citation Graph (0, 0)][DBLP]
Math. Program., 1992, v:57, n:, pp:163-192 [Journal]
David S. Atkinson, Pravin M. Vaidya
A cutting plane algorithm for convex programming that uses analytic centers. [Citation Graph (0, 0)][DBLP]
Math. Program., 1995, v:69, n:, pp:1-43 [Journal]
Sanjiv Kapoor, Pravin M. Vaidya
Speeding up Karmarkar's algorithm for multicommodity flows. [Citation Graph (0, 0)][DBLP]
Math. Program., 1996, v:73, n:, pp:111-127 [Journal]
Pravin M. Vaidya
An Algorithm for Linear Programming which Requires O(((m+n)n² + (m+n)^1.5n)L) Arithmetic Operations. [Citation Graph (0, 0)][DBLP]
Math. Program., 1990, v:47, n:, pp:175-201 [Journal]
Pravin M. Vaidya
A new algorithm for minimizing convex functions over convex sets. [Citation Graph (0, 0)][DBLP]
Math. Program., 1996, v:73, n:, pp:291-341 [Journal]
Pravin M. Vaidya
Minimum Spanning Trees in k-Dimensional Space. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1988, v:17, n:3, pp:572-582 [Journal]
Pravin M. Vaidya
Space-Time Trade-Offs for Orthogonal Range Queries. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1989, v:18, n:4, pp:748-758 [Journal]
Pravin M. Vaidya
Geometry Helps in Matching. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1989, v:18, n:6, pp:1201-1225 [Journal]
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. [Citation Graph (0, 0)][DBLP]
IEEE Trans. on CAD of Integrated Circuits and Systems, 1993, v:12, n:11, pp:1621-1634 [Journal]
Sachin S. Sapatnekar, Pravin M. Vaidya, Sung-Mo Kang
Convexity-based algorithms for design centering. [Citation Graph (0, 0)][DBLP]
IEEE Trans. on CAD of Integrated Circuits and Systems, 1994, v:13, n:12, pp:1536-1549 [Journal]

Search in 0.002secs, Finished in 0.003secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP