Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ICALP
2009
Springer
11 years 4 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
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...
Alexander Fanghänel, Berthold Vöcking, T...
ICALP
2009
Springer
11 years 4 months ago
A Survey of Stochastic Games with Limsup and Liminf Objectives
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...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
ICALP
2009
Springer
11 years 4 months ago
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian...
ICALP
2009
Springer
11 years 4 months ago
On Regular Temporal Logics with Past,
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...
Christian Dax, Felix Klaedtke, Martin Lange
ICALP
2009
Springer
11 years 4 months ago
A Distributed and Oblivious Heap
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...
Christian Scheideler, Stefan Schmid
ICALP
2009
Springer
11 years 4 months ago
Counting Subgraphs via Homomorphisms
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...
Omid Amini, Fedor V. Fomin, Saket Saurabh
ICALP
2009
Springer
11 years 4 months ago
Unconditional Lower Bounds against Advice
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including:
Harry Buhrman, Lance Fortnow, Rahul Santhanam
ICALP
2009
Springer
11 years 4 months ago
Learning Halfspaces with Malicious Noise
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....
Adam R. Klivans, Philip M. Long, Rocco A. Servedio
ICALP
2009
Springer
11 years 4 months ago
Towards Optimal Range Medians
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...
Beat Gfeller, Peter Sanders
books