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 YEAR=2010
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Sensitivity of Wardrop equilibria
Matthias Englert
,
Thomas Franke
,
Lars Olbrich
Theory of Computing Systems
47
(1), 2010, pp. 3-14
Non-cooperative cost sharing games via subsidies
Niv Buchbinder
,
Liane Lewin-Eytan
,
Joseph (Seffi) Naor
,
Ariel Orda
Theory of Computing Systems
47
(1), 2010, pp. 15-37
Atomic congestion games: Fast, myopic and concurrent
D. Fotakis
,
A.C. Kaporis
,
P.G. Spirakis
Theory of Computing Systems
47
(1), 2010, pp. 38-59
Facets of the fully mixed Nash equilibrium conjecture
Rainer Feldmann
,
Marios Mavronicolas
,
Andreas Pieris
Theory of Computing Systems
47
(1), 2010, pp. 60-112
Congestion games with linearly independent paths: Convergence time and price of anarchy
Dimitris Fotakis
Theory of Computing Systems
47
(1), 2010, pp. 113-136
TCP is competitive with resource augmentation
Jeff Edmonds
,
Suprakash Datta
,
Patrick Dymond
Theory of Computing Systems
47
(1), 2010, pp. 137-161
The deduction theorem for strong propositional proof systems
Olaf Beyersdorff
Theory of Computing Systems
47
(1), 2010, pp. 162-178
Border correlations of partial words
F. Blanchet-Sadri
,
E. Clader
,
O. Simpson
Theory of Computing Systems
47
(1), 2010, pp. 179-195
Fixed-parameter algorithms for cluster vertex deletion
Falk Hüffner
,
Christian Komusiewicz
,
Hannes Moser
,
Rolf Niedermeier
Theory of Computing Systems
47
(1), 2010, pp. 196-217
Stackelberg strategies for atomic congestion games
Dimitris Fotakis
Theory of Computing Systems
47
(1), 2010, pp. 218-249
The solvability problem for quadratic equations over free groups is
NP
-complete
O. Kharlampovich
,
I.G. Lvsënok
,
A.G. Mvasnikov
,
N.W.M. Touikan
Theory of Computing Systems
47
(1), 2010, pp. 250-258
Strongly terminating early-stopping
k
-set agreement in synchronous systems with general omission failures
Philippe Raïpin Parvédy
,
M. Raynal
,
C. Travers
Theory of Computing Systems
47
(1), 2010, pp. 259-287
Reductions to graph isomorphism
Jacobo Torán
Theory of Computing Systems
47
(1), 2010, pp. 288-299
Time and space complexity for splicing systems
Remco Loos
,
Mitsunori Ogihara
Theory of Computing Systems
47
(2), 2010, pp. 301-316
Non-uniform reductions
Harry Buhrman
,
Benjamin Hescott
,
Steven Homer
,
Leen Torenvliet
Theory of Computing Systems
47
(2), 2010, pp. 317-341
New fixed-parameter algorithms for the minimum quartet inconsistency problem
Maw-Shang Chang
,
Chuang-Chieh Lin
,
Peter Rossmanith
Theory of Computing Systems
47
(2), 2010, pp. 342-367
Sublinear fully distributed partition with applications
Bilel Derbel
,
Mohamed Mosbah
,
Akka Zemmari
Theory of Computing Systems
47
(2), 2010, pp. 368-404
Computing Nash equilibria for scheduling on restricted parallel links
Martin Gairing
,
Thomas Lücking
,
Marios Mavronicolas
,
Burkhard Monien
Theory of Computing Systems
47
(2), 2010, pp. 405-432
Stochastic models and adaptive algorithms for energy balance in sensor networks
Pierre Leone
,
Sotiris Nikoletseas
,
Joseé Rolim
Theory of Computing Systems
47
(2), 2010, pp. 433-453
The complexity of problems for quantified constraints
Michael Bauland
,
Elmar Böhler
,
Nadia Creignou
,
Steffen Reith
,
Henning Schnoor
,
Heribert Vollmer
Theory of Computing Systems
47
(2), 2010, pp. 454-490
On the automatizability of polynomial calculus
Nicola Galesi
,
Massimo Lauria
Theory of Computing Systems
47
(2), 2010, pp. 491-506
Designing fast converging cost sharing methods for multicast transmissions
Vittorio Bilò
,
Angelo Fanelli
,
Michele Flammini
,
Giovanna Melideo
,
Luca Moscardelli
Theory of Computing Systems
47
(2), 2010, pp. 507-530
Constrained-path labellings on graphs of bounded clique-width
Bruno Courcelle
,
Andrew Twigg
Theory of Computing Systems
47
(2), 2010, pp. 531-567
Automatic presentations and semigroup constructions
Alan J. Cain
,
Graham Oliver
,
Nik Rus̑kuc
,
Richard M. Thomas
Theory of Computing Systems
47
(2), 2010, pp. 568-592
Exact OBDD bounds for some fundamental functions
Beate Bollig
,
Niko Range
,
Ingo Wegener
Theory of Computing Systems
47
(2), 2010, pp. 593-609
Seiten 1
2
3
>