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=54
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On edge irregular total labeling of categorical product of two cycles
Ali Ahmad
,
Martin Bac̑a
,
Muhammad Kamran Siddiqui
Theory of Computing Systems
54
(1), 2014, pp. 1-12
Optimal collapsing protocol for multiparty pointer jumping
Hongyu Liang
Theory of Computing Systems
54
(1), 2014, pp. 13-23
The bell is ringing in speed-scaled multiprocessor scheduling
Gero Greiner
,
Tim Nonner
,
Alexander Souza
Theory of Computing Systems
54
(1), 2014, pp. 24-44
Parameterized domination in circle graphs
Nicolas Bousquet
,
Daniel Gonçalves
,
George B. Mertzios
,
Christophe Paul
,
Ignasi Sau
,
Stéphane Thomassé
Theory of Computing Systems
54
(1), 2014, pp. 45-72
On the hardness of losing width
Marek Cygan
,
Daniel Lokshtanov
,
Marcin Pilipczuk
,
Michaƚ Plipczuk
,
Saket Saurabh
Theory of Computing Systems
54
(1), 2014, pp. 73-82
Computational aspects of uncertainty profiles and angel-daemon games
Joaquim Gabarro
,
Alina Garcia
,
Maria Serna
Theory of Computing Systems
54
(1), 2014, pp. 83-110
Word-mappings of level 2
Julien Ferté
,
Nathalie Marin
,
Géraud Sénizergues
Theory of Computing Systems
54
(1), 2014, pp. 111-148
On equilibria in quantitative games with reachability/safety objectives
Thomas Brihaye
,
Véronique Bruy`ere
,
Julie De Pril
Theory of Computing Systems
54
(2), 2014, pp. 150-189
Prehistoric graph in modal derivations and self-referentiality
Junhua Yu
Theory of Computing Systems
54
(2), 2014, pp. 190-210
Approximating the minimum length of synchronizing words is hard
Mikhail V. Berlinkov
Theory of Computing Systems
54
(2), 2014, pp. 211-223
Growth of power-free languages over large alphabets
Arseny M. Shur
Theory of Computing Systems
54
(2), 2014, pp. 224-243
Obtaining online ecological colourings by generalizing first-fit
Matthew Johnson
,
Viresh Patel
,
Daniël Paulusma
,
Théophile Trunck
Theory of Computing Systems
54
(2), 2014, pp. 244-260
Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms
Dmitry Itsykson
Theory of Computing Systems
54
(2), 2014, pp. 261-276
Quotient complexity of closed languages
Janusz Brzozowski
,
Galina Jirásková
,
Chenglong Zou
Theory of Computing Systems
54
(2), 2014, pp. 277-292
Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
Pavel Martyugin
Theory of Computing Systems
54
(2), 2014, pp. 293-304
Encoding invariance in average case complexity
Nikolay Vereshchagin
Theory of Computing Systems
54
(2), 2014, pp. 305-317
Balancing bounded treewidth circuits
Maurice Jansen
,
Jayalal Sarma
Theory of Computing Systems
54
(2), 2014, pp. 318-336
Validating the Knuth-Morris-Pratt failure function, fast and online
Paweƚ Gawrychowski
,
Artur Jeż
,
Łukasz Jeż
Theory of Computing Systems
54
(2), 2014, pp. 337-372
Scheduling without payments
Elias Koutsoupias
Theory of Computing Systems
54
(3), 2014, pp. 375-387
A truthful mechanism for value-based scheduling in cloud computing
Navendu Jain
,
Ishai Menache
,
Joseph (Seffi) Naor
,
Jonathan Yaniv
Theory of Computing Systems
54
(3), 2014, pp. 388-406
Strategic pricing in next-hop routing with elastic demands
Elliot Anshelevich
,
Ameya Hate
,
Koushik Kar
Theory of Computing Systems
54
(3), 2014, pp. 407-430
Weakly-acyclic (Internet) routing games
Roee Engelberg
,
Michael Schapira
Theory of Computing Systems
54
(3), 2014, pp. 431-452
Repeated budgeted second price ad auction
Asaph Arnon
,
Yishay Mansour
Theory of Computing Systems
54
(3), 2014, pp. 453-478
Random bimatrix games are asymptotically easy to solve (a simple proof)
Panagiota N. Panagopoulou
,
Paul G. Spirakis
Theory of Computing Systems
54
(3), 2014, pp. 479-490
Complexity of rational and irrational Nash equilibria
Vittorio Bilò
,
Marios Mavronicolas
Theory of Computing Systems
54
(3), 2014, pp. 491-527
Seiten 1
2
>