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=332
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
k
-center problems with minimum coverage
Andrew Lim
,
Brian Rodrigues
,
Fan Wang
,
Zhou Xu
Theoretical Computer Science
332
(1-3), 2005, pp. 1-17
Determination of
Q
-convex sets by X-rays
Alain Daurat
Theoretical Computer Science
332
(1-3), 2005, pp. 19-45
Aspects of shuffle and deletion on trajectories
Lila Kari
,
Petr Sosík
Theoretical Computer Science
332
(1-3), 2005, pp. 47-61
New bounds for randomized busing
Steven S. Seiden
,
Peter P. Chen
,
R.F. Lax
,
J. Chen
,
Guoli Ding
Theoretical Computer Science
332
(1-3), 2005, pp. 63-81
On-line vertex-covering
Marc Demange
,
Vangelis Th. Paschos
Theoretical Computer Science
332
(1-3), 2005, pp. 83-108
A new framework for addressing temporal range queries and some preliminary results
Qingmin Shi
,
Joseph JaJa
Theoretical Computer Science
332
(1-3), 2005, pp. 109-121
The approximability of non-Boolean satisfiability problems and restricted integer programming
Maria Serna
,
Luca Trevisan
,
Fatos Xhafa
Theoretical Computer Science
332
(1-3), 2005, pp. 123-139
Derivatives of rational expressions with multiplicity
Sylvain Lombardy
,
Jacques Sakarovitch
Theoretical Computer Science
332
(1-3), 2005, pp. 141-177
Mixed languages
Jean Berstel
,
Luc Boasson
,
Michel Latteux
Theoretical Computer Science
332
(1-3), 2005, pp. 179-198
Finite graph automata for linear and boundary graph languages
F.J. Brandenburg
,
K. Skodinis
Theoretical Computer Science
332
(1-3), 2005, pp. 199-232
Weak Muller acceptance conditions for tree automata
Salvatore la Torre
,
Aniello Murano
,
Margherita Napoli
Theoretical Computer Science
332
(1-3), 2005, pp. 233-250
Online matching on a line
Bernhard Fuchs
,
Winfried Hochstättler
,
Walter Kern
Theoretical Computer Science
332
(1-3), 2005, pp. 251-264
Counting models for 2SAT and 3SAT formulae
Vilhelm Dahllöf
,
Peter Jonsson
,
Magnus Wahlström
Theoretical Computer Science
332
(1-3), 2005, pp. 265-291
A lower bound on compression of unknown alphabets
Nikola Jevtić
,
Alon Orlitsky
,
Narayana P. Santhanam
Theoretical Computer Science
332
(1-3), 2005, pp. 293-311
Greedy expansions and sets with deleted digits
Marco Pedicini
Theoretical Computer Science
332
(1-3), 2005, pp. 313-336
Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines
Klaus Weihrauch
,
Ning Zhong
Theoretical Computer Science
332
(1-3), 2005, pp. 337-366
Three-player partizan games
A. Cincotti
Theoretical Computer Science
332
(1-3), 2005, pp. 367-389
The wide window string matching algorithm
Longtao He
,
Binxing Fang
,
Jie Sui
Theoretical Computer Science
332
(1-3), 2005, pp. 391-404
Designing small keyboards is hard
Jean Cardinal
,
Stefan Langerman
Theoretical Computer Science
332
(1-3), 2005, pp. 405-415
On the one-sided crossing minimization in a bipartite graph with large degrees
Hiroshi Nagamochi
Theoretical Computer Science
332
(1-3), 2005, pp. 417-446
Resource-sharing system scheduling and circular chromatic number
Hong-Gwa Yeh
,
Xuding Zhu
Theoretical Computer Science
332
(1-3), 2005, pp. 447-460
Property-preserving subnet reductions for designing manufacturing systems with shared resources
H.J. Huang
,
L. Jiao
,
T.Y. Cheung
Theoretical Computer Science
332
(1-3), 2005, pp. 461-485
Uniformity of quantum circuit families for error-free algorithms
Harumichi Nishimura
,
Masanao Ozawa
Theoretical Computer Science
332
(1-3), 2005, pp. 487-496
On the differential approximation of MIN SET COVER
Cristina Bazgan
,
Jérôme Monnot
,
Vangelis Th. Paschos
,
Fabrice Serrière
Theoretical Computer Science
332
(1-3), 2005, pp. 497-513
New algorithms for exact satisfiability
Jesper Makholm Byskov
,
Bolette Ammitzbll Madsen
,
Bjarke Skjernaa
Theoretical Computer Science
332
(1-3), 2005, pp. 515-541
Seiten 1
2
>