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=408
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bayesian inference for differential equations
Mark Girolami
Theoretical Computer Science
408
(1), 2008, pp. 4-16
nano
\kappa
: A calculus for the modeling and simulation of nano devices
A. Credi
,
M. Garavelli
,
C. Laneve
,
S. Pradalier
,
S. Silvi
,
G. Zavattaro
Theoretical Computer Science
408
(1), 2008, pp. 17-30
Chemical master equation and Langevin regimes for a gene transcription model
Raya Khanin
,
Desmond J. Higham
Theoretical Computer Science
408
(1), 2008, pp. 31-40
Modelling co-transcriptional cleavage in the synthesis of yeast pre-rRNA
Federica Ciocchetta
,
Jane Hillston
,
Martin Kos
,
David Tollervey
Theoretical Computer Science
408
(1), 2008, pp. 41-54
On temporal logic constraint solving for analyzing numerical data time series
François Fages
,
Aurélien Rizk
Theoretical Computer Science
408
(1), 2008, pp. 55-65
Synapses as stochastic concurrent systems
Andrea Bracciali
,
Marcello Brunelli
,
Enrico Cataldo
,
Pierpaolo Degano
Theoretical Computer Science
408
(1), 2008, pp. 66-82
Evolving BlenX programs to simulate the evolution of biological networks
L. Dematté
,
C. Priami
,
A. Romanel
,
O. Soyer
Theoretical Computer Science
408
(1), 2008, pp. 83-96
The unpredictable deviousness of models
Franco P. Preparata
Theoretical Computer Science
408
(2-3), 2008, pp. 99-105
Incremental discovery of the irredundant motif bases for all suffixes of a string in
O(n^2\log n)
time
Alberto Apostolico
,
Claudia Tagliacollo
Theoretical Computer Science
408
(2-3), 2008, pp. 106-115
On the power of lookahead in on-line server routing problems
Luca Allulli
,
Giorgio Ausiello
,
Vincenzo Bonifaci
,
Luigi Laura
Theoretical Computer Science
408
(2-3), 2008, pp. 116-128
Drawing colored graphs on colored points
Melanie Badent
,
Emilio Di Giacomo
,
Giuseppe Liotta
Theoretical Computer Science
408
(2-3), 2008, pp. 129-142
Area-time tradeoffs for universal VLSI circuits
Sandeep N. Bhatt
,
Gianfranco Bilardi
,
Geppino Pucci
Theoretical Computer Science
408
(2-3), 2008, pp. 143-150
Cavity detection and matching for binding site recognition
Mary Ellen Bock
,
Claudio Garutti
,
Concettina Guerra
Theoretical Computer Science
408
(2-3), 2008, pp. 151-162
Anisotropic diagrams: Labelle Shewchuk approach revisited
Jean-Daniel Boissonnat
,
Camille Wormser
,
Mariette Yvinec
Theoretical Computer Science
408
(2-3), 2008, pp. 163-173
Succinct representations of planar maps
L. Castelli Aleardi
,
O. Devillers
,
G. Schaeffer
Theoretical Computer Science
408
(2-3), 2008, pp. 174-187
The complexity of equilibria: Hardness results for economies via a correspondence with games
Bruno Codenotti
,
Amin Saberi
,
Kasturi Varadarajan
,
Yinyu Ye
Theoretical Computer Science
408
(2-3), 2008, pp. 188-198
Pipelined algorithms to detect cheating in long-term grid computations
Michael T. Goodrich
Theoretical Computer Science
408
(2-3), 2008, pp. 199-207
Reductions for monotone Boolean circuits
Kazuo Iwama
,
Hiroki Morizumi
,
Jun Tarui
Theoretical Computer Science
408
(2-3), 2008, pp. 208-212
Commitment under uncertainty: Two-stage stochastic matching problems
Irit Katriel
,
Claire Kenyon-Mathieu
,
Eli Upfal
Theoretical Computer Science
408
(2-3), 2008, pp. 213-223
Algorithms for computing a parameterized
st
-orientation
Charalampos Papamanthou
,
Ioannis G. Tollis
Theoretical Computer Science
408
(2-3), 2008, pp. 224-240
Nanowire addressing with randomized-contact decoders
Eric Rachlin
,
John E. Savage
Theoretical Computer Science
408
(2-3), 2008, pp. 241-261