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=303
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Games for synthesis of controllers with partial observation
A. Arnold
,
A. Vincent
,
I. Walukiewicz
Theoretical Computer Science
303
(1), 2003, pp. 7-34
Functional labels and syntactic entropy on DNA strings and proteins
A. Carbone
,
M. Gromov
Theoretical Computer Science
303
(1), 2003, pp. 35-51
On the amplitude of intervals of natural numbers whose every element has a common prime divisor with at least an extremity
Patrick Cégielski
,
François Heroult
,
Denis Richard
Theoretical Computer Science
303
(1), 2003, pp. 53-62
On feasible cases of checking multi-agent systems behavior
Michael Dekhtyar
,
Alexander Dikovsky
,
Mars Valiev
Theoretical Computer Science
303
(1), 2003, pp. 63-81
Algebraic proof systems over formulas
Dima Grigoriev
,
Edward A. Hirsch
Theoretical Computer Science
303
(1), 2003, pp. 83-102
On temporal logic versus Datalog
Ir'ene Guessarian
,
Eugénie Foustoucos
,
Theodore Andronikos
,
Foto Afrati
Theoretical Computer Science
303
(1), 2003, pp. 103-133
Finding approximate repetitions under Hamming distance
Roman Kolpakov
,
Gregory Kucherov
Theoretical Computer Science
303
(1), 2003, pp. 135-156
Tree-width and the monadic quantifier hierarchy
J.A. Makowsky
,
J.P. Mariño
Theoretical Computer Science
303
(1), 2003, pp. 157-170
Complexity of some problems in positive and related calculi
L. Maksimova
Theoretical Computer Science
303
(1), 2003, pp. 171-185
A termination proof for epsilon substitution using partial derivations
G. Mints
Theoretical Computer Science
303
(1), 2003, pp. 187-213
A gap property of deterministic tree languages
Damian Niwiński
,
Igor Walukiewicz
Theoretical Computer Science
303
(1), 2003, pp. 215-231
Resolution lower bounds for the weak functional pigeonhole principle
Alexander A. Razborov
Theoretical Computer Science
303
(1), 2003, pp. 233-243
On categorical equivalence of Gentzen-style derivations in IMLL
Sergei Soloviev
,
Vladimir Orevkov
Theoretical Computer Science
303
(1), 2003, pp. 245-260
Generalized domino-shuffling
James Propp
Theoretical Computer Science
303
(2-3), 2003, pp. 267-301
Tile invariants: New horizons
Igor Pak
Theoretical Computer Science
303
(2-3), 2003, pp. 303-331
Combinatorics of perfect matchings in plane bipartite graphs and application to tilings
J.C. Fournier
Theoretical Computer Science
303
(2-3), 2003, pp. 333-351
An
O(n \log n)
-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded
Nicolas Thiant
Theoretical Computer Science
303
(2-3), 2003, pp. 353-374
An algorithm to generate exactly once every tiling with lozenges of a domain
Sébastien Desreux
Theoretical Computer Science
303
(2-3), 2003, pp. 375-408
Forcing numbers of stop signs
Fumei Lam
,
Lior Pachter
Theoretical Computer Science
303
(2-3), 2003, pp. 409-416
A codicity undecidable problem in the plane
Danièle Beauquier
,
Maurice Nivat
Theoretical Computer Science
303
(2-3), 2003, pp. 417-430
Data structures and algorithms for tilings
Olaf Delgado-Friedrichs
Theoretical Computer Science
303
(2-3), 2003, pp. 431-445
A weakly mixing tiling dynamical system with a smooth model
Thomas L. Fitzkee
,
Kevin G. Hockett
,
E. Arthur, Jr. Robinson
Theoretical Computer Science
303
(2-3), 2003, pp. 447-462
Hierarchical structures in Sturmian dynamical systems
Daniel Lenz
Theoretical Computer Science
303
(2-3), 2003, pp. 463-490
Additive and multiplicative properties of point sets based on beta-integers
Christiane Frougny
,
Jean-Pierre Gazeau
,
Rudolf Krejcar
Theoretical Computer Science
303
(2-3), 2003, pp. 491-516
New approximation algorithm for RTILE problem
Krzysztof Lorys
,
Katarzyna E. Paluch
Theoretical Computer Science
303
(2-3), 2003, pp. 517-537
Seiten 1
2
>