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=310
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finite-state dimension
Jack J. Dai
,
James I. Lathrop
,
Jack H. Lutz
,
Elvira Mayordomo
Theoretical Computer Science
310
(1-3), 2004, pp. 1-33
Synchronization of musical words
Marc Chemillier
Theoretical Computer Science
310
(1-3), 2004, pp. 35-60
New bounds for multi-label interval routing
Savio S.H. Tse
,
Francis C.M. Lau
Theoretical Computer Science
310
(1-3), 2004, pp. 61-77
Vectorial languages and linear temporal logic
Olivier Serre
Theoretical Computer Science
310
(1-3), 2004, pp. 79-116
Minimal schedulability interval for real-time systems of periodic tasks with offsets
Annie Choquet-Geniet
,
Emmanuel Grolleau
Theoretical Computer Science
310
(1-3), 2004, pp. 117-134
Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
Eric Angel
,
Evripidis Bampis
,
Laurent Gourvès
Theoretical Computer Science
310
(1-3), 2004, pp. 135-146
The limitedness problem on distance automata: Hashiguchi's method revisited
Hing Leung
,
Viktor Podolskiy
Theoretical Computer Science
310
(1-3), 2004, pp. 147-158
Competitive analysis of incentive compatible on-line auctions
Ron Lavi
,
Noam Nisan
Theoretical Computer Science
310
(1-3), 2004, pp. 159-180
Theory of genetic algorithms II: Models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling
Lothar M. Schmitt
Theoretical Computer Science
310
(1-3), 2004, pp. 181-231
Extending Parikh matrices
Traian-Florin Şerbȃnuţȃ
Theoretical Computer Science
310
(1-3), 2004, pp. 233-246
Characterisations of balanced words via orderings
Oliver Jenkinson
,
Luca Q. Zamboni
Theoretical Computer Science
310
(1-3), 2004, pp. 247-271
Moments of conjugacy classes of binary words
Wai-Fong Chuan
Theoretical Computer Science
310
(1-3), 2004, pp. 273-285
Finding hidden independent sets in interval graphs
Therese Biedl
,
Bron̑a Brejovȃ
,
Erik D. Demaine
,
Angèle M. Hamel
,
Alejandro López-Ortiz
,
Tomás̑ Vinaȓ
Theoretical Computer Science
310
(1-3), 2004, pp. 287-307
Speeding up the detection of evolutive tandem repeats
Richard Groult
,
Martine Léonard
,
Laurent Mouchard
Theoretical Computer Science
310
(1-3), 2004, pp. 309-328
Tree spanners on chordal graphs: Complexity and algorithms
Andreas Brandstädt
,
Feodor F. Dragan
,
Hoàng-Oanh Le
,
Van Bang Le
Theoretical Computer Science
310
(1-3), 2004, pp. 329-354
On the complexity of finding a local maximum of functions on discrete planar subsets
Anton Mityagin
Theoretical Computer Science
310
(1-3), 2004, pp. 355-363
Memoryless determinacy of parity and mean payoff games: A simple proof
Henrik Björklund
,
Sven Sandberg
,
Sergei Vorobyov
Theoretical Computer Science
310
(1-3), 2004, pp. 365-378
(h,k)
-arbiters for
h
-out-of-
k
mutual exclusion problem
Yoshifumi Manabe
,
Naka Tajima
Theoretical Computer Science
310
(1-3), 2004, pp. 379-392
Undecidability of the trace coding problem and some decidable cases
Michal Kunc
Theoretical Computer Science
310
(1-3), 2004, pp. 393-456
Competitive facility location: The Voronoi game
Hee-Kap Ahn
,
Siu-Wing Cheng
,
Otfried Cheong
,
Mordecai Golin
,
René van Oostrum
Theoretical Computer Science
310
(1-3), 2004, pp. 457-467
Tilings: Recursivity and regularity
Julien Cervelle
,
Bruno Durand
Theoretical Computer Science
310
(1-3), 2004, pp. 469-477
A combinatorial error bound for
t
-point-based sampling
P. Dukes
,
Alan C.H. Ling
Theoretical Computer Science
310
(1-3), 2004, pp. 479-488
On factorization forests of finite height
Jérémie Chalopin
,
Hing Leung
Theoretical Computer Science
310
(1-3), 2004, pp. 489-499
A channel assignment problem for optical networks modelled by Cayley graphs
Sanming Zhou
Theoretical Computer Science
310
(1-3), 2004, pp. 501-511
Mutilated chessboard problem is exponentially hard for resolution
Michael Alekhnovich
Theoretical Computer Science
310
(1-3), 2004, pp. 513-525
Seiten 1
2
>