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=Theor.~Comput.~Sci. AND Volume=410
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Overlap-free words and spectra of matrices
Raphaël M. Jungers
,
Vladimir Y. Protasov
,
Vincent D. Blondel
Theoretical Computer Science
410
(38-40), 2009, pp. 3670-3684
Conservation of some dynamical properties for operations on cellular automata
Luigi Acerbi
,
Alberto Dennunzio
,
Enrico Formenti
Theoretical Computer Science
410
(38-40), 2009, pp. 3685-3693
On the relative dominance of paging algorithms
Reza Dorrigiv
,
Alejandro López-Ortiz
,
J. Ian Munro
Theoretical Computer Science
410
(38-40), 2009, pp. 3694-3701
An
O(n^{1.75})
algorithm for
L(2,1)
-labeling of trees
Toru Hasunuma
,
Toshimasa Ishii
,
Hirotaka Ono
,
Yushi Uno
Theoretical Computer Science
410
(38-40), 2009, pp. 3702-3710
On the uniqueness of shuffle on words and finite languages
Franziska Biegler
,
Mark Daley
,
Markus Holzer
,
Ian McQuillan
Theoretical Computer Science
410
(38-40), 2009, pp. 3711-3724
Improved edge-coloring with three colors
Łukasz Kowalik
Theoretical Computer Science
410
(38-40), 2009, pp. 3733-3742
New permutation coding and equidistribution of set-valued statistics
Dominique Foata
,
Guo-Niu Han
Theoretical Computer Science
410
(38-40), 2009, pp. 3743-3750
Hardness and approximation of traffic grooming
Omid Amini
,
Stéphane Pérennes
,
Ignasi Sau
Theoretical Computer Science
410
(38-40), 2009, pp. 3751-3760
Parallel-machine scheduling of simple linear deteriorating jobs
Min Ji
,
T.C.E. Cheng
Theoretical Computer Science
410
(38-40), 2009, pp. 3761-3768
Separation numbers of trees
Tao Jiang
,
Zevi Miller
,
Dan Pritikin
Theoretical Computer Science
410
(38-40), 2009, pp. 3769-3781
Strip packing with precedence constraints and strip packing with release times
John Augustine
,
Sudarshan Banerjee
,
Sandy Irani
Theoretical Computer Science
410
(38-40), 2009, pp. 3792-3803
Complexity of counting the optimal solutions
Miki Hermann
,
Reinhard Pichler
Theoretical Computer Science
410
(38-40), 2009, pp. 3814-3825
Nondeterministic functions and the existence of optimal proof systems
Olaf Beyersdorff
,
Johannes Köbler
,
Jochen Messner
Theoretical Computer Science
410
(38-40), 2009, pp. 3839-3855
Hard constraint satisfaction problems have hard gaps at location 1
Peter Jonsson
,
Andrei Krokhin
,
Fredrik Kuivinen
Theoretical Computer Science
410
(38-40), 2009, pp. 3856-3874
Set multi-covering via inclusion-exclusion
Qiang-Sheng Hua
,
Yuexuan Wang
,
Dongxiao Yu
,
Francis C.M. Lau
Theoretical Computer Science
410
(38-40), 2009, pp. 3882-3892
A powerful Abelian square-free substitution over 4 letters
Veikko Keränen
Theoretical Computer Science
410
(38-40), 2009, pp. 3893-3900
On the complexity of constrained Nash equilibria in graphical games
Gianluigi Greco
,
Francesco Scarcello
Theoretical Computer Science
410
(38-40), 2009, pp. 3901-3924
Shortest synchronizing strings for Huffman codes
Marek Tomasz Biskup
,
Wojciech Plandowski
Theoretical Computer Science
410
(38-40), 2009, pp. 3925-3941
The complexity of weighted Boolean \#CSP with mixed signs
Andrei Bulatov
,
Martin Dyer
,
Leslie Ann Goldberg
,
Markus Jalsenius
,
David Richerby
Theoretical Computer Science
410
(38-40), 2009, pp. 3949-3961
Sand automata as cellular automata
Alberto Dennunzio
,
Pierre Guillon
,
Benoît Masson
Theoretical Computer Science
410
(38-40), 2009, pp. 3962-3974
Generalized juntas and
NP
-hard sets
Gábor Erdélyi
,
Lane A. Hemaspaandra
,
Jörg Rothe
,
Holger Spakowski
Theoretical Computer Science
410
(38-40), 2009, pp. 3995-4000
Probabilistic and nondeterministic aspects of anonymity
Romain Beauxis
,
Catuscia Palamidessi
Theoretical Computer Science
410
(41), 2009, pp. 4006-4025
On determinism in modal transition systems
N. Benes̑
,
J. Kȓetínský
,
K.G. Larsen
,
J. Srba
Theoretical Computer Science
410
(41), 2009, pp. 4026-4043
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
Filippo Bonchi
,
Ugo Montanari
Theoretical Computer Science
410
(41), 2009, pp. 4044-4066
An analysis of the exponential decay principle in probabilistic trust models
Ehab ElSalamouny
,
Karl Tikjb Krukow
,
Vladimiro Sassone
Theoretical Computer Science
410
(41), 2009, pp. 4067-4084
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>