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=80
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Simplicity, immunity, relativizations and nondeterminism
Leen Torenvliet
,
Peter van Emde Boas
Information and Computation
80
(1), 1989, pp. 1-17
Optimizing propositional calculus formulas with regard to questions of deducibility
Hans Kleine Büning
,
Ulrich Löwen
Information and Computation
80
(1), 1989, pp. 18-43
Relativized Arthur-Merlin versus Merlin-Arthur games
Miklos Santha
Information and Computation
80
(1), 1989, pp. 44-49
Partiality, Cartesian closedness, and toposes
P.-L. Curien
,
A. Obtulowicz
Information and Computation
80
(1), 1989, pp. 50-95
Unique normal forms for Lambda calculus with surjective pairing
J.W. Klop
,
R.C. de Vrijer
Information and Computation
80
(2), 1989, pp. 97-113
The power of two-way deterministic checking stack automata
Joost Engelfriet
Information and Computation
80
(2), 1989, pp. 114-120
Correctness proofs for abstract implementations
Gilles Bernot
Information and Computation
80
(2), 1989, pp. 121-151
\NC
algorithms for computing the number of perfect matchings in
K{3,3}
-free graphs and related problems
Vijay V. Vazirani
Information and Computation
80
(2), 1989, pp. 152-164
A language independent proof of the soundness and completeness of generalized Hoare logic
Patrick Cousot
,
Radhia Cousot
Information and Computation
80
(2), 1989, pp. 165-191
The iterated mod problem
Howard J. Karloff
,
Walter L. Ruzzo
Information and Computation
80
(3), 1989, pp. 193-204
Complexity theory of parallel time and hardware
Patrick W. Dymond
,
Stephen A. Cook
Information and Computation
80
(3), 1989, pp. 205-226
Inferring decision trees using the minimum description length principle
J. Ross Quinlan
,
Ronald L. Rivest
Information and Computation
80
(3), 1989, pp. 227-248
Fairness in context-free grammars under every choice-strategy
Sara Porat
,
Nissim Francez
Information and Computation
80
(3), 1989, pp. 249-268
The logarithmic alternation hierarchy collapses:
A\Sigma2^{\cal{}L}=A\Pi2^{\cal{}L}
Birgit Jenner
,
Bernd Kirsig
,
Klaus-Jörn Lange
Information and Computation
80
(3), 1989, pp. 269-288