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
[1]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=411
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On extremal cases of Hopcroft's algorithm
G. Castiglione
,
A. Restivo
,
M. Sciortino
Theoretical Computer Science
411
(38-39), 2010, pp. 3414-3422
Acyclic automata and small expressions using multi-tilde-bar operators
Pascal Caron
,
Jean-Marc Champarnaud
,
Ludovic Mignot
Theoretical Computer Science
411
(38-39), 2010, pp. 3423-3435
Amount of nonconstructivity in deterministic finite automata
Rūsiņs̑ Freivalds
Theoretical Computer Science
411
(38-39), 2010, pp. 3436-3443
Fixed point guided abstraction refinement for alternating automata
Pierre Ganty
,
Nicolas Maquet
,
Jean-François Raskin
Theoretical Computer Science
411
(38-39), 2010, pp. 3444-3459
Verifying parallel programs with dynamic communication structures
Tayssir Touili
,
Mohamed Faouzi Atig
Theoretical Computer Science
411
(38-39), 2010, pp. 3460-3468
Parametric random generation of deterministic tree automata
Pierre-Cyrille Héam
,
Cyril Nicaud
,
Sylvain Schmitz
Theoretical Computer Science
411
(38-39), 2010, pp. 3469-3480
Compact representation for answer sets of
n
-ary regular queries
Kazuhiro Inaba
,
Haruo Hosoya
Theoretical Computer Science
411
(38-39), 2010, pp. 3481-3492
Recognition of directed acyclic graphs by spanning tree automata
Akio Fujiyoshi
Theoretical Computer Science
411
(38-39), 2010, pp. 3493-3506
Analysis of a cellular automaton model for car traffic with a slow-to-stop rule
Adam Clarridge
,
Kai Salomaa
Theoretical Computer Science
411
(38-39), 2010, pp. 3507-3515
Cellular automata with sparse communication
Martin Kutrib
,
Andreas Malcher
Theoretical Computer Science
411
(38-39), 2010, pp. 3516-3526
Controlled non-uniform random generation of decomposable structures
A. Denise
,
Y. Ponty
,
M. Termier
Theoretical Computer Science
411
(40-42), 2010, pp. 3527-3552
Minimizing total busy time in parallel scheduling with application to optical networks
Michele Flammini
,
Gianpiero Monaco
,
Luca Moscardelli
,
Hadas Shachnai
,
Mordechai Shalom
,
Tami Tamir
,
Shmuel Zaks
Theoretical Computer Science
411
(40-42), 2010, pp. 3553-3562
Playing the perfect Kriegspiel endgame
Paolo Ciancarini
,
Gian Piero Favini
Theoretical Computer Science
411
(40-42), 2010, pp. 3563-3577
Preemptive scheduling with simple linear deterioration on a single machine
C.T. Ng
,
Shisheng Li
,
T.C.E. Cheng
,
Jinjiang Yuan
Theoretical Computer Science
411
(40-42), 2010, pp. 3578-3586
Deadline scheduling and power management for speed bounded processors
Xin Han
,
Tak-Wah Lam
,
Lap-Kei Lee
,
Isaac K.K. To
,
Prudence W.H. Wong
Theoretical Computer Science
411
(40-42), 2010, pp. 3587-3600
The continuous Skolem-Pisot problem
Paul C. Bell
,
Jean-Charles Delvenne
,
Raphaël M. Jungers
,
Vincent D. Blondel
Theoretical Computer Science
411
(40-42), 2010, pp. 3625-3634
Enumeration of the perfect sequences of a chordal graph
Yasuko Matsui
,
Ryuhei Uehara
,
Takeaki Uno
Theoretical Computer Science
411
(40-42), 2010, pp. 3635-3641
Parallel-machine scheduling with deteriorating jobs and rejection
Shisheng Li
,
Jinjiang Yuan
Theoretical Computer Science
411
(40-42), 2010, pp. 3642-3650
The surviving rate of an infected network
Weifan Wang
,
Stephen Finbow
,
Ping Wang
Theoretical Computer Science
411
(40-42), 2010, pp. 3651-3660
Left-forbidding cooperating distributed grammar systems
Filip Goldefus
,
Tomás̑ Masopust
,
Alexander Meduna
Theoretical Computer Science
411
(40-42), 2010, pp. 3661-3667
On the number of Episturmian palindromes
Michelangelo Bucci
,
Aldo de Luca
,
Alessandro De Luca
Theoretical Computer Science
411
(40-42), 2010, pp. 3668-3684
Treewidth and minimum fill-in on permutation graphs in linear time
Daniel Meister
Theoretical Computer Science
411
(40-42), 2010, pp. 3685-3700
Exact and approximate bandwidth
Marek Cygan
,
Marcin Pilipczuk
Theoretical Computer Science
411
(40-42), 2010, pp. 3701-3713
Sharp thresholds for Hamiltonicity in random intersection graphs
Charilaos Efthymiou
,
Paul G. Spirakis
Theoretical Computer Science
411
(40-42), 2010, pp. 3714-3730
A note on the complexity of
C^{\infty}
-words
Yun Bao Huang
,
William D. Weakley
Theoretical Computer Science
411
(40-42), 2010, pp. 3731-3735
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>