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.
Predictable semiautomata
Janusz Brzozowski
,
Nicolae Santean
Theoretical Computer Science
410
(35), 2009, pp. 3236-3249
On the descriptional complexity of Watson-Crick automata
Elena Czeizler
,
Eugen Czeizler
,
Lila Kari
,
Kai Salomaa
Theoretical Computer Science
410
(35), 2009, pp. 3250-3260
Two collapsing hierarchies of subregularly tree controlled languages
Jürgen Dassow
,
Ralf Stiebe
,
Bianca Truthe
Theoretical Computer Science
410
(35), 2009, pp. 3261-3271
Estimation of state complexity of combined operations
Zoltán Ésik
,
Yuan Gao
,
Guangwu Liu
,
Sheng Yu
Theoretical Computer Science
410
(35), 2009, pp. 3272-3280
Language operations with regular expressions of polynomial size
Hermann Gruber
,
Markus Holzer
Theoretical Computer Science
410
(35), 2009, pp. 3281-3289
The structure and complexity of Nash equilibria for a selfish routing game
Dimitris Fotakis
,
Spyros Kontogiannis
,
Elias Koutsoupias
,
Marios Mavronicolas
,
Paul Spirakis
Theoretical Computer Science
410
(36), 2009, pp. 3305-3326
Coordination mechanisms
George Christodoulou
,
Elias Koutsoupias
,
Akash Nanavati
Theoretical Computer Science
410
(36), 2009, pp. 3327-3336
Atomic routing games on maximum congestion
Costas Busch
,
Malik Magdon-Ismail
Theoretical Computer Science
410
(36), 2009, pp. 3337-3347
On designing truthful mechanisms for online scheduling
Vincenzo Auletta
,
Roberto De Prisco
,
Paolo Penna
,
Giuseppe Persiano
Theoretical Computer Science
410
(36), 2009, pp. 3348-3356
Adaptive routing with stale information
Simon Fischer
,
Berthold Vöcking
Theoretical Computer Science
410
(36), 2009, pp. 3357-3371
An
(18/11)n
upper bound for sorting by prefix reversals
B. Chitturi
,
W. Fahle
,
Z. Meng
,
L. Morales
,
C.O. Shields
,
I.H. Sudborough
,
W. Voit
Theoretical Computer Science
410
(36), 2009, pp. 3372-3390
Optimal strategies for maintaining a chain of relays between an explorer and a base camp
Jarosƚaw Kutyƚowski
,
Friedhelm Meyer auf der Heide
Theoretical Computer Science
410
(36), 2009, pp. 3391-3405
Small stretch
(\alpha, \beta)
-spanners in the streaming model
Giorgio Ausiello
,
Paolo G. Franciosa
,
Giuseppe F. Italiano
Theoretical Computer Science
410
(36), 2009, pp. 3406-3413
On the runtime and robustness of randomized broadcasting
R. Elsässer
,
T. Sauerwald
Theoretical Computer Science
410
(36), 2009, pp. 3414-3427
Reoptimization of Steiner trees: Changing the terminal set
Hans-Joachim Böckenhauer
,
Juraj Hromkovic̑
,
Richard Královic̑
,
Tobias Mömke
,
Peter Rossmanith
Theoretical Computer Science
410
(36), 2009, pp. 3428-3435
Regulated nondeterminism in pushdown automata
Martin Kutrib
,
Andreas Malcher
,
Larissa Werlein
Theoretical Computer Science
410
(37), 2009, pp. 3447-3460
Efficient enumeration of words in regular languages
Margareta Ackerman
,
Jeffrey Shallit
Theoretical Computer Science
410
(37), 2009, pp. 3461-3470
From Nerode's congruence to suffix automata with mismatches
M. Crochemore
,
C. Epifanio
,
A. Gabriele
,
F. Mignosi
Theoretical Computer Science
410
(37), 2009, pp. 3471-3480
Weighted automata and weighted logics with discounting
Manfred Droste
,
George Rahonis
Theoretical Computer Science
410
(37), 2009, pp. 3481-3494
Finite state automata representing two-dimensional subshifts
Natas̑a Jonoska
,
Joni B. Pirnot
Theoretical Computer Science
410
(37), 2009, pp. 3504-3512
A computational model for tiling recognizable two-dimensional languages
Marcella Anselmo
,
Dora Giammarresi
,
Maria Madonia
Theoretical Computer Science
410
(37), 2009, pp. 3520-3529
Backward and forward bisimulation minimization of tree automata
Johanna Högberg
,
Andreas Maletti
,
Jonathan May
Theoretical Computer Science
410
(37), 2009, pp. 3539-3552
Accelerating Boyer-Moore searches on binary texts
Shmuel T. Klein
,
Miri Kopel Ben-Nissan
Theoretical Computer Science
410
(37), 2009, pp. 3563-3571
Optimally competitive list batching
Wolfgang Bein
,
Leah Epstein
,
Lawrence L. Larmore
,
John Noga
Theoretical Computer Science
410
(38-40), 2009, pp. 3631-3639
Isolation concepts for efficiently enumerating dense subgraphs
Christian Komusiewicz
,
Falk Hüffner
,
Hannes Moser
,
Rolf Niedermeier
Theoretical Computer Science
410
(38-40), 2009, pp. 3640-3654
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>