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 YEAR=2004
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Classifying RNA pseudoknotted structures
Anne Condon
,
Beth Davy
,
Baharak Rastegari
,
Shelly Zhao
,
Finbarr Tarrant
Theoretical Computer Science
320
(1), 2004, pp. 35-50
Families of languages defined by ciliate bio-operations
Mark Daley
,
Lila Kari
,
Ian McQuillan
Theoretical Computer Science
320
(1), 2004, pp. 51-69
Neural computation, social networks, and topological spectra
Michelangelo Diligenti
,
Marco Gori
,
Marco Maggini
Theoretical Computer Science
320
(1), 2004, pp. 71-87
On the computational complexity of membrane systems
Oscar H. Ibarra
Theoretical Computer Science
320
(1), 2004, pp. 89-109
New spectral lower bounds on the bisection width of graphs
S. Bezrukov
,
R. Elsässer
,
B. Monien
,
R. Preis
,
J.-P. Tillich
Theoretical Computer Science
320
(2-3), 2004, pp. 155-174
On groups whose word problem is solved by a counter automaton
Gillian Z. Elston
,
Gretchen Ostheimer
Theoretical Computer Science
320
(2-3), 2004, pp. 175-185
String-matching with OBDDs
Ch. Choffrut
,
Y. Haddad
Theoretical Computer Science
320
(2-3), 2004, pp. 187-198
Bounding the firing synchronization problem on a ring
André Berthiaume
,
Todd Bittner
,
Ljubomir Perković
,
Amber Settle
,
Janos Simon
Theoretical Computer Science
320
(2-3), 2004, pp. 213-228
Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures
Carlo Blundo
,
Paolo D'Arco
,
Vanessa Daza
,
Carles Padró
Theoretical Computer Science
320
(2-3), 2004, pp. 269-291
Deletion along trajectories
Michael Domaratzki
Theoretical Computer Science
320
(2-3), 2004, pp. 293-313
Algorithms for multi-level graph planarity testing and layout
Patrick Healy
,
Ago Kuusik
Theoretical Computer Science
320
(2-3), 2004, pp. 331-344
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances
Simona Cocco
,
Rémi Monasson
Theoretical Computer Science
320
(2-3), 2004, pp. 345-372
Algorithms for four variants of the exact satisfiability problem
Vilhelm Dahllöf
,
Peter Jonsson
,
Richard Beigel
Theoretical Computer Science
320
(2-3), 2004, pp. 373-394
An algorithmic view of gene teams
Marie-Pierre Béal
,
Anne Bergeron
,
Sylvie Corteel
,
Mathieu Raffinot
Theoretical Computer Science
320
(2-3), 2004, pp. 395-418
On probabilistic analog automata
Asa Ben-Hur
,
Alexander Roitershtein
,
Hava T. Siegelmann
Theoretical Computer Science
320
(2-3), 2004, pp. 449-464
Chebyshev polynomials over finite fields and reversibility of
\sigma
-automata on square grids
Markus Hunziker
,
António Machiavelo
,
Jihun Park
Theoretical Computer Science
320
(2-3), 2004, pp. 465-483
Paired-domination in inflated graphs
Liying Kang
,
Moo Young Sohn
,
T.C.E. Cheng
Theoretical Computer Science
320
(2-3), 2004, pp. 485-494
The size of
SPP
John M. Hitchcock
Theoretical Computer Science
320
(2-3), 2004, pp. 495-503
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
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
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>