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=325
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A multi-scale constraint programming model of alternative splicing regulation
Damien Eveillard
,
Delphine Ropers
,
Hidde de Jong
,
Christiane Branlant
,
Alexander Bockmayr
Theoretical Computer Science
325
(1), 2004, pp. 3-24
Modeling and querying biomolecular interaction networks
Nathalie Chabrier-Rivier
,
Marc Chiaverini
,
Vincent Danos
,
François Fages
,
Vincent Schächter
Theoretical Computer Science
325
(1), 2004, pp. 25-44
Taming the complexity of biochemical models through bisimulation and collapsing: Theory and practice
M. Antoniotti
,
C. Piazza
,
A. Policriti
,
M. Simeoni
,
B. Mishra
Theoretical Computer Science
325
(1), 2004, pp. 45-67
Formal molecular biology
Vincent Danos
,
Cosimo Laneve
Theoretical Computer Science
325
(1), 2004, pp. 69-110
Modelling biochemical pathways through enhanced
\pi
-calculus
M. Curti
,
P. Degano
,
C. Priami
,
C.T. Baldari
Theoretical Computer Science
325
(1), 2004, pp. 111-140
BioAmbients: An abstraction for biological compartments
Aviv Regev
,
Ekaterina M. Panina
,
William Silverman
,
Luca Cardelli
,
Ehud Shapiro
Theoretical Computer Science
325
(1), 2004, pp. 141-167
The Pascal matroid as a home for generating sets of cellular automata configurations defined by quasigroups
A. Barbé
,
F. von Haeseler
Theoretical Computer Science
325
(2), 2004, pp. 171-214
Efficient exhaustive listings of reversible one dimensional cellular automata
Tim Boykett
Theoretical Computer Science
325
(2), 2004, pp. 215-247
Solution of some conjectures about topological properties of linear cellular automata
Gianpiero Cattaneo
,
Alberto Dennunzio
,
Luciano Margara
Theoretical Computer Science
325
(2), 2004, pp. 249-271
On the size of the inverse neighborhoods for one-dimensional reversible cellular automata
Eugen Czeizler
Theoretical Computer Science
325
(2), 2004, pp. 273-284
On conservative and monotone one-dimensional cellular automata and their particle representation
Andrés Moreira
,
Nino Boccara
,
Eric Goles
Theoretical Computer Science
325
(2), 2004, pp. 285-316
The complexity of reversible cellular automata
K. Sutner
Theoretical Computer Science
325
(2), 2004, pp. 317-328
How to turn a second-order cellular automaton into a lattice gas: A new inversion scheme
Tommaso Toffoli
,
Silvio Capobianco
,
Patrizia Mentrasti
Theoretical Computer Science
325
(2), 2004, pp. 329-344
Genomic distances under deletions and insertions
Mark Marron
,
Krister M. Swenson
,
Bernard M.E. Moret
Theoretical Computer Science
325
(3), 2004, pp. 347-360
A space-efficient algorithm for sequence alignment with inversions and reversals
Zhi-Zhong Chen
,
Yong Gao
,
Guohui Lin
,
Robert Niewiadomski
,
Yang Wang
,
Junfeng Wu
Theoretical Computer Science
325
(3), 2004, pp. 361-372
The complexity of Boolean matrix root computation
Martin Kutz
Theoretical Computer Science
325
(3), 2004, pp. 373-390
Efficient data mappings for parity-declustered data layouts
Eric J. Schwabe
,
Ian M. Sutherland
Theoretical Computer Science
325
(3), 2004, pp. 391-407
Approximate and dynamic rank aggregation
Francis Y.L. Chin
,
Xiaotie Deng
,
Qizhi Fang
,
Shanfeng Zhu
Theoretical Computer Science
325
(3), 2004, pp. 409-424
The structure and number of global roundings of a graph
Tetsuo Asano
,
Naoki Katoh
,
Hisao Tamaki
,
Takeshi Tokuyama
Theoretical Computer Science
325
(3), 2004, pp. 425-437
Randomized approximation of the stable marriage problem
Magnús M. Hallórsson
,
Kazuo Iwama
,
Shuichi Miyazaki
,
Hiroki Yanagisawa
Theoretical Computer Science
325
(3), 2004, pp. 439-465
Improved competitive algorithms for online scheduling with partial job values
Francis Y.L. Chin
,
Stanley P.Y. Fung
Theoretical Computer Science
325
(3), 2004, pp. 467-478
Scheduling broadcasts with deadlines
Jae-Hoon Kim
,
Kyung-Yong Chwa
Theoretical Computer Science
325
(3), 2004, pp. 479-488