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 YEAR=1997
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
The complexity of parallel prefix problems on small domains
Shiva P. Chaudhuri
,
Jaikumar Radhakrishnan
Information and Computation
138
(1), 1997, pp. 1-22
Efficient learning of typical finite automata from random walks
Yoav Freund
,
Michael Kearns
,
Dana Ron
,
Ronitt Rubinfeld
,
Robert E. Schapire
Information and Computation
138
(1), 1997, pp. 23-48
On schematological equivalence of partially interpreted dataflow networks
Alexander Rabinovich
Information and Computation
138
(1), 1997, pp. 49-87
Separating the power of EREW and CREW PRAMs with small communication width
Paul Beame
,
Faith E. Fich
,
Rakesh K. Sinha
Information and Computation
138
(1), 1997, pp. 89-99
On the Jacopini technique
Jan Kuper
Information and Computation
138
(2), 1997, pp. 101-123
A complete axiomatization of finite-state ACSR processes
Patrice Brémond-Grégoire
,
Jin-Young Choi
,
Insup Lee
Information and Computation
138
(2), 1997, pp. 124-159
Context-sensitive string languages and recognizable picture languages
M. Latteux
,
D. Simplot
Information and Computation
138
(2), 1997, pp. 160-169
On the complexity of learning from drifting distributions
Rakesh D. Barve
,
Philip M. Long
Information and Computation
138
(2), 1997, pp. 170-193
Quiescence, fairness, testing, and the notion of implementation
Roberto Segala
Information and Computation
138
(2), 1997, pp. 194-210
Propositional lax logic
Matt Fairtlough
,
Michael Mendler
Information and Computation
137
(1), 1997, pp. 1-33
Non-existent Statman's double fixed point combinator does not exist, indeed
Benedetto Intrigila
Information and Computation
137
(1), 1997, pp. 35-40
Constraint logic programming with dynamic scheduling: A semantics based on closure operators
Moreno Falaschi
,
Maurizio Gabbrielli
,
Kim Marriott
,
Catuscia Palamidessi
Information and Computation
137
(1), 1997, pp. 41-67
Interaction combinators
Yves Lafont
Information and Computation
137
(1), 1997, pp. 69-101
Simulating shared memory in real time: On the computation power of reconfigurable architectures
Artur Czumaj
,
Friedhelm Meyer auf der Heide
,
Volker Stemann
Information and Computation
137
(2), 1997, pp. 103-120
Seiten 1
2
>