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=1995
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Observable behaviors and equivalences of logic programs
Maurizio Gabbrielli
,
Giorgio Levi
,
Maria Chiara Meo
Information and Computation
122
(1), 1995, pp. 1-29
Decidability of systems of set constraints with negative constraints
Alexander Aiken
,
Dexter Kozen
,
Ed Wimmers
Information and Computation
122
(1), 1995, pp. 30-44
Recurrence domains: Their unification and application to logic programming
Hong Chen
,
Jieh Hsiang
Information and Computation
122
(1), 1995, pp. 45-69
Principal types and unification for simple intersection type systems
Mario Coppo
,
Paola Giannini
Information and Computation
122
(1), 1995, pp. 70-96
A causal operational semantics of action refinement
Pierpaolo Degano
,
Roberto Gorrieri
Information and Computation
122
(1), 1995, pp. 97-119
On some decision problems in programming
Dieter Spreen
Information and Computation
122
(1), 1995, pp. 120-139
String matching under a general matching relation
S. Muthukrishnan
,
H. Ramesh
Information and Computation
122
(1), 1995, pp. 140-148
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
A normal form problem for unlabeled boundary NLC graph languages
Koichi Yamazaki
Information and Computation
120
(1), 1995, pp. 1-10
A parametrization scheme for classifying models of PAC learnability
Shai Ben-David
,
Gyora M. Benedek
,
Yishay Mansour
Information and Computation
120
(1), 1995, pp. 11-21
Vector analysis of threshold functions
Vwani Roychowdhury
,
Kai-Yeung Siu
,
Alon Orlitsky
,
Thomas Kailath
Information and Computation
120
(1), 1995, pp. 22-31
Dynamical systems, measures, and fractals via domain theory
Abbas Edalat
Information and Computation
120
(1), 1995, pp. 32-48
The global power of additional queries to random oracles
Ronald V. Book
,
Jack H. Lutz
,
David M., Jr. Martin
Information and Computation
120
(1), 1995, pp. 49-54
Equivalence of
NC^k
and
AC^{k-1}
closures of
NP
and other classes
Mitsunori Ogihara
Information and Computation
120
(1), 1995, pp. 55-58
Recursion theoretic properties of frequency computation and bounded queries
Martin Kummer
,
Frank Stephan
Information and Computation
120
(1), 1995, pp. 59-77
On monadic
NP
vs monadic
coNP
Ronald Fagin
,
Larry J. Stockmeyer
,
Moshe Y. Vardi
Information and Computation
120
(1), 1995, pp. 78-92
Optimal amortized distributed consensus
Amotz Bar-Noy
,
Xiaotie Deng
,
Juan A. Garay
,
Tiko Kameda
Information and Computation
120
(1), 1995, pp. 93-100
Seiten 1
2
3
4
>