Linear programming in O(n × 3d2) time
Information Processing Letters
On a multidimensional search technique and its application to the Euclidean one centre problem
SIAM Journal on Computing
Optimal parallel selection had complexity O(log log N)
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
An optimal parallel algorithm for linear programming in the plane
Information Processing Letters
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
An expander-based approach to geometric optimization
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A parallel algorithm for linear programming in fixed dimension
Proceedings of the eleventh annual symposium on Computational geometry
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
An efficient approximation algorithm for point pattern matching under noise
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |
It is shown that for any fixed number of variables, the linear programming problems with n linear inequalities can be solved deterministically by n parallel processors in sub-logarithmic time. The parallel time bound is O((log log n)d) where d is the number of variables. In the one-dimensional case this bound is optimal.