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=407
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Combinatorial network abstraction by trees and distances
Stefan Eckhardt
,
Sven Kosub
,
Moritz G. Maaß
,
Hanjo Täubig
,
Sebastian Wernicke
Theoretical Computer Science
407
(1-3), 2008, pp. 1-20
Equitable list colorings of planar graphs without short cycles
Junlei Zhu
,
Yuehua Bu
Theoretical Computer Science
407
(1-3), 2008, pp. 21-28
The domino problem of the hyperbolic plane is undecidable
Maurice Margenstern
Theoretical Computer Science
407
(1-3), 2008, pp. 29-84
Online unit clustering: Variations on a theme
Leah Epstein
,
Asaf Levin
,
Rob van Stee
Theoretical Computer Science
407
(1-3), 2008, pp. 85-96
Universal relations and \#P-completeness
Hervé Fournier
,
Guillaume Malod
Theoretical Computer Science
407
(1-3), 2008, pp. 97-109
Fault-tolerant embedding of paths in crossed cubes
Meijie Ma
,
Guizhen Liu
,
Jun-Ming Xu
Theoretical Computer Science
407
(1-3), 2008, pp. 110-116
On complexity functions of infinite words associated with generalized Dyck languages
Marion Le Gonidec
Theoretical Computer Science
407
(1-3), 2008, pp. 117-133
Random sampling of colourings of sparse random graphs with a constant number of colours
Charilaos Efthymiou
,
Paul G. Spirakis
Theoretical Computer Science
407
(1-3), 2008, pp. 134-154
Solving structured linear systems with large displacement rank
Alin Bostan
,
Claude-Pierre Jeannerod
,
Éric Schost
Theoretical Computer Science
407
(1-3), 2008, pp. 155-181
Arbitrage opportunities across sponsored search markets
Tian-Ming Bu
,
Xiaotie Deng
,
Qi Qi
Theoretical Computer Science
407
(1-3), 2008, pp. 182-191
Universal automata and NFA learning
Pedro García
,
Manuel Vázquez de Parga
,
Gloria I. Álvarez
,
José Ruiz
Theoretical Computer Science
407
(1-3), 2008, pp. 192-202
Online interval coloring with packing constraints
Leah Epstein
,
Meital Levy
Theoretical Computer Science
407
(1-3), 2008, pp. 203-212
New constructions for provably-secure time-bound hierarchical key assignment schemes
Alfredo De Santis
,
Anna Lisa Ferrara
,
Barbara Masucci
Theoretical Computer Science
407
(1-3), 2008, pp. 213-230
Bincoloring
Sven O. Krumke
,
Willem E. de Paepe
,
Jörg Rambau
,
Leen Stougie
Theoretical Computer Science
407
(1-3), 2008, pp. 231-241
Game chromatic index of graphs with given restrictions on degrees
Andrew Beveridge
,
Tom Bohman
,
Alan Frieze
,
Oleg Pikhurko
Theoretical Computer Science
407
(1-3), 2008, pp. 242-249
Subword histories and associated matrices
Arto Salomaa
Theoretical Computer Science
407
(1-3), 2008, pp. 250-257
Aliased register allocation for straight-line programs is
NP
-complete
Jonathan K. Lee
,
Jens Palsberg
,
Fernando Magno Quintão Pereira
Theoretical Computer Science
407
(1-3), 2008, pp. 258-273
Heuristic algorithms for Hadamard matrices with two circulant cores
M. Chiarandini
,
I.S. Kotsireas
,
C. Koukouvinos
,
L. Paquete
Theoretical Computer Science
407
(1-3), 2008, pp. 274-277
On varieties of meet automata
Ondȓej Klíma
,
Libor Polák
Theoretical Computer Science
407
(1-3), 2008, pp. 278-289
On-line construction of compact suffix vectors and maximal repeats
Élise Prieur
,
Thierry Lecroq
Theoretical Computer Science
407
(1-3), 2008, pp. 290-301
New results for finding common neighborhoods in massive graphs in the data stream model
A.L. Buchsbaum
,
R. Giancarlo
,
B. Racz
Theoretical Computer Science
407
(1-3), 2008, pp. 302-309
A dynamic data structure for top-
k
queries on uncertain data
Jiang Chen
,
Ke Yi
Theoretical Computer Science
407
(1-3), 2008, pp. 310-317
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
Jung-Sheng Fu
Theoretical Computer Science
407
(1-3), 2008, pp. 318-329
A finite set of functions with an EXPTIME-complete composition problem
Marcin Kozik
Theoretical Computer Science
407
(1-3), 2008, pp. 330-341
Parallel time and space upper-bounds for the subset-sum problem
C.A.A. Sanches
,
N.Y. Soma
,
H.H. Yanasse
Theoretical Computer Science
407
(1-3), 2008, pp. 342-348
Seiten 1
2
>