default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 73
Volume 73, Number 1, 1987
- Pavol Duris, Zvi Galil, Georg Schnitger:
Lower Bounds on Communication Complexity. 1-22 - Demosthenis Teneketzis, Yu-Chi Ho:
The Decentralized Wald Problem. 23-44 - Bernd Becker
, Hans-Georg Osthof:
Layouts with Wires of Balanced Length. 45-59 - Mireille Clerbout, Michel Latteux:
Semi-commutations. 59-74 - Wojciech Rytter:
Parallel Time O(log n) Recognition of Unambiguous Context-free Languages. 75-86
Volume 73, Number 2, 1987
- Giuliano Pacini, Franco Turini:
Semantics of Production Systems. 87-101 - Ming Li, Yaacov Yesha:
Separation and Lower Bounds for ROM and Nondeterministic Models of Parallel Computation. 102-128 - Adam Obtulowicz:
Algebra of Constructions. I. The Word Problem for Partial Algebras. 129-173 - Seymour Ginsburg, Marc Gyssens:
Object Histories Which Avoid Certain Subsequences. 174-206
Volume 73, Number 3, 1987
- Gerardo Costa, Colin Stirling:
Weak and Strong Fairness in CCS. 207-244 - Joost Engelfriet, Heiko Vogler:
Look-Ahead on Pushdowns. 245-279
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 2024-12-13 19:00 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:
