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
Partition trees for triangle counting and other range searching problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
A randomized algorithm for fixed-dimensional linear programming
Mathematical Programming: Series A and B
Linear programming with two variables per inequality in poly-log time
SIAM Journal on Computing
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Random Structures & Algorithms
Resource constraints on computation and communication in the brain
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Sorting, searching, and simulation in the mapreduce framework
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Dynamic power management for multidomain system-on-chip platforms: An optimal control approach
ACM Transactions on Design Automation of Electronic Systems (TODAES) - Special Section on Networks on Chip: Architecture, Tools, and Methodologies
Algorithms and hardness results for parallel large margin learning
The Journal of Machine Learning Research
| Hi-index | 0.00 |
For any fixed dimension d, thelinear programming problem with ninequality constraints can be solved on a probabilistic CRCW PRAM withO(n)processors almost surely in constant time. The algorithm always findsthe correct solution. Withnd/log2dprocessors, the probability that the algorithm will not finish withinO(d2log2dtime tends to zero exponentially withn.—Authors' Abstract