default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 110
Volume 110, Number 1, 1993
- Joost Engelfriet, Hendrik Jan Hoogeboom:
X-Automata on omega-Words. 1-51 - Eric Goles Ch., Alejandro Maass
, Servet Martínez A.:
On the Limit Set of Some Universal Cellular Automata. 53-78 - Wayne D. Blizard:
Dedekind Multisets and Function Shells. 79-98 - Boaz Patt-Shamir, David Peleg:
Time-Space Tradeoffs for Set Operations. 99-129 - Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
On the Power of Inductive Inference from Good Examples. 131-144 - Annegret Habel, Hans-Jörg Kreowski, Clemens Lautemann:
A Comparison of Compatible, Finite, and Inductive Graph Properties. 145-168 - Uri Zwick, Mike Paterson:
The Memory Game. 169-196 - Aviezri S. Fraenkel, Shai Simonson:
Geography. 197-214 - Hans L. Bodlaender:
Complexity of Path-Forming Games. 215-245
Volume 110, Number 2, 1993
- Jean H. Gallier:
Constructive Logics Part I: A Tutorial on Proof Systems and Typed gamma-Calculi. 249-339 - Bernadette Charron-Bost:
Coupling Coefficients of a Distributed Execution. 341-376 - Michael J. Maher:
A Tranformation System for Deductive Databases Modules with Perfect Model Semantics. 377-403 - Thomas Forster:
A Semantic Characterization of the Well-Typed Formulae of gamma-Calculus. 405-418 - M. Sprenger, M. Wymann-Böni:
How to Decide the Lark. 419-432
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-12-05 22:23 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:
