default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 112
Volume 112, Number 1, 1994
- Martín Abadi, Joseph Y. Halpern:
Decidability and Expressiveness for First-Order Logics of Probability. 1-36 - Christos Levcopoulos, Ola Petersson:
Sorting Shuffled Monotone Sequences. 37-50 - Vince Grolmusz
:
The BNS Lower Bound for Multi-Party Protocols in Nearly Optimal. 51-54 - Matthew Hennessy:
A Fully Abstract Denotational Model for Higher-Order Processes. 55-95 - Ian Parberry:
A Guide for New Referees in Theoretical Computer Science. 96-116 - Pei Yuan Yan, Ian Parberry:
Exponential Size Lower Bounds for Some Depth Three Circuits. 117-130 - Benjamin C. Pierce:
Bounded Quantification is Undecidable. 131-165
Volume 112, Number 2, 1994
- Hubert Comon, Catherine Delor:
Equational Formulae with Membership Constraints. 167-216 - Eric Allender, Ulrich Hertrampf:
Depth Reduction for Circuits of Unbounded Fan-In. 217-238 - Yannis Dimopoulos, Vangelis Magirou:
A Graph-Theoretic Approach to Default Logic. 239-256 - Ramamohan Paturi, Michael E. Saks:
Approximating Threshold Circuits by Rational Functions. 257-272 - Thomas A. Henzinger, Zohar Manna, Amir Pnueli:
Temporal Proof Methodologies for Timed Transition Systems. 273-337
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
