


default search action
Theory of Computing Systems, Volume 53
Volume 53, Number 1, July 2013
- Spyros C. Kontogiannis

, Elias Koutsoupias, Pavlos G. Spirakis:
Preface to Special Issue on Algorithmic Game Theory. 1-2 - Vincenzo Auletta

, Diodato Ferraioli
, Francesco Pasquale
, Giuseppe Persiano:
Mixing Time and Stationary Expected Social Welfare of Logit Dynamics. 3-40 - Felix Brandt, Felix A. Fischer, Paul Harrenstein:

On the Rate of Convergence of Fictitious Play. 41-52 - Matús Mihalák, Jan Christoph Schlegel

:
The Price of Anarchy in Network Creation Games Is (Mostly) Constant. 53-72 - Elliot Anshelevich

, Bugra Çaskurlu, Ameya Hate:
Partition Equilibrium Always Exists in Resource Selection Games. 73-85 - Martin Macko, Kate Larson

, L'ubos Steskal:
Braess's Paradox for Flows over Time. 86-106 - Alex Fabrikant, Aaron D. Jaggard

, Michael Schapira:
On the Structure of Weakly Acyclic Games. 107-122
Volume 53, Number 2, August 2013
- Christoph Dürr, Thomas Schwentick:

Preface of Special Issue on Theoretical Aspects of Computer Science. 123-125 - Stefan Gulan:

Series Parallel Digraphs with Loops - Graphs Encoded by Regular Expression. 126-158 - Dominik D. Freydenberger

:
Extended Regular Expressions: Succinctness and Decidability. 159-193 - Mikolaj Bojanczyk:

Nominal Monoids. 194-222 - Nazim Fatès

:
Stochastic Cellular Automata Solutions to the Density Classification Problem - When Randomness Helps Computing. 223-242 - Jonathan A. Kelner, Alex Levin:

Spectral Sparsification in the Semi-streaming Setting. 243-262 - Bart M. P. Jansen, Hans L. Bodlaender

:
Vertex Cover Kernelization Revisited - Upper and Lower Bounds for a Refined Parameter. 263-299 - Magnús M. Halldórsson

, Boaz Patt-Shamir, Dror Rawitz:
Online Scheduling with Interval Conflicts. 300-317 - Liah Kor, Amos Korman, David Peleg:

Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification. 318-340 - Petr Kolman

, Christian Scheideler:
Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. 341-363
Volume 53, Number 3, October 2013
- Chien-Hung Lin, Jia Jie Liu

, Yue-Li Wang:
Global Strong Defensive Alliances of Sierpiński-Like Graphs. 365-385 - Anne Benoit

, Yves Robert
, Arnold L. Rosenberg, Frédéric Vivien
:
Static Strategies for Worksharing with Unrecoverable Interruptions. 386-423 - Konstantinos Kollias:

Nonpreemptive Coordination Mechanisms for Identical Machines. 424-440 - Martin Hoefer, Alexander Skopalik:

On the Complexity of Pareto-Optimal Nash and Strong Equilibria. 441-453 - Angsheng Li, Peng Zhang

:
Unbalanced Graph Partitioning. 454-466 - Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe:

The Complexity of Computing Minimal Unidirectional Covering Sets. 467-502 - Eric Allender

, Vikraman Arvind, Meena Mahajan
:
Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series. 503-506
Volume 53, Number 4, November 2013
- Curtis Menton:

Normalized Range Voting Broadly Resists Control. 507-531 - Yann Strozecki:

On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation. 532-568 - Christian Eggermont, Gerhard J. Woeginger:

Motion Planning with Pulley, Rope, and Baskets. 569-582 - Anna Bernasconi

, Valentina Ciriani
, Fabrizio Luccio, Linda Pagli
:
Compact DSOP and Partial DSOP Forms. 583-608 - Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:

A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. 609-620 - Nathalie Aubrun

, Marie-Pierre Béal:
Sofic Tree-Shifts. 621-644 - Jan A. Bergstra, Cornelis A. Middelburg

:
A Process Calculus with Finitary Comprehended Terms. 645-668 - Bireswar Das, Samir Datta

, Prajakta Nimbhorkar
:
Log-Space Algorithms for Paths and Matchings in k-Trees. 669-689 - Gregory Z. Gutin, Arash Rafiey, Stefan Szeider

, Anders Yeo:
Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value. 690-691

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














