Some of Pravin M. Vaidya’s Publications (dblp)

• Solving linear equations with symmetric diagonally dominant matrices by constructing good preconditioners
  Pravin M. Vaidya
  Unpublished manuscript

• Reducing the Parallel Complexity of Certain Linear Programming Problems
  Pravin M. Vaidya
  FOCS ‘90

• Approximate Minimum Weight Matching on Points in k-Dimensional Space
  Pravin M. Vaidya
  Algorithmica ‘89

• Speeding-Up Linear Programming Using Fast Matrix Multiplication
  Pravin M. Vaidya
  FOCS ‘89

• A New Algorithm for Minimizing Convex Functions over Convex Sets
  Pravin M. Vaidya
  FOCS ‘89 MP ‘96

• On the Distribution of Comparisons in Sorting Algorithms
  Dana S. Richards, Pravin M. Vaidya
  BIT ‘88

• Sublinear-Time Parallel Algorithms for Matching and Related Problems
  Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya
  FOCS ‘88 JALG ‘93

• Geometry Helps in Matching
  Pravin M. Vaidya
  STOC ‘88 SICOMP ‘89

• Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)^2) Time
  Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya
  SCG ‘87

• An Algorithm for Linear Programming which Requires O(((m+n)n^2 + (m+n)^1.5 n)L) Arithmetic Operations
  Pravin M. Vaidya
  STOC ‘87 MP ‘90

• An optimal algorithm for the All-Nearest-Neighbors Problem
  Pravin M. Vaidya
  FOCS ‘86 DCG ‘89

• Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows
  Sanjiv Kapoor, Pravin M. Vaidya
  STOC ‘86 MP ‘96

• Space-Time Trade-Offs for Orthogonal Range Queries
  Pravin M. Vaidya
  STOC ‘85 SICOMP ‘89

• A fast approximation for minimum spanning trees in k-dimensional space
  Pravin M. Vaidya
  FOCS ‘84 SICOMP ‘88