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.
Mathematical logic and quantum finite state automata
Ilze Dzelme-Bērziņa
Theoretical Computer Science
410
(20), 2009, pp. 1952-1959
Universal augmentation schemes for network navigability
Pierre Fraigniaud
,
Cyril Gavoille
,
Adrian Kosowski
,
Emmanuelle Lebhar
,
Zvi Lotker
Theoretical Computer Science
410
(21-23), 2009, pp. 1970-1981
Fast neighbor joining
Isaac Elias
,
Jens Lagergren
Theoretical Computer Science
410
(21-23), 2009, pp. 1993-2000
Non-mitotic sets
Christian Glaßer
,
Alan L. Selman
,
Stephen Travers
,
Liyu Zhang
Theoretical Computer Science
410
(21-23), 2009, pp. 2011-2023
On parameterized complexity of the Multi-MCS problem
Wenbin Chen
,
Matthew C. Schmidt
,
Nagiza F. Samatova
Theoretical Computer Science
410
(21-23), 2009, pp. 2024-2032
Compound Node-Kayles on paths
Adrien Guignard
,
Éric Sopena
Theoretical Computer Science
410
(21-23), 2009, pp. 2033-2044
Covering graphs with few complete bipartite subgraphs
Herbert Fleischner
,
Egbert Mujuni
,
Daniël Paulusma
,
Stefan Szeider
Theoretical Computer Science
410
(21-23), 2009, pp. 2045-2053
Tight rank lower bounds for the Sherali-Adams proof system
Stefan Dantchev
,
Barnaby Martin
,
Mark Rhodes
Theoretical Computer Science
410
(21-23), 2009, pp. 2054-2063
The complexity of clique graph recognition
Liliana Alcón
,
Luerbio Faria
,
Celina M.H. de Figueiredo
,
Marisa Gutierrez
Theoretical Computer Science
410
(21-23), 2009, pp. 2072-2083
Asymptotic subword complexity of fixed points of group substitutions
Ilya Goldstein
Theoretical Computer Science
410
(21-23), 2009, pp. 2084-2098
Investigating the existence and the regularity of Logarithmic Harary Graphs
Roberto Baldoni
,
Silvia Bonomi
,
Leonardo Querzoni
,
Sara Tucci Piergiovanni
Theoretical Computer Science
410
(21-23), 2009, pp. 2110-2121
Inapproximability of survivable networks
Yuval Lando
,
Zeev Nutov
Theoretical Computer Science
410
(21-23), 2009, pp. 2122-2125
Quasi-linear transformations and discrete tilings
M.-A. Jacob-Da Col
,
P. Tellier
Theoretical Computer Science
410
(21-23), 2009, pp. 2126-2134
Collapsing words, permutation conditions and coherent colorings of trees
A. Cherubini
,
A. Kisielewicz
Theoretical Computer Science
410
(21-23), 2009, pp. 2135-2147
Matrix columns allocation problems
Amos Beimel
,
Boaz Ben-Moshe
,
Yehuda Ben-Shimol
,
Paz Carmi
,
Eldad Chai
,
Itzik Kitroser
,
Eran Omri
Theoretical Computer Science
410
(21-23), 2009, pp. 2174-2183
Efficient approximation of MIN SET COVER by moderately exponential algorithms
N. Bourgeois
,
B. Escoffier
,
V.Th. Paschos
Theoretical Computer Science
410
(21-23), 2009, pp. 2184-2195
A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
Stefano Galatolo
,
Mathieu Hoyrup
,
Cristóbal Rojas
Theoretical Computer Science
410
(21-23), 2009, pp. 2207-2222
Approximation hardness of deadline-TSP reoptimization
Hans-Joachim Böckenhauer
,
Joachim Kneis
,
Joachim Kupke
Theoretical Computer Science
410
(21-23), 2009, pp. 2241-2249
Finding a tree structure in a resolution proof is
NP
-complete
Jan Hoffmann
Theoretical Computer Science
410
(21-23), 2009, pp. 2295-2300
The parallel complexity of signed graphs: Decidability results and an improved algorithm
Artiom Alhazov
,
Ion Petre
,
Vladimir Rogojin
Theoretical Computer Science
410
(24-25), 2009, pp. 2308-2315
Binary sequences with optimal autocorrelation
Ying Cai
,
Cunsheng Ding
Theoretical Computer Science
410
(24-25), 2009, pp. 2316-2322
Topology on words
Cristian S. Calude
,
Helmut Jürgensen
,
Ludwig Staiger
Theoretical Computer Science
410
(24-25), 2009, pp. 2323-2335
On the intersection of regex languages with regular languages
Cezar Câmpeanu
,
Nicolae Santean
Theoretical Computer Science
410
(24-25), 2009, pp. 2336-2344
Conjugacy of finite biprefix codes
Julien Cassaigne
,
Juhani Karhumäki
,
Petri Salmela
Theoretical Computer Science
410
(24-25), 2009, pp. 2345-2351
Asynchronous spiking neural
P
systems
Matteo Cavaliere
,
Oscar H. Ibarra
,
Gheorghe Păun
,
Omer Egecioglu
,
Mihai Ionescu
,
Sara Woodworth
Theoretical Computer Science
410
(24-25), 2009, pp. 2352-2364
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>