default search action
Information and Control, Volume 56
Volume 56, Number 1-2, 1983
- Gary L. Miller:
Isomorphism of k-Contractible Graphs. A Generalization of Bounded Valence and Bounded Genus. 1-20 - Gary L. Miller:
Isomorphism of Graphs Which are Pairwise k-separable. 21-33 - Burchard von Braunmühl, Stephen A. Cook, Kurt Mehlhorn, Rutger Verbeek:
The Recognition of Deterministic CFL's in Small Time and Space. 34-51 - Martin D. Davis, Elaine J. Weyuker:
A Formal Notion of Program-Based Test Data Adequacy. 52-71 - Pierre Wolper
:
Temporal Logic Can Be More Expressive. 72-99 - John Case:
Pseudo-Extending Computable Functions. 100-111 - Albert R. Meyer
Termination Assertions for Recursive Programs: Completeness and Axiomatic Definability. 112-138
Volume 56, Number 3, 1983
- Karel Culík II, Arto Salomaa:
Ambiguity and Decision Problems Concerning Number Systems. 139-153 - John C. Mitchell:
The Implication Problem for Functional and Inclusion Dependencies. 154-173 - Uzi Vishkin, Avi Wigderson:
Dynamic Parallel Memories. 174-182 - Hana Galperin, Avi Wigderson:
Succinct Representations of Graphs. 183-198 - Hans S. Witsenhausen, Aaron D. Wyner:
On Storage Meda with Aftereffects. 199-211 - Pawel Urzyczyn:
A Necessary and Sufficient Condition in Order That a Herbrand Interpretation Be Expressive Relative to Recursive Programs. 212-219
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-23 19:19 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: