Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theory of Computing Systems AND Volume=53
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Mixing time and stationary expected social welfare of logit dynamics
Vincenzo Auletta
,
Diodato Ferraioli
,
Francesco Pasquale
,
Giuseppe Persiano
Theory of Computing Systems
53
(1), 2013, pp. 3-40
On the rate of convergence of fictitious play
Felix Brandt
,
Felix Fischer
,
Paul Harrenstein
Theory of Computing Systems
53
(1), 2013, pp. 41-52
The price of anarchy in network creation games is (mostly) constant
Matús̑ Mihalák
,
Jan Christoph Schlegel
Theory of Computing Systems
53
(1), 2013, pp. 53-72
Partition equilibrium always exists in resource selection games
Elliot Anshelevich
,
Bugra Caskurlu
,
Ameya Hate
Theory of Computing Systems
53
(1), 2013, pp. 73-85
Braessás paradox for flows over time
Martin Macko
,
Kate Larson
,
Lubos̑ Steskal
Theory of Computing Systems
53
(1), 2013, pp. 86-106
On the structure of weakly acyclic games
Alex Fabrikant
,
Aaron D. Jaggard
,
Michael Schapira
Theory of Computing Systems
53
(1), 2013, pp. 107-122
Series parallel digraphs with loops
Stefan Gulan
Theory of Computing Systems
53
(2), 2013, pp. 126-158
Extended regular expressions: Succinctness and decidability
Dominik D. Freydenberger
Theory of Computing Systems
53
(2), 2013, pp. 159-193
Nominal monoids
Mikoƚaj Bojańczyk
Theory of Computing Systems
53
(2), 2013, pp. 194-222
Stochastic cellular automata solutions to the density classification problem
Nazim Fatès
Theory of Computing Systems
53
(2), 2013, pp. 223-242
Spectral sparsification in the semi-streaming setting
Jonathan A. Kelner
,
Alex Levin
Theory of Computing Systems
53
(2), 2013, pp. 243-262
Vertex cover kernelization revisited
Bart M.P. Jansen
,
Hans L. Bodlaender
Theory of Computing Systems
53
(2), 2013, pp. 263-299
Online scheduling with interval conflicts
Magnús M. Halldórsson
,
Boaz Patt-Shamir
,
Dror Rawitz
Theory of Computing Systems
53
(2), 2013, pp. 300-317
Tight bounds for distributed minimum-weight spanning tree verification
Liah Kor
,
Amos Korman
,
David Peleg
Theory of Computing Systems
53
(2), 2013, pp. 318-340
Towards duality of multicommodity multiroute cuts and flows: Multilevel ball-growing
Petr Kolman
,
Christian Scheideler
Theory of Computing Systems
53
(2), 2013, pp. 341-363
Global strong defensive alliances of Sierpiński-like graphs
Chien-Hung Lin
,
Jia-Jie Liu
,
Yue-Li Wang
Theory of Computing Systems
53
(3), 2013, pp. 365-385
Static strategies for worksharing with unrecoverable interruptions
Anne Benoit
,
Yves Robert
,
Arnold L. Rosenberg
,
Frédéric Vivien
Theory of Computing Systems
53
(3), 2013, pp. 386-423
Nonpreemptive coordination mechanisms for identical machines
Konstantinos Kollias
Theory of Computing Systems
53
(3), 2013, pp. 424-440
On the complexity of Pareto-optimal Nash and strong equilibria
Martin Hoefer
,
Alexander Skopalik
Theory of Computing Systems
53
(3), 2013, pp. 441-453
Unbalanced graph partitioning
Angsheng Li
,
Peng Zhang
Theory of Computing Systems
53
(3), 2013, pp. 454-466
The complexity of computing minimal unidirectional covering sets
Dorothea Baumeister
,
Felix Brandt
,
Felix Fischer
,
Jan Hoffmann
,
Jörg Rothe
Theory of Computing Systems
53
(3), 2013, pp. 467-502
Comments on arithmetic complexity, Kleene closure, and formal power series
Eric Allender
,
V. Arvind
,
Meena Mahajan
Theory of Computing Systems
53
(3), 2013, pp. 503-506
Normalized range voting broadly resists control
Curtis Menton
Theory of Computing Systems
53
(4), 2013, pp. 507-531
On enumerating monomials and other combinatorial structures by polynomial interpolation
Yann Strozecki
Theory of Computing Systems
53
(4), 2013, pp. 532-568
Motion planning with pulley, rope, and baskets
Christian E.J. Eggermont
,
Gerhard J. Woeginger
Theory of Computing Systems
53
(4), 2013, pp. 569-582
Seiten 1
2
>