default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 16
Volume 16, 1981
- John C. Shepherdson:
In Memoriam Calvin C. Elgot. 1-4 - Klaus Weihrauch, Ulrich Schreiber:
Embedding Metric Spaces Into CPO's. 5-24 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On the Subword Complexity of Square-Free D0L Languages. 25-32 - Ju. M. Vazenin:
Sur la Liaison Entre Problemes Combinatoires et Algorithmiques. 33-41 - Satoru Takasu, Sukemitsu Kawabata:
A Logical Basis for Programming Methodology. 43-60 - Matthias Jantzen:
On a Special Monoid with a Single Defining Relation. 61-73 - Janos Simon:
On Tape-Bounded Probabilistic Turing Machine Acceptors. 75-91 - Michael G. Main, David B. Benson:
Free Upper Regular Bands. 93-98 - Karl J. Lieberherr:
Uniform Complexity and Digital Signatures. 99-110 - Ren-ji Tao:
On the Computational Power of Automata with Time or Space Bounded by Ackermann's or Superexponential Functions. 115-148 - Jan Pittl:
On LLP(k) Grammars and Languages. 149-175 - Giulia Galbiati:
M. J. Fischer: On the Complexity of 2-Output Boolean Networks. 177-185 - Kari-Jouko Räihä
, Esko Ukkonen:
The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete. 187-198 - László Csirmaz:
Programs and Program Verifications in a General Setting. 199-210 - V. L. Nguyen, Jean-Louis Lassez:
A Dual Problem to Least Fixed Points. 211-221 - Ronald V. Book, Colm Ó'Dúnlaing:
Testing for the Church-Rosser Property. 223-229 - J. Lawrence Carter, Ronald Fagin:
A Note on the Existence of Continuous Functionals. 231-235 - H. C. M. Kleijn, Grzegorz Rozenberg:
Context-Free Like Restrictions on Selective Rewriting. 237-269 - K. Lam, M. K. Siu, Clement T. Yu:
A Generalized Counter Scheme. 271-278 - Walter A. Burkhard, Michael L. Fredman, Daniel J. Kleitman:
Inherent Complexity Trade-Offs for Range Query Problems. 279-290 - Jürgen Albert, Lutz M. Wegner:
Languages with Homomorphic Replacements. 291-305 - Udaiprakash I. Gupta, D. T. Lee, Joseph Y.-T. Leung, J. W. Pruitt, C. K. Wong:
Record Allocation for Minimizing Seek Delay. 307-319 - Francine Berman, Mike Paterson:
Propositional Dynamic Logic is Weaker without Tests. 321-328 - Herbert Edelsbrunner, Hermann A. Maurer:
A Space-Optimal Solution of General Region Location. 329-336 - Jean-Pierre Pécuchet:
Sur la Determination du Rang d'une Equation dans le Monoide Libre. 337-340
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:
