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=Inf.~Comput. AND Volume=139
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient execution of nondeterministic parallel programs on asynchronous systems
Yonatan Aumann
,
Michael A. Bender
,
Lisa Zhang
Information and Computation
139
(1), 1997, pp. 1-16
On the sequentiality of the successor function
Christiane Frougny
Information and Computation
139
(1), 1997, pp. 17-38
Termination of system
F
-bounded: A complete proof
Giorgio Ghelli
Information and Computation
139
(1), 1997, pp. 39-56
The simply typed theory of
\beta
-conversion has no maximum extension
Franco Barbanera
,
Stefano Berardi
Information and Computation
139
(1), 1997, pp. 57-61
Axiomatizing shuffle and concatenation in languages
Stephen L. Bloom
,
Zoltán Ésik
Information and Computation
139
(1), 1997, pp. 62-91
On interval routing schemes and treewidth
Hans L. Bodlaender
,
Jan van Leeuwen
,
Richard Tan
,
Dimitrios M. Thilikos
Information and Computation
139
(1), 1997, pp. 92-109
Complexity of equivalence problems for concurrent systems of finite agents
Alexander Rabinovich
Information and Computation
139
(2), 1997, pp. 111-129
Positive tree representations and applications to tree automata
Symeon Bozapalidis
Information and Computation
139
(2), 1997, pp. 130-153
Lambda calculus with explicit recursion
Zena M. Ariola
,
Jan Willem Klop
Information and Computation
139
(2), 1997, pp. 154-233
Time bounded frequency computations
Maren Hinrichs
,
Gerd Wechsung
Information and Computation
139
(2), 1997, pp. 234-257
A worst-case analysis of the LZ2 compression algorithm
Sergio de Agostino
,
Riccardo Silvestri
Information and Computation
139
(2), 1997, pp. 258-268