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=49
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Non-clairvoyant scheduling games
Johanne Cohen
,
Christoph Dürr
,
Thang Nguyen Kim
Theory of Computing Systems
49
(1), 2011, pp. 3-23
Performance of one-round walks in linear congestion games
Vittorio Bilò
,
Angelo Fanelli
,
Michele Flammini
,
Luca Moscardelli
Theory of Computing Systems
49
(1), 2011, pp. 24-45
Characterizing the existence of potential functions in weighted congestion games
Tobias Harks
,
Max Klimm
,
Rolf H. Möhring
Theory of Computing Systems
49
(1), 2011, pp. 46-70
Nash equilibria and the price of anarchy for flows over time
Ronald Koch
,
Martin Skutella
Theory of Computing Systems
49
(1), 2011, pp. 71-97
Price of stability in survivable network design
Elliot Anshelevich
,
Bugra Caskurlu
Theory of Computing Systems
49
(1), 2011, pp. 98-138
The computational complexity of weak saddles
Felix Brandt
,
Markus Brill
,
Felix Fischer
,
Jan Hoffmann
Theory of Computing Systems
49
(1), 2011, pp. 139-161
On the complexity of iterated weak dominance in constant-sum games
Felix Brandt
,
Markus Brill
,
Felix Fischer
,
Paul Harrenstein
Theory of Computing Systems
49
(1), 2011, pp. 162-181
The balloon popping problem revisited: Lower and upper bounds
Hyunwoo Jung
,
Kyung-Yong Chwa
Theory of Computing Systems
49
(1), 2011, pp. 182-195
Truthful mechanisms for selfish routing and two-parameter agents
Clemens Thielen
,
Sven O. Krumke
Theory of Computing Systems
49
(1), 2011, pp. 196-223
Variations on Muchnik's conditional complexity theorem
Daniil Musatov
,
Andrei Romashchenko
,
Alexander Shen
Theory of Computing Systems
49
(2), 2011, pp. 227-245
On the complexity of matroid isomorphism problem
B.V. Raghavendra Rao
,
M.N. Jayalal Sarma
Theory of Computing Systems
49
(2), 2011, pp. 246-272
New plain-exponential time classes for graph homomorphism
Magnus Wahlström
Theory of Computing Systems
49
(2), 2011, pp. 273-282
Compressed word problems in HNN-extensions and amalgamated products
Niko Haubold
,
Markus Lohrey
Theory of Computing Systems
49
(2), 2011, pp. 283-305
Concatenation of regular languages and descriptional complexity
Galina Jirásková
Theory of Computing Systems
49
(2), 2011, pp. 306-318
One-nonterminal conjunctive grammars over a unary alphabet
Artur Jeż
,
Alexander Okhotin
Theory of Computing Systems
49
(2), 2011, pp. 319-342
Lower bounds for the determinantal complexity of explicit low degree polynomials
Maurice Jansen
Theory of Computing Systems
49
(2), 2011, pp. 343-354
Unique decipherability in the monoid of languages: An application of rational relations
Christian Choffrut
,
Juhani Karhumäki
Theory of Computing Systems
49
(2), 2011, pp. 355-364
Querying data sources that export infinite sets of views
Bogdan Cautis
,
Alin Deutsch
,
Nicola Onose
Theory of Computing Systems
49
(2), 2011, pp. 367-428
Containment of conjunctive queries on annotated relations
Todd J. Green
Theory of Computing Systems
49
(2), 2011, pp. 429-459
Reconcilable differences
Todd J. Green
,
Zachary G. Ives
,
Val Tannen
Theory of Computing Systems
49
(2), 2011, pp. 460-488
Query languages for data exchange: Beyond unions of conjunctive queries
Marcelo Arenas
,
Pablo Barceló
,
Juan Reutter
Theory of Computing Systems
49
(2), 2011, pp. 489-564
Area, curve complexity, and crossing resolution of non-planar graph drawings
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Henk Meijer
Theory of Computing Systems
49
(3), 2011, pp. 565-575
A property tester for tree-likeness of quartet topologies
Maw-Shang Chang
,
Chuang-Chieh Lin
,
Peter Rossmanith
Theory of Computing Systems
49
(3), 2011, pp. 576-587
The hub number of Sierpiński-like graphs
Chien-Hung Lin
,
Jia-Jie Liu
,
Yue-Li Wang
,
William Chung-Kung Yen
Theory of Computing Systems
49
(3), 2011, pp. 588-600
Dimension, halfspaces, and the density of hard sets
Ryan C. Harkins
,
John M. Hitchcock
Theory of Computing Systems
49
(3), 2011, pp. 601-614
Seiten 1
2
>