Sciweavers

97 search results - page 9 / 20
» icalp 2009
Sort
View
ICALP
2009
Springer
16 years 15 days ago
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
Naoki Kobayashi, C.-H. Luke Ong
ICALP
2009
Springer
16 years 15 days ago
The Ehrenfeucht-Silberger Problem
We consider repetitions in words and solve a longstanding open problem about the relation between the period and the length of its longest unbordered factor. A word u is called bor...
Stepan Holub, Dirk Nowotka
ICALP
2009
Springer
16 years 15 days 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
106
Voted
ICALP
2009
Springer
16 years 15 days 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...
114
Voted
ICALP
2009
Springer
16 years 15 days ago
On a Network Generalization of the Minmax Theorem
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...
Constantinos Daskalakis, Christos H. Papadimitriou