3 search results - page 1 / 1 » Parallel Linear Programming in Fixed Dimension Almost Surely... |
191
Voted
FOCS
1990
IEEE
15 years 11 months ago
1990
IEEE
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
185
Voted
PODC
2005
ACM
16 years 16 days ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
169
Voted
COMPGEOM
2010
ACM
16 years 1 days ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...