119 search results - page 17 / 24 » stoc 2010 |
136
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
STOC
2010
ACM
15 years 4 days ago
2010
ACM
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
113
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
101
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
109
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...