default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 115
Volume 115, Number 1, 1994
- Moshe Y. Vardi, Pierre Wolper
:
Reasoning About Infinite Computations. 1-37 - Andrew K. Wright, Matthias Felleisen:
A Syntactic Approach to Type Soundness. 38-94 - Alan David Fekete:
Asynchronous Approximate Agreement. 95-124 - Eiichi Horita, J. W. de Bakker, Jan J. M. M. Rutten:
Fully Abstract Denotational Models for Nonuniform Concurrent Languages. 125-178
Volume 115, Number 2, 1994
- Luca Aceto, Matthew Hennessy:
Adding Action Refinement to a Finite Process Algebra. 179-247 - David Haussler, Nick Littlestone, Manfred K. Warmuth:
Predicting \0,1\-Functions on Randomly Drawn Points. 248-292 - Alain J. Mayer, Larry J. Stockmeyer:
The Complexity of Word Problems - This Time with Interleaving. 293-311 - Eli Upfal:
Tolerating a Linear Number of Faults in Networks of Bounded Degree. 312-320 - Phokion G. Kolaitis, Madhukar N. Thakur:
Logical Definability of NP Optimization Problems. 321-353 - Jan Friso Groote, Hans Hüttel:
Undecidable Equivalences for Basic Process Algebra. 354-371
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-20 23:48 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:
