674 search results - page 77 / 135 » The computational complexity of the parallel knock-out probl... |
126
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
109
click to vote
PODC
2005
ACM
15 years 7 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
113
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
CONCUR
1999
Springer
15 years 5 months ago
1999
Springer
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...
104
click to vote
STOC
1989
ACM
15 years 5 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...