Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 21
Volume 21, 1982
- Timothy J. Long:
Strong Nondeterministic Polynomial-Time Reducibilities. 1-25 - Satoru Miyano:
Two-Way Deterministic Multi-Weak-Counter Machines. 27-37 - Pavol Duris, Zvi Galil:
Fooling a two Way Automaton or one Pushdown Store is better than one Counter for two Way Machines. 39-53 - Dirk Janssens, Grzegorz Rozenberg:
Graph Grammars with Neighbourhood-Controlled Embedding. 55-74 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Representation Theorems Using DOS Languages. 75-90 - Robert Cori, Antonio Machi:
Construction of Maps with Prescribed Automorphism Group. 91-98 - Xavier Berenguer, Josep Díaz, Lawrence H. Harper:
A Solution of the Sperner-Erdös Problem. 99-103 - Leslie M. Goldschlager, Ralph A. Shaw, John Staples:
The Maximum Flow Problem is Log Space Complete for P. 105-111 - Andrzej Ehrenfeucht, Juhani Karhumäki, Grzegorz Rozenberg:
The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable. 119-144 - Michael C. Loui:
Simulations Among Multidimensional Turing Machines. 145-161 - Werner Ainhirn:
Marvellous Interpretations Differ Little but Decisively from Ordinary Interpretations of EOL Forms. 163-178 - Bogdan S. Chlebus:
On the Computational Complexity of Satisfiability in Propositional Logics of Programs. 179-212 - Ingo Wegener:
Boolean Functions whose Monotone Complexity is of Size n2/log n. 213-224 - Stuart W. Margolis:
On the Syntactic Transformation Semigroup of a Language Generated by a Finite Biprefix Code. 225-230 - L. Csirmaz:
Determinateness of Program Equivalence over Peano Axioms. 231-235 - Burkhard Monien, Ivan Hal Sudborough:
On Eliminating Nondeterminism from Turing Machines which Use less than Logarithm Worktape Space. 237-253 - Clement F. Kent, Bernard R. Hodgson:
An Arithmetical Characterization of NP. 255-267 - Jan A. Bergstra, John-Jules Ch. Meyer:
On the Elimination of Iteration Quantifiers in a Fragment of Algorithmic Logic. 269-279 - Klaus Indermark:
On Rational Definitions in Complete Algebras without Rank. 281-313 - Józef Winkowski:
An Algebraic Description of System Behaviours. 315-340 - Sorin Istrail:
Some Remarks on Non-Algebraic Adherences. 341-349 - Petr Kurka
:
Ergodic Languages. 351-355 - Tom Head, John Wilkinson:
Finite DOL Languages and Codes. 357-361
a service of 
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-04-18 20:20 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:
