Pravin M. Vaidya
According to our database1,
Pravin M. Vaidya
authored at least 33 papers
between 1984 and 2002.
Collaborative distances:
Collaborative distances:
Timeline
1984
1986
1988
1990
1992
1994
1996
1998
2000
2002
0
1
2
3
4
5
6
7
1
2
2
1
2
1
1
1
4
2
2
1
2
1
2
1
2
2
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2002
IEEE Trans. Very Large Scale Integr. Syst., 2002
1996
Math. Program., 1996
1995
Math. Program., 1995
1994
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1994
1993
An exact solution to the transistor sizing problem for CMOS circuits using convex optimization.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1993
J. Algorithms, 1993
Feasible Region Approximation Using Convex Polytopes.
Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993
Proceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design, 1993
1992
Math. Program., 1992
Proceedings of the 29th Design Automation Conference, 1992
1991
Discret. Comput. Geom., 1991
Proceedings of the 1991 IEEE/ACM International Conference on Computer-Aided Design, 1991
A Fast Implementation of a Path-Following Algorithm for Maximizing a Linear Function over a Network Polytope.
Proceedings of the Network Flows And Matching, 1991
1990
An Algorithm for Linear Programming which Requires O(((m+n)n<sup>2</sup> + (m+n)<sup>1.5</sup>n)L) Arithmetic Operations.
Math. Program., 1990
Reducing the Parallel Complexity of Certain Linear Programming Problems (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
1989
Discret. Comput. Geom., 1989
Algorithmica, 1989
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
1988
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988
1987
An Algorithm for Linear Programming which Requires O(((m+n)n^2 + (m+n)^1.5 n)L) Arithmetic Operations
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987
Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)<sup>2</sup>) Time.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987
1986
PhD thesis, 1986
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986
1985
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985
1984
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984