default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 97
Volume 97, Number 1, 1992
- Jean-Yves Girard, Andre Scedrov
, Philip J. Scott:
Bounded Linear Logic: A Modular Approach to Polynomial-Time Computability. 1-66 - Steven M. German:
Semantics and Reasoning with Free Procedures. 67-81 - Jean Perraud, Olivier F. Roux, Marc Huou:
Operational Semantics of a Kernel of the Language ELECTRE. 83-103 - Angelo Monfroglio:
Integer Programs for Logic Constraint Satisfaction. 105-130 - Philippe Darondeau, Doris Nolte, Lutz Priese, Serge Yoccoz:
Fairness, Distances and Degrees. 131-142 - Stefano Baratella:
A Completeness Result for Allowed Semi-Strict Programs with Respect to Well-Behaved and Allowed Query Clauses. 143-156 - Trudy Weibel:
Extension of Combinatory Logic to a Theory of Combinatory Representation. 157-173 - Kees Doets:
A Slight Strengthening of a Theorem of Blair and Kunen. 175-181
Volume 97, Number 2, 1992
- Mark W. Krentel:
Generalizations of Opt P to the Polynomial Hierarchy. 183-198 - Osamu Watanabe, Shouwen Tang:
On Polynomial-Time Turing and Many-One Completeness in PSPACE. 199-215 - Heekeun Yoo, Kosaburo Hashiguchi:
Extended Regular Expressions of Arbitrary Star Degrees. 217-231 - David E. Muller, Ahmed Saoudi, Paul E. Schupp:
Alternating Automata, the Weak Monadic Theory of Trees and its Complexity. 233-244 - Georg Karner:
Nivat's Theorem for Pushdown Transducers. 245-262 - Richard A. Shore, Theodore A. Slaman:
The p-T Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two-Quantifier Theory. 263-284 - Juraj Hromkovic, Sergej A. Lozkin, Andrej I. Rybko, Alexander A. Sapozhenko, Nadezda A. Skalikova:
Lower Bounds on the Area Complexity of Boolean Circuits. 285-300 - Giovanna Guaiana, Antonio Restivo, Sergio Salemi:
Star-Free Trace Languages. 301-311
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-01-18 01:08 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:
