default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Control, Volume 71
Volume 71, Number 1-2, 1986
- Werner Damm, Andreas Goerdt:
An Automata-Theoretical Characterization of the OI-Hierarchy. 1-32 - Hirofumi Yokouchi:
Retraction Map Categories and Their Applications to the Construction of Lambda Calculus Models. 33-86 - Stanislav Zák:
An Exponential Lower Bound for Real-Time Branching Programs. 87-94 - David B. MacQueen, Gordon D. Plotkin, Ravi Sethi:
An Ideal Model for Recursive Polymorphic Types. 95-130 - Marek Karpinski, Rutger Verbeek:
On the Power of Two-Way Random Generators and the Impossibility of Deterministic Poly-Space Simulation. 131-142
Volume 71, Number 3, 1986
- Hans L. Bodlaender
, Jan van Leeuwen:
Simulation of Large Networks on Smaller Networks. 143-180 - Christos H. Papadimitriou, Mihalis Yannakakis:
A Note on Succinct Representations of Graphs. 181-185 - Chilukuri K. Mohan, Mandayam K. Srivas:
Function Definitions in Term Rewriting and Applicative Programming. 186-217 - Karel Culík II, Jozef Gruska, Arto Salomaa:
Systolic Trellis Automata: Stability, Decidability and Complexity. 218-230 - Hans Heller:
On Relativized Exponential and Probabilistic Complexity Classes. 231-243
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-09 23:25 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:
