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
[1]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=2010
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Comparing free algebras in Topological and Classical Domain Theory
Ingo Battenfeld
Theoretical Computer Science
411
(19), 2010, pp. 1900-1917
Algebraic information theory for binary channels
Keye Martin
,
Ira S. Moskowitz
,
Gerard Allwein
Theoretical Computer Science
411
(19), 2010, pp. 1918-1927
An operational semantics for a calculus for wireless systems
Ivan Lanese
,
Davide Sangiorgi
Theoretical Computer Science
411
(19), 2010, pp. 1928-1948
Typed event structures and the linear
\pi
-calculus
Daniele Varacca
,
Nobuko Yoshida
Theoretical Computer Science
411
(19), 2010, pp. 1949-1973
Arrows for secure information flow
Peng Li
,
Steve Zdancewic
Theoretical Computer Science
411
(19), 2010, pp. 1974-1994
Detecting synchronisation of biological oscillators by model checking
Ezio Bartocci
,
Flavio Corradini
,
Emanuela Merelli
,
Luca Tesei
Theoretical Computer Science
411
(20), 2010, pp. 1999-2018
Query-based verification of qualitative trends and oscillations in biochemical systems
Paolo Ballarini
,
Maria Luisa Guerriero
Theoretical Computer Science
411
(20), 2010, pp. 2019-2036
Hybrid automata, reachability, and Systems Biology
Dario Campagna
,
Carla Piazza
Theoretical Computer Science
411
(20), 2010, pp. 2037-2051
Hybrid dynamics of stochastic programs
Luca Bortolussi
,
Alberto Policriti
Theoretical Computer Science
411
(20), 2010, pp. 2052-2077
Runtime analysis of a binary particle swarm optimizer
Dirk Sudholt
,
Carsten Witt
Theoretical Computer Science
411
(21), 2010, pp. 2084-2100
Analysis of particle interaction in particle swarm optimization
Ying-ping Chen
,
Pei Jiang
Theoretical Computer Science
411
(21), 2010, pp. 2101-2115
Analyzing the dynamics of stigmergetic interactions through pheromone games
Peter Vrancx
,
Katja Verbeeck
,
Ann Nowé
Theoretical Computer Science
411
(21), 2010, pp. 2116-2126
Stability analysis of the reproduction operator in bacterial foraging optimization
Arijit Biswas
,
Swagatam Das
,
Ajith Abraham
,
Sambarta Dasgupta
Theoretical Computer Science
411
(21), 2010, pp. 2127-2139
The pros and cons of flocking in the long-range ``migration'' of mobile robot swarms
Fatih Gökçe
,
Erol Şahin
Theoretical Computer Science
411
(21), 2010, pp. 2140-2154
The multiple facets of the canonical direct unit implicational basis
K. Bertet
,
B. Monjardet
Theoretical Computer Science
411
(22-24), 2010, pp. 2155-2166
Using abstract interpretation to add type checking for interfaces in Java bytecode verification
Nicoletta De Francesco
,
Giuseppe Lettieri
,
Luca Martini
Theoretical Computer Science
411
(22-24), 2010, pp. 2174-2201
Non-expansive
\epsilon
-bisimulations for probabilistic processes
Simone Tini
Theoretical Computer Science
411
(22-24), 2010, pp. 2202-2222
An exact correspondence between a typed pi-calculus and polarised proof-nets
Kohei Honda
,
Olivier Laurent
Theoretical Computer Science
411
(22-24), 2010, pp. 2223-2238
Probabilistic anonymity via coalgebraic simulations
Ichiro Hasuo
,
Yoshinobu Kawabe
,
Hideki Sakurada
Theoretical Computer Science
411
(22-24), 2010, pp. 2239-2259
A fluid analysis framework for a Markovian process algebra
Richard A. Hayden
,
Jeremy T. Bradley
Theoretical Computer Science
411
(22-24), 2010, pp. 2260-2297
Model checking memoryful linear-time logics over one-counter automata
Stéphane Demri
,
Ranko Lazić
,
Arnaud Sangnier
Theoretical Computer Science
411
(22-24), 2010, pp. 2298-2316
Alternating states for dual nondeterminism in imperative programming
Wim H. Hesselink
Theoretical Computer Science
411
(22-24), 2010, pp. 2317-2330
Complexity of metric temporal logics with counting and the Pnueli modalities
Alexander Rabinovich
Theoretical Computer Science
411
(22-24), 2010, pp. 2331-2342
Deterministic solutions to QSAT and Q3SAT by spiking neural
P
systems with pre-computed resources
Tseren-Onolt Ishdorj
,
Alberto Leporati
,
Linqiang Pan
,
Xiangxiang Zeng
,
Xingyi Zhang
Theoretical Computer Science
411
(25), 2010, pp. 2345-2358
Computing the graph-based parallel complexity of gene assembly
Artiom Alhazov
,
Chang Li
,
Ion Petre
Theoretical Computer Science
411
(25), 2010, pp. 2359-2367
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>