Titlebook: Automata, Languages, and Programming; 41st International C Javier Esparza,Pierre Fraigniaud,Elias Koutsoupias Conference proceedings 2014 S

occurrence

nugatory

Atrium

干旱

The Complexity of Ergodic Mean-payoff Gamesy-iteration algorithm by Hoffman and Karp; show that both our algorithm and the classical value-iteration algorithm can approximate the value in exponential time; and identify a subclass where the value-iteration algorithm is a FPTAS. We also show that the exact value can be expressed in the existen

經(jīng)典

Unary Pushdown Automata and Straight-Line Programsin logarithmic space into a udpda, and this forms the basis for our lower bound proofs. We show .-hardness of the ordered matching problem for SLPs, from which we derive .-hardness for inclusion. In addition, we complete the complexity landscape for unary nondeterministic pushdown automata by showin

transplantation

Robustness against Power is PSpace-completelic happens-before relation there is one in a certain normal form. Finally, we reduce the existence of such a normal-form computation to a language emptiness problem. Altogether, this yields a PS. algorithm for checking robustness against Power. We complement it by a matching lower bound to show PS.

斜坡

Computability in Anonymous Networks: Revocable vs. Irrecovable Outputsutability which we apply to the classic/characteristic problems. Among our findings is the observation that the three classes are characterized by the three pillars of distributed computing, namely, local symmetry breaking, coordination, and leader election.

GENUS

浸軟

Conference proceedings 2014ogramming, ICALP 2014, held in Copenhagen, Denmark, in July 2014. The total of 136 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 484 submissions. The papers are organized in three tracks focussing on Algorithms, Complexity, and Games, Logic, Se

Individual

0302-9743 ges and Programming, ICALP 2014, held in Copenhagen, Denmark, in July 2014. The total of 136 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 484 submissions. The papers are organized in three tracks focussing on Algorithms, Complexity, and Games,