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=121
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Defying upward and downward separation
Lane A. Hemaspaandra
,
Sudhir K. Jha
Information and Computation
121
(1), 1995, August, pp. 1-13
On symmetry of information and polynomial time invertibility
Luc Longpré
,
Osamu Watanabe
Information and Computation
121
(1), 1995, August, pp. 14-22
Zero-knowledge arguments and public-key cryptography
Alfredo de Santis
,
Giovanni di Creszenzo
,
Giuseppe Persiano
Information and Computation
121
(1), 1995, August, pp. 23-40
The complexity of reconfiguring network models
Y. Ben-Asher
,
K.-J. Lange
,
D. Peleg
,
A. Schuster
Information and Computation
121
(1), 1995, August, pp. 41-58
Reactive, generative, and stratified models of probabilistic processes
Rob J. van Glabbeek
,
Scott A. Smolka
,
Bernhard Steffen
Information and Computation
121
(1), 1995, August, pp. 59-80
The complexity of default reasoning under the stationary fixed point semantics
Georg Gottlob
Information and Computation
121
(1), 1995, August, pp. 81-92
Efficient checkers for number-theoretic computations
Leonard M. Adleman
,
Ming-Deh Huang
,
Kireeti Kompella
Information and Computation
121
(1), 1995, August, pp. 93-102
Cutting plane and Frege proofs
Peter Clote
Information and Computation
121
(1), 1995, August, pp. 103-122
Completeness of path-problems via logical reductions
Iain A. Stewart
Information and Computation
121
(1), 1995, August, pp. 123-134
P, NP, and the Post Correspondence Problem
Alexandru Mateescu
,
Arto Salomaa
,
Kai Salomaa
,
Sheng Yu
Information and Computation
121
(2), 1995, pp. 135-142
Bisimulation equivalence is decidable for all context-free processes
Sren Christensen
,
Hans Hüttel
,
Colin Stirling
Information and Computation
121
(2), 1995, pp. 143-148
Timed testing of concurrent systems
Walter Vogler
Information and Computation
121
(2), 1995, pp. 149-171
Basic paramodulation
Leo Bachmair
,
Harald Ganzinger
,
Christopher Lynch
,
Wayne Snyder
Information and Computation
121
(2), 1995, pp. 172-192
A proof of strong normalization for
F_2
,
F_{\omega}
, and beyond
D. McAllester
,
J. Kuc̑an
,
D.F. Otth
Information and Computation
121
(2), 1995, pp. 193-200
Finite identification of functions by teams with success ratio
\frac{1}{2}
and above
Sanjay Jain
,
Arun Sharma
,
Mahendran Velauthapillai
Information and Computation
121
(2), 1995, pp. 201-213
Forward and backward simulations. I. Untimed systems
Nancy Lynch
,
Frits Vaandrager
Information and Computation
121
(2), 1995, pp. 214-233
Axiomatizing probabilistic processes: ACP with generative probabilities
J.C.M. Baeten
,
J.A. Bergstra
,
S.A. Smolka
Information and Computation
121
(2), 1995, pp. 234-255
Boosting a weak learning algorithm by majority
Yoav Freund
Information and Computation
121
(2), 1995, pp. 256-285