default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 78
Volume 78, Number 1, 1988
- Bruno Courcelle, Pierre Deransart:
Proofs of Partial Correctness for Attribute Grammars with Applications to Recursive Procedures and Logic Programming. 1-55 - Ming Li, Paul M. B. Vitányi:
Tape versus Queue and Stacks: The Lower Bounds. 56-85
Volume 78, Number 2, 1988
- Alan L. Selman:
Promise Problems Complete for Complexity Classes. 87-97 - László Babai
, Bettina Just, Friedhelm Meyer auf der Heide:
On the Limits of Computations with the Floor Function. 99-107 - Kevin J. Compton:
The Computational Complexity of Asymptotic Problems I: Partial Orders. 108-123 - Kosaburo Hashiguchi:
Algorithms for Determining Relative Star Height and Star Height. 124-169
Volume 78, Number 3, 1988
- Toshiya Itoh, Shigeo Tsujii:
A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases. 171-177 - Sophocles Ephremidis, Christos H. Papadimitriou, Martha Sideri:
Complexity Characterizations of Attribute Grammar Languages. 178-186 - Heiko Vogler:
The OI-Hierarchy Is Closed under Control. 187-204 - Jos C. M. Baeten, Jan A. Bergstra:
Global Renaming Operators in Concrete Process Algebra. 205-245 - Susan Landau:
Some Remarks on Computing the Square Parts of Integers. 246-253
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-10-22 02:19 CEST 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:
