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=2014
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Playing Mastermind with constant-size memory
Benjamin Doerr
,
Carola Winzen
Theory of Computing Systems
55
(4), 2014, pp. 658-684
The complexity of compressed membership problems for finite automata
Artur Jeż
Theory of Computing Systems
55
(4), 2014, pp. 685-718
Linear-space data structures for range mode query in arrays
Timothy M. Chan
,
Stephane Durocher
,
Kasper Green Larsen
,
Jason Morrison
,
Bryan T. Wilkinson
Theory of Computing Systems
55
(4), 2014, pp. 719-741
Efficient algorithms for highly compressed data: The word problem in generalized Higman groups is in P
Jürn Laun
Theory of Computing Systems
55
(4), 2014, pp. 742-770
On first-order logic and CPDA graphs
Christopher H. Broadbent
Theory of Computing Systems
55
(4), 2014, pp. 771-832
On the separation question for tree languages
André Arnold
,
Henryk Michalewski
,
Damian Niwiński
Theory of Computing Systems
55
(4), 2014, pp. 833-855
Model-theoretic properties of
\omega
-automatic structures
Faried Abu Zaid
,
Erich Grädel
,
Łukasz Kaiser
,
Wied Pakusa
Theory of Computing Systems
55
(4), 2014, pp. 856-880
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
Seiten
<
1
2
3
>