Martin Dyer
- 1.M. Ajtai, J. Koml6s, W. Steiger and E. Szemer~di, Deterministic selection in O(loglogn) time, Proc. 18th Ann. Syrup. on Theory of Computing (1986), 188-195. Google Scholar
Digital Library
- 2.M. Ajtai and N. Megiddo, A deterministic poly(log log n)-time n-processor algorithm for linear programming in fixed dimension, Proc. 2~th Ann. Syrup. on Theory of Computing (1992), 327-338. Google ScholarDigital Library
- 3.N. Alon and N. Megiddo, Parallel linear programming almost surely in constant time, Proc. 31st IEEE Syrup. on Foundations of Computer Science (1990), 574- 582.Google ScholarDigital Library
- 4.P. Beame and J. Hastad, Optimal bounds for decision problems on the CRCW PRAM, Proc. 19th Ann. Syrup. on Theory of Computing (1987), 83-93. Google ScholarDigital Library
- 5.B. Chazelle and J. Matou~ek, On lineartime deterministic algorithms for optimization problems in fixed dimension, Proc. J th A CM-SIAM Syrup. on Discrete Algorithms (1993), 281-290. Google ScholarDigital Library
- 6.K. Clarkson, ALas Vegas algorithm for linear programming when the dimension is small, Proc. 29st IEEE Syrup. on Foundations of Computer Science (1988), 452- 456.Google ScholarDigital Library
- 7.K. Clarkson, Linear programming in O(n x 3d2) time, Information Processing Letters 22 (19s6), 21-27. Google ScholarDigital Library
- 8.R. Cole, Parallel merge sort, SIAM J. on Computing 17 (1988), 770-785. Google ScholarDigital Library
- 9.X. Deng, An optimal parallel algorithm for linear programming in the plane, Information Processing Letters 35 (1990), 213-217. Google ScholarDigital Library
- 10.M. Dyer, On a multidimensional search problem and its application to the Euclidean one-centre problem, SIAM J. on Computing 15 (1986), 725-738. Google ScholarDigital Library
- 11.M. Goodrich, Geometric partitioning made easier, even in parallel, Proc. 9th A CM Syrup. on Computational Geometry (1993), 73-82. Google ScholarDigital Library
- 12.R. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, in Handbook of Theoretical Computer Science Vol. A: Algorithms and Complexity, Ed. J. van Leeuwen, Elsevier, Amsterdam, 1990, pp. 869-941. Google ScholarDigital Library
- 13.N. Megiddo, Linear programming in linear time when the dimension is fixed, J. of the ACM31 (1984), 114-127. Google ScholarDigital Library
- 14.L. Valiant, Parallelism in comparison problems, SIAM j. on Computing 4 (1975), 348-355.Google Scholar
Index Terms
- A parallel algorithm for linear programming in fixed dimension
Recommendations
Efficient parallel linear programming
Linear programming and least squares computations are accelerated using author's parallel algorithms for solving linear systems. The implications on the performance of the Karmarkar and the simplex algorithms for dense and sparse linear programs are ...
An object-oriented parallel programming language for distributed-memory parallel computing platforms
In object-oriented programming (OOP) languages, the ability to encapsulate software concerns of the dominant decomposition in objects is the key to reaching high modularity and loss of complexity in large scale designs. However, distributed-memory ...
Comments