ICALP
2009
Springer
15 years 4 days ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
ICALP
2009
Springer
15 years 4 days ago
2009
Springer
A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We s...
ICALP
2009
Springer
15 years 4 days ago
2009
Springer
ICALP
2009
Springer
15 years 4 days ago
2009
Springer
ICALP
2009
Springer
15 years 4 days ago
2009
Springer
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
ICALP
2009
Springer
15 years 4 days ago
2009
Springer
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
ICALP
2009
Springer
15 years 4 days ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
ICALP
2009
Springer
15 years 4 days ago
2009
Springer
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including:
ICALP
2009
Springer
15 years 4 days ago
2009
Springer
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
ICALP
2009
Springer
15 years 4 days ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...