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=2011
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the OBDD complexity of the most significant bit of integer multiplication
Beate Bollig
Theoretical Computer Science
412
(18), 2011, pp. 1686-1695
Local 7-coloring for planar subgraphs of unit disk graphs
J. Czyzowicz
,
S. Dobrev
,
H. González-Aguilar
,
R. Kralovic
,
E. Kranakis
,
J. Opatrny
,
L. Stacho
,
J. Urrutia
Theoretical Computer Science
412
(18), 2011, pp. 1696-1704
Smart PAC-learners
Malte Darnstädt
,
Hans Ulrich Simon
Theoretical Computer Science
412
(19), 2011, pp. 1756-1766
Two faces of active learning
Sanjoy Dasgupta
Theoretical Computer Science
412
(19), 2011, pp. 1767-1781
Reconstructing weighted graphs with minimal query complexity
Nader H. Bshouty
,
Hanna Mazzawi
Theoretical Computer Science
412
(19), 2011, pp. 1782-1790
Predicting the labels of an unknown graph via adaptive exploration
Nicolò Cesa-Bianchi
,
Claudio Gentile
,
Fabio Vitale
Theoretical Computer Science
412
(19), 2011, pp. 1791-1804
Pure exploration in finitely-armed and continuous-armed bandits
Sébastien Bubeck
,
Rémi Munos
,
Gilles Stoltz
Theoretical Computer Science
412
(19), 2011, pp. 1832-1852
Geometry of interaction V: Logic in the hyperfinite factor
Jean-Yves Girard
Theoretical Computer Science
412
(20), 2011, pp. 1860-1883
A linear algorithm for MLL proof net correctness and sequentialization
Stefano Guerrini
Theoretical Computer Science
412
(20), 2011, pp. 1958-1978
Musings around the geometry of interaction, and coherence
Jean Goubault-Larrecq
Theoretical Computer Science
412
(20), 2011, pp. 1998-2014
Towards a geometry of recursion
Esfandiar Haghverdi
Theoretical Computer Science
412
(20), 2011, pp. 2015-2028
Realizability models and implicit complexity
Ugo Dal Lago
,
Martin Hofmann
Theoretical Computer Science
412
(20), 2011, pp. 2029-2047
Computing reachable states for nonlinear biological models
Thao Dang
,
Colas Le Guernic
,
Oded Maler
Theoretical Computer Science
412
(21), 2011, pp. 2095-2107
Design, optimization and predictions of a coupled model of the cell cycle, circadian clock, DNA repair system, irinotecan metabolism and exposure control under temporal logic constraints
Elisabetta De Maria
,
François Fages
,
Aurélien Rizk
,
Sylvain Soliman
Theoretical Computer Science
412
(21), 2011, pp. 2108-2127
Approximation of event probabilities in noisy cellular processes
Frédéric Didier
,
Thomas A. Henzinger
,
Maria Mateescu
,
Verena Wolf
Theoretical Computer Science
412
(21), 2011, pp. 2128-2141
A semantic equivalence for Bio-PEPA based on discretisation of continuous values
Vashti Galpin
,
Jane Hillston
Theoretical Computer Science
412
(21), 2011, pp. 2142-2161
Optimization techniques for small matrix multiplication
Charles-Éric Drevet
,
Md. Nazrul Islam
,
Éric Schost
Theoretical Computer Science
412
(22), 2011, pp. 2219-2236
Universal recursively enumerable sets of strings
Cristian S. Calude
,
André Nies
,
Ludwig Staiger
,
Frank Stephan
Theoretical Computer Science
412
(22), 2011, pp. 2253-2261
On the number of binary-minded individuals required to compute
\sqrt {\frac 12}
Guillaume Aupy
,
Olivier Bournez
Theoretical Computer Science
412
(22), 2011, pp. 2262-2267
Inconstancy of finite and infinite sequences
Jean-Paul Allouche
,
Laurence Maillard-Teyssier
Theoretical Computer Science
412
(22), 2011, pp. 2268-2281
Extending the notion of rationality of selfish agents: Second Order Nash equilibria
Vittorio Bilò
,
Michele Flammini
Theoretical Computer Science
412
(22), 2011, pp. 2296-2311
Series-parallel languages on scattered and countable posets
Nicolas Bedon
,
Chloé Rispal
Theoretical Computer Science
412
(22), 2011, pp. 2356-2369
New upper bounds on the
L(2,1)
-labeling of the skew and converse skew product graphs
Ziming Duan
,
Pingli Lv
,
Lianying Miao
,
Zhengke Miao
,
Cuiqi Wang
Theoretical Computer Science
412
(22), 2011, pp. 2393-2397
Parallel randomized load balancing: A lower bound for a more general model
Guy Even
,
Moti Medina
Theoretical Computer Science
412
(22), 2011, pp. 2398-2408
Embedding into the rectilinear plane in optimal
O(n^2)
time
Nicolas Catusse
,
Victor Chepoi
,
Yann Vaxès
Theoretical Computer Science
412
(22), 2011, pp. 2425-2433
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>