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=319
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tilings of rectangles with
T
-tetrominoes
Michael Korn
,
Igor Pak
Theoretical Computer Science
319
(1-3), 2004, pp. 3-27
Applications of graphical condensation for enumerating matchings and tilings
Eric H. Kuo
Theoretical Computer Science
319
(1-3), 2004, pp. 29-57
Tilings with trichromatic colored-edges triangles
Olivier Bodini
,
Eric Rémila
Theoretical Computer Science
319
(1-3), 2004, pp. 59-70
A formula for the number of tilings of an octagon by rhombi
N. Destainville
,
R. Mosseri
,
F. Bailly
Theoretical Computer Science
319
(1-3), 2004, pp. 71-81
Domino tilings and related models: Space of configurations of domains with holes
Sébastien Desreux
,
Martin Matamala
,
Ivan Rapaport
,
Eric Rémila
Theoretical Computer Science
319
(1-3), 2004, pp. 83-101
Algebraic and model-theoretic properties of tilings
Francis Oger
Theoretical Computer Science
319
(1-3), 2004, pp. 103-126
Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines
Jean-Charles Delvenne
,
Vincent D. Blondel
Theoretical Computer Science
319
(1-3), 2004, pp. 127-143
Two-dimensional iterated morphisms and discrete planes
Pierre Arnoux
,
Valérie Berthé
,
Anne Siegel
Theoretical Computer Science
319
(1-3), 2004, pp. 145-176
Lattices and multi-dimensional words
Valérie Berthé
,
Robert Tijdeman
Theoretical Computer Science
319
(1-3), 2004, pp. 177-202
Connectivity of discrete planes
Valentin E. Brimkov
,
Reneta P. Barneva
Theoretical Computer Science
319
(1-3), 2004, pp. 203-227
Periodicity and local complexity
Anthony Quas
,
Luca Zamboni
Theoretical Computer Science
319
(1-3), 2004, pp. 229-240
Canonical substitutions tilings of Ammann-Beenker type
E.O. Harriss
,
J.S.W. Lamb
Theoretical Computer Science
319
(1-3), 2004, pp. 241-279
Symmetry groups for beta-lattices
Avi Elkharrat
,
Christiane Frougny
,
Jean-Pierre Gazeau
,
Jean-Louis Verger-Gaugry
Theoretical Computer Science
319
(1-3), 2004, pp. 281-305
Distribution results for low-weight binary representations for pairs of integers
Peter J. Grabner
,
Clemens Heuberger
,
Helmut Prodinger
Theoretical Computer Science
319
(1-3), 2004, pp. 307-331
A
q
-enumeration of convex polyominoes by the festoon approach
Svjetlan Feretić
Theoretical Computer Science
319
(1-3), 2004, pp. 333-356
Distance graph on
Z^n
with
l_1
norm
Zoltán Füredi
,
Jeong-Hyun Kang
Theoretical Computer Science
319
(1-3), 2004, pp. 357-366
Leader election in plane cellular automata, only with left-right global convention
Codrin Nichitiu
,
Christophe Papazian
,
Eric Rémila
Theoretical Computer Science
319
(1-3), 2004, pp. 367-384
Counting lattice paths taking steps in infinitely many directions under special access restrictions
Katherine Humphreys
,
Heinrich Niederhausen
Theoretical Computer Science
319
(1-3), 2004, pp. 385-409
Identifying codes in some subgraphs of the square lattice
Marc Daniel
,
Sylvain Gravier
,
Julien Moncel
Theoretical Computer Science
319
(1-3), 2004, pp. 411-421
A symbolical algorithm on additive basis and double-loop networks
F. Aguiló
,
D. Arteaga
,
I. Diego
Theoretical Computer Science
319
(1-3), 2004, pp. 423-439
The number of binary words avoiding Abelian fourth powers grows exponentially
James D. Currie
Theoretical Computer Science
319
(1-3), 2004, pp. 441-446
The
NP
-completeness of a tomographical problem on bicolored domino tilings
A. Frosini
,
G. Simi
Theoretical Computer Science
319
(1-3), 2004, pp. 447-454
On unique graph 3-colorability and parsimonious reductions in the plane
Régis Barbanchon
Theoretical Computer Science
319
(1-3), 2004, pp. 455-482