default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPravin M. Vaidya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[j17]Kaushik Gala, David T. Blaauw, Vladimir Zolotov, Pravin M. Vaidya, Anil Joshi:
Inductance model and analysis methodology for high-speed on-chip interconnect. IEEE Trans. Very Large Scale Integr. Syst. 10(6): 730-745 (2002)
1990 – 1999
- 1996
- [j16]Sanjiv Kapoor, Pravin M. Vaidya:
Speeding up Karmarkar's algorithm for multicommodity flows. Math. Program. 73: 111-127 (1996) - [j15]Pravin M. Vaidya:
A new algorithm for minimizing convex functions over convex sets. Math. Program. 73: 291-341 (1996) - 1995
- [j14]David S. Atkinson, Pravin M. Vaidya:
Using Geometry To Solve the Transportation Problem in the Plane. Algorithmica 13(5): 442-461 (1995) - [j13]David S. Atkinson, Pravin M. Vaidya:
A cutting plane algorithm for convex programming that uses analytic centers. Math. Program. 69: 1-43 (1995) - 1994
- [j12]Sachin S. Sapatnekar
, Pravin M. Vaidya, Sung-Mo Kang:
Convexity-based algorithms for design centering. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(12): 1536-1549 (1994) - 1993
- [j11]Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya:
Sublinear-Time Parallel Algorithms for Matching and Related Problems. J. Algorithms 14(2): 180-213 (1993) - [j10]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. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 12(11): 1621-1634 (1993) - [c16]Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. Kang:
Convexity-based algorithms for design centering. ICCAD 1993: 206-209 - [c15]Sachin S. Sapatnekar, Pravin M. Vaidya, Sung-Mo Kang:
Feasible Region Approximation Using Convex Polytopes. ISCAS 1993: 1786-1789 - 1992
- [j9]David S. Atkinson, Pravin M. Vaidya:
A scaling technique for finding the weighted analytic center of a polytope. Math. Program. 57: 163-192 (1992) - [c14]Tong Gao, Pravin M. Vaidya, C. L. Liu:
A Performance Driven Macro-Cell Placement Algorithm. DAC 1992: 147-152 - 1991
- [j8]Pravin M. Vaidya:
A sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions. Discret. Comput. Geom. 6: 369-381 (1991) - [c13]Anil Joshi, Arthur S. Goldstein, Pravin M. Vaidya:
A Fast Implementation of a Path-Following Algorithm for Maximizing a Linear Function over a Network Polytope. Network Flows And Matching 1991: 267-298 - [c12]Sachin S. Sapatnekar, Vasant B. Rao, Pravin M. Vaidya:
A Convex Optimization Approach to Transistor Sizing for CMOS Circuits. ICCAD 1991: 482-485 - 1990
- [j7]Pravin M. Vaidya:
An Algorithm for Linear Programming which Requires O(((m+n)n2 + (m+n)1.5n)L) Arithmetic Operations. Math. Program. 47: 175-201 (1990) - [c11]Pravin M. Vaidya:
Reducing the Parallel Complexity of Certain Linear Programming Problems (Extended Abstract). FOCS 1990: 583-589
1980 – 1989
- 1989
- [j6]Pravin M. Vaidya:
Approximate Minimum Weight Matching on Points in k-Dimensional Space. Algorithmica 4(4): 569-583 (1989) - [j5]Pravin M. Vaidya:
An O(n log n) Algorithm for the All-nearest.Neighbors Problem. Discret. Comput. Geom. 4: 101-115 (1989) - [j4]Pravin M. Vaidya:
Space-Time Trade-Offs for Orthogonal Range Queries. SIAM J. Comput. 18(4): 748-758 (1989) - [j3]Pravin M. Vaidya:
Geometry Helps in Matching. SIAM J. Comput. 18(6): 1201-1225 (1989) - [c10]Pravin M. Vaidya:
Speeding-Up Linear Programming Using Fast Matrix Multiplication (Extended Abstract). FOCS 1989: 332-337 - [c9]Pravin M. Vaidya:
A New Algorithm for Minimizing Convex Functions over Convex Sets (Extended Abstract). FOCS 1989: 338-343 - 1988
- [j2]Dana S. Richards, Pravin M. Vaidya:
On the Distribution of Comparisons in Sorting Algorithms. BIT 28(4): 764-774 (1988) - [j1]Pravin M. Vaidya:
Minimum Spanning Trees in k-Dimensional Space. SIAM J. Comput. 17(3): 572-582 (1988) - [c8]Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya:
Sublinear-Time Parallel Algorithms for Matching and Related Problems. FOCS 1988: 174-185 - [c7]Pravin M. Vaidya:
Geometry Helps in Matching (Extended Abstract). STOC 1988: 422-425 - 1987
- [c6]Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya:
Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time. SCG 1987: 251-257 - [c5]Pravin M. Vaidya:
An Algorithm for Linear Programming which Requires O(((m+n)n^2 + (m+n)^1.5 n)L) Arithmetic Operations. STOC 1987: 29-38 - 1986
- [b1]Pravin M. Vaidya:
Topics in Combinatorial Algorithms (Multicommodity Flows, Quadratic Programming). University of Illinois Urbana-Champaign, USA, 1986 - [c4]Pravin M. Vaidya:
An optimal algorithm for the All-Nearest-Neighbors Problem. FOCS 1986: 117-122 - [c3]Sanjiv Kapoor, Pravin M. Vaidya:
Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows. STOC 1986: 147-159 - 1985
- [c2]Pravin M. Vaidya:
Space-Time Tradeoffs for Orthogonal Range Queries (Extended Abstract). STOC 1985: 169-174 - 1984
- [c1]Pravin M. Vaidya:
A fast approximation for minimum spanning trees in k-dimensional space. FOCS 1984: 403-407
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
