1331 search results - page 23 / 267 » Complexity bounds for zero-test algorithms |
112
click to vote
STOC
1995
ACM
15 years 6 months ago
1995
ACM
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...
144
Voted
WDAG
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
107
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
132
click to vote
WG
2001
Springer
15 years 7 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
108
Voted
SPAA
2006
ACM
15 years 8 months ago
2006
ACM
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...