default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 129
Volume 129, Number 1, 20 June 1994
- Uri Abraham, Menachem Magidor:
On the Mutual-Exclusion Problem - A Quest for Minimal Solutions. 1-38 - Hirofumi Yokouchi:
F-Semantics for Type Assignment Systems. 39-77 - Jean-Louis Krivine:
A General Storage Theorem for Integers in Call-by-Name lambda-Calculus. 79-94 - Cheng-Chia Chen, I-Peng Lin:
The Computational Complexity of the Satisfiability of Modal Horn Clauses for Modal Propositional Logics. 95-121 - Jiawang Wei:
Correctness of Fixpoint Transformations. 123-142 - John C. Shepherdson:
The Role of Standardising Apart in Logic Programming. 143-142 - Zoran Ognjanovic:
A Tableau-Like Proof Procedure for Normal Modal Logics. 167-186 - Richard Banach:
Regular Relations and Bicartesian Squares. 187-192 - Wenhui Zhang:
Depth of Proofs, Depth of Cut-Formulas and Complexity of Cut Formulas. 193-206
Volume 129, Number 2, 4 July 1994
- André H. Deutz, Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Clans and Regions in 2-Structures. 207-262 - Jean-Paul Allouche
, Mireille Bousquet-Mélou:
Canonical Positions for the Factors in Paperfolding Sequences. 263-278 - Bernard Delyon, Oded Maler:
On the Effects of Noise and Speed on Computations. 279-291 - Joseph F. JáJá, Kwan Woo Ryu:
An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem. 293-307 - K. Ganesan:
One-Way Functions and the Isomorphism Conjecture. 309-321 - Craig A. Rich, Giora Slutzki:
The Complexity of Optimizing Finite-State Transducers. 323-336 - Timo Knuutila, Magnus Steinby:
The Inference of Tree Languages from Finite Samples: An Algebraic Approach. 337-367 - Sébastien Ferenczi:
Tiling and Local Rank Properties of the Morse Sequence. 369-383 - Marion Scheepers:
Variations on a Game of Gale (II): Markov Strategies. 385-396 - Daniel M. Yellin:
An Algorithm for Dynamic Subset and Intersection Testing. 397-406 - Ömer Egecioglu, Çetin Kaya Koç:
Exponentiation Using Canonical Recoding. 407-417 - Maurice Margenstern:
Nonerasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality. 419-424
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-04 22: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:
