default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 102
Volume 102, Number 1, 1992
- Klaus Grue:
Map Theory. 1-133 - Steffen van Bakel
:
Complete Restrictions of the Intersection Type Discipline. 135-163 - Raymond R. Devillers:
Maximality Preserving Bisimulation. 165-183 - Javier Esparza, Manuel Silva Suárez:
A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets. 185-205 - Kosta Dosen:
Nonmodal Classical Linear Predicate Logic is a Fragment of Intuitionistic Linear Logic. 207-214
Volume 102, Number 2, 1992
- Danilo Bruschi:
Strong Separations of the Polynomial Hierarchy with Oracles: Constructive Separations by Immune and Simple Sets. 215-252 - Marcin Skubiszewski:
Binary Periodic Synchronizing Sequences. 253-281 - Paul Dagum, Michael Luby:
Approximating the Permanent of Graphs with Large Factors. 283-305 - Roland Mirwald, Claus-Peter Schnorr:
The Multiplicative Complexity of Quadratic Boolean Forms. 307-328 - Liam Halpenny, Christopher J. Smyth:
A Classification of Minimal Standard-Path 2x2 Switching Networks. 329-354 - Lakshman Prasad, S. Sitharama Iyengar:
An Asymptotic Equality for the Number of Necklaces in a Shuffle-Exchange Network. 355-365
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-19 22:14 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:
