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=205
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Alternating two-way AC-tree automata
Kumar Neeraj Verma
,
Jean Goubault-Larrecq
Information and Computation
205
(6), 2007, pp. 817-869
On decidability of monadic logic of order over the naturals extended by monadic predicates
Alexander Rabinovich
Information and Computation
205
(6), 2007, pp. 870-889
One-unambiguity of regular expressions with numeric occurrence indicators
Pekka Kilpeläinen
,
Rauno Tuhkanen
Information and Computation
205
(6), 2007, pp. 890-916
Nominal rewriting
Maribel Fernández
,
Murdoch J. Gabbay
Information and Computation
205
(6), 2007, pp. 917-965
Efficient and exact quantum compression
John H. Reif
,
Sukhendu Chakraborty
Information and Computation
205
(7), 2007, pp. 967-981
A general mathematics of names
Murdoch J. Gabbay
Information and Computation
205
(7), 2007, pp. 982-1011
Fast gapped variants for Lempel-Ziv-Welch compression
Alberto Apostolico
Information and Computation
205
(7), 2007, pp. 1012-1026
Symbolic model checking for probabilistic timed automata
Marta Kwiatkowska
,
Gethin Norman
,
Jeremy Sproston
,
Fuzhi Wang
Information and Computation
205
(7), 2007, pp. 1027-1077
On identifying codes that are robust against edge changes
Iiro Honkala
,
Tero Laihonen
Information and Computation
205
(7), 2007, pp. 1078-1095
Rotation and lighting invariant template matching
Kimmo Fredriksson
,
Veli Mäkinen
,
Gonzalo Navarro
Information and Computation
205
(7), 2007, pp. 1096-1113
Addendum to ``Scalable secure storage when half the system is faulty''
Noga Alon
,
Haim Kaplan
,
Michael Krivelevich
,
Dahlia Malkhi
,
Julien Stern
Information and Computation
205
(7), 2007, pp. 1114-1116
Hardness of fully dense problems
Nir Ailon
,
Noga Alon
Information and Computation
205
(8), 2007, pp. 1117-1129
When not losing is better than winning: Abstraction and refinement for the full
\mu
-calculus
Orna Grumberg
,
Martin Lange
,
Martin Leucker
,
Sharon Shoham
Information and Computation
205
(8), 2007, pp. 1130-1148
Task automata: Schedulability, decidability and undecidability
Elena Fersman
,
Pavel Krcal
,
Paul Pettersson
,
Wang Yi
Information and Computation
205
(8), 2007, pp. 1149-1172
Complementing two-way finite automata
Viliam Geffert
,
Carlo Mereghetti
,
Giovanni Pighizzini
Information and Computation
205
(8), 2007, pp. 1173-1187
Generalizing DPLL and satisfiability for equalities
Bahareh Badban
,
Jaco van de Pol
,
Olga Tveretina
,
Hans Zantema
Information and Computation
205
(8), 2007, pp. 1188-1211
Inverse monoids: Decidability and complexity of algebraic questions
Markus Lohrey
,
Nicole Ondrusch
Information and Computation
205
(8), 2007, pp. 1212-1234
Controlling information release in the
\pi
-calculus
Silvia Crafa
,
Sabina Rossi
Information and Computation
205
(8), 2007, pp. 1235-1273
Cluster computing and the power of edge recognition
Lane A. Hemaspaandra
,
Christopher M. Homan
,
Sven Kosub
Information and Computation
205
(8), 2007, pp. 1274-1293
Exponential lower bounds for the number of words of uniform length avoiding a pattern
Jason P. Bell
,
Teow Lim Goh
Information and Computation
205
(9), 2007, pp. 1295-1306
Computing the edit distance of a regular language
Stavros Konstantinidis
Information and Computation
205
(9), 2007, pp. 1307-1316
Dimensions of Copeland-Erdŏs sequences
Xiaoyang Gu
,
Jack H. Lutz
,
Philippe Moser
Information and Computation
205
(9), 2007, pp. 1317-1333
Instruction-level security analysis for information flow in stack-based assembly languages
Nicoletta De Francesco
,
Luca Martini
Information and Computation
205
(9), 2007, pp. 1334-1370
Intersection-types à la Church
Luigi Liquori
,
Simona Ronchi Della Rocca
Information and Computation
205
(9), 2007, pp. 1371-1386
Lower bound technique for length-reducing automata
Tomasz Jurdziński
,
Krzysztof Loryś
Information and Computation
205
(9), 2007, pp. 1387-1412
Seiten
<
1
2
3
>