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=Inf.~Comput. AND Volume=209
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Unbounded-error quantum computation with small space bounds
Abuzer Yakaryılmaz
,
A.C. Cem Say
Information and Computation
209
(6), 2011, pp. 873-892
Infinitary Combinatory Reduction Systems
Jeroen Ketema
,
Jakob Grue Simonsen
Information and Computation
209
(6), 2011, pp. 893-926
The impossibility of boosting distributed service resilience
Paul Attie
,
Rachid Guerraoui
,
Petr Kuznetsov
,
Nancy Lynch
,
Sergio Rajsbaum
Information and Computation
209
(6), 2011, pp. 927-950
Leaf languages and string compression
Lohrey Markus
Information and Computation
209
(6), 2011, pp. 951-965
Probabilistic coherence spaces as a model of higher-order probabilistic computation
Vincent Danos
,
Thomas Ehrhard
Information and Computation
209
(6), 2011, pp. 966-991
Curves that must be retraced
Xiaoyang Gu
,
Jack H. Lutz
,
Elvira Mayordomo
Information and Computation
209
(6), 2011, pp. 992-1006
An ID-based multi-signer universal designated multi-verifier signature scheme
Ting-Yi Chang
Information and Computation
209
(7), 2011, pp. 1007-1015
Two-way unary automata versus logarithmic space
Viliam Geffert
,
Giovanni Pighizzini
Information and Computation
209
(7), 2011, pp. 1016-1025
Automatic decidability and combinability
Christopher Lynch
,
Silvio Ranise
,
Christophe Ringeissen
,
Duc-Khanh Tran
Information and Computation
209
(7), 2011, pp. 1026-1047
Unprovability of the logical characterization of bisimulation
Pedro Sánchez Terraf
Information and Computation
209
(7), 2011, pp. 1048-1056
Faster query algorithms for the text fingerprinting problem
Chi-Yuan Chan
,
Hung-I Yu
,
Wing-Kai Hon
,
Biing-Feng Wang
Information and Computation
209
(7), 2011, pp. 1057-1069
Space-efficient construction of Lempel-Ziv compressed text indexes
Diego Arroyuelo
,
Gonzalo Navarro
Information and Computation
209
(7), 2011, pp. 1070-1102
Treewidth computations II. Lower bounds
Hans L. Bodlaender
,
Arie M.C.A. Koster
Information and Computation
209
(7), 2011, pp. 1103-1119
On properties not inherited by monoids from their Schützenberger groups
R. Gray
,
A. Malheiro
,
S.J. Pride
Information and Computation
209
(7), 2011, pp. 1120-1134
A characterization of computable analysis on unbounded domains using differential equations
Manuel L. Campagnolo
,
Kerry Ojakian
Information and Computation
209
(8), 2011, pp. 1135-1159
Qualitative reachability in stochastic BPA games
Tomás̑ Brázdil
,
Václav Broz̑ek
,
Antonín Kuc̑era
,
Jan Obdrz̑álek
Information and Computation
209
(8), 2011, pp. 1160-1183
Sharp lower bounds on the extractable randomness from non-uniform sources
Boris S̑korić
,
Chibuzo Obi
,
Evgeny Verbitskiy
,
Berry Schoenmakers
Information and Computation
209
(8), 2011, pp. 1184-1196
Structural induction in institutions
Rȃzvan Diaconescu
Information and Computation
209
(9), 2011, pp. 1197-1222
Constructing perfect steganographic systems
Boris Ryabko
,
Daniil Ryabko
Information and Computation
209
(9), 2011, pp. 1223-1230
On the expressive power of schemes
Gilles Dowek
,
Ying Jiang
Information and Computation
209
(9), 2011, pp. 1231-1245
A unifying approach to picture grammars
Matteo Pradella
,
Alessandra Cherubini
,
Stefano Crespi Reghizzi
Information and Computation
209
(9), 2011, pp. 1246-1267
Algebraic proofs over noncommutative formulas
Iddo Tzameret
Information and Computation
209
(10), 2011, pp. 1269-1292
Optimal language learning from positive data
John Case
,
Samuel E. Moelius III
Information and Computation
209
(10), 2011, pp. 1293-1311
Introduction to clarithmetic I
Giorgi Japaridze
Information and Computation
209
(10), 2011, pp. 1312-1354
Modelling concurrency with comtraces and generalized comtraces
Ryszard Janicki
,
Dai Tri Man Lê
Information and Computation
209
(11), 2011, pp. 1355-1389
Seiten
<
1
2
3
4
>