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=112
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Decidability and expressiveness for first-order logics of probability
MartÃn Abadi
,
Joseph Y. Halpern
Information and Computation
112
(1), 1994, July, pp. 1-36
Sorting shuffled monotone sequences
Christos Levcopoulos
,
Ola Petersson
Information and Computation
112
(1), 1994, July, pp. 37-50
The BNS lower bound for multi-party protocols is nearly optimal
Vince Grolmusz
Information and Computation
112
(1), 1994, July, pp. 51-54
A fully abstract denotational model for higher-order processes
M. Hennessy
Information and Computation
112
(1), 1994, July, pp. 55-95
A guide for new referees in Theoretical Computer Science
Ian Parberry
Information and Computation
112
(1), 1994, July, pp. 96-116
Exponential size lower bounds for some depth three circuits
P.Y. Yan
Information and Computation
112
(1), 1994, July, pp. 117-130
Bounded quantification is undecidable
Benjamin C. Pierce
Information and Computation
112
(1), 1994, July, pp. 131-165
Equational formulae with membership constraints
Hubert Comon
,
Catherine Delor
Information and Computation
112
(2), 1994, August, pp. 167-216
Depth reduction for circuits of unbounded fan-in
Eric Allender
,
Ulrich Hertrampf
Information and Computation
112
(2), 1994, August, pp. 217-238
A graph-theoretic approach to default logic
Yannis Dimopoulos
,
Vangelis Magirou
Information and Computation
112
(2), 1994, August, pp. 239-256
Approximating threshold circuits by rational functions
Ramamohan Paturi
,
Michael E. Saks
Information and Computation
112
(2), 1994, August, pp. 257-272
Temporal proof methodologies for timed transition systems
Thomas A. Henzinger
,
Zohar Manna
,
Amir Pnueli
Information and Computation
112
(2), 1994, August, pp. 273-337