Pravin M. Vaidya - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

1996

Speeding up Karmarkar s algorithm for multicommodity flowsSanjiv Kapoor, Pravin M. Vaidya. mp, 73:111-127, 1996.

A new algorithm for minimizing convex functions over convex setsPravin M. Vaidya. mp, 73:291-341, 1996.

1995

Using Geometry To Solve the Transportation Problem in the PlaneDavid S. Atkinson, Pravin M. Vaidya. algorithmica, 13(5):442-461, 1995.

A cutting plane algorithm for convex programming that uses analytic centersDavid S. Atkinson, Pravin M. Vaidya. mp, 69:1-43, 1995.

1994

Convexity-based algorithms for design centeringSachin S. Sapatnekar, Pravin M. Vaidya, Sung-Mo Kang. tcad, 13(12):1536-1549, 1994. [doi]

1993

1992

A scaling technique for finding the weighted analytic center of a polytopeDavid S. Atkinson, Pravin M. Vaidya. mp, 57:163-192, 1992.

A Performance Driven Macro-Cell Placement AlgorithmTong Gao, Pravin M. Vaidya, C. L. Liu. dac 1992: 147-152 [doi]

1991

A Fast Implementation of a Path-Following Algorithm for Maximizing a Linear Function over a Network PolytopeAnil Joshi, Arthur S. Goldstein, Pravin M. Vaidya. dimacs 1993: 267-298

A Convex Optimization Approach to Transistor Sizing for CMOS CircuitsSachin S. Sapatnekar, Vasant B. Rao, Pravin M. Vaidya. iccad 1991: 482-485

A sparse Graph Almost as Good as the Complete Graph on Points in K DimensionsPravin M. Vaidya. dcg, 6:369-381, 1991.

1990

Reducing the Parallel Complexity of Certain Linear Programming Problems (Extended Abstract)Pravin M. Vaidya. focs 1990: 583-589

An Algorithm for Linear Programming which Requires O(((m+n)n:::2::: + (m+n):::1.5:::n)L) Arithmetic OperationsPravin M. Vaidya. mp, 47:175-201, 1990.

1989

Speeding-Up Linear Programming Using Fast Matrix Multiplication (Extended Abstract)Pravin M. Vaidya. focs 1989: 332-337

A New Algorithm for Minimizing Convex Functions over Convex Sets (Extended Abstract)Pravin M. Vaidya. focs 1989: 338-343

Space-Time Trade-Offs for Orthogonal Range QueriesPravin M. Vaidya. SICOMP, 18(4):748-758, 1989.

An O(n log n) Algorithm for the All-nearest.Neighbors ProblemPravin M. Vaidya. dcg, 4:101-115, 1989.

Geometry Helps in MatchingPravin M. Vaidya. SICOMP, 18(6):1201-1225, 1989.

Approximate Minimum Weight Matching on Points in k-Dimensional SpacePravin M. Vaidya. algorithmica, 4(4):569-583, 1989.

1988

Sublinear-Time Parallel Algorithms for Matching and Related ProblemsAndrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya. focs 1988: 174-185

On the Distribution of Comparisons in Sorting AlgorithmsDana S. Richards, Pravin M. Vaidya. bit, 28(4):764-774, 1988.

Geometry Helps in Matching (Extended Abstract)Pravin M. Vaidya. stoc 1988: 422-425

Minimum Spanning Trees in k-Dimensional SpacePravin M. Vaidya. SICOMP, 17(3):572-582, 1988.

1987

Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n):::2:::) TimeKenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya. compgeom 1987: 251-257 [doi]

An Algorithm for Linear Programming which Requires O(((m+n)n^2 + (m+n)^1.5 n)L) Arithmetic OperationsPravin M. Vaidya. stoc 1987: 29-38

1986

Fast Algorithms for Convex Quadratic Programming and Multicommodity FlowsSanjiv Kapoor, Pravin M. Vaidya. stoc 1986: 147-159

An optimal algorithm for the All-Nearest-Neighbors ProblemPravin M. Vaidya. focs 1986: 117-122

Topics in Combinatorial Algorithms (Multicommodity Flows, Quadratic Programming)Pravin M. Vaidya. PhD thesis, University of Illinois Urbana-Champaign, USA, 1986. [doi]

1985

Space-Time Tradeoffs for Orthogonal Range Queries (Extended Abstract)Pravin M. Vaidya. stoc 1985: 169-174

1984

A fast approximation for minimum spanning trees in k-dimensional spacePravin M. Vaidya. focs 1984: 403-407

Sign in or sign up to see more results.

runs on WebDSL