default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 36
Volume 36, 1985
- Manfred Broy:
On the Herbrand-Kleene Universe for Nondeterministic Computations. 1-19 - Joost Engelfriet:
Determinacy - (Observation Equivalence = Trace Equivalence). 21-25 - Ryszard Janicki:
Transforming Sequential Systems into Concurrent Systems. 27-58 - Norbert Blum:
An Omega(n-4/3) Lower Bound on the Monotone Network Complexity of the n-th Degree Convolution. 59-69 - Michael L. Tiomkin, Johann A. Makowsky:
Propositional Dynamic Logic with Local Assignments. 71-87 - Yoshihide Igarashi:
A Pumping Lemma for Real-Time Deterministic Context-Free Languages. 89-97 - Clelia de Felice
:
Construction de Codes Factorisants. 99-108 - Sadaki Hirose, Masaaki Yoneda:
On the Chomsky and Stanley's Homomorphic Characterization of Context-Free Languages. 109-112 - Keijo Ruohonen:
On Equality of Multiplicity Sets of Regular Languages. 113-117 - Bruno Scarpellini:
Complex Boolean Networks Obtained by Diagonalization. 119-125 - Glynn Winskel:
On Powerdomains and Modality. 127-137 - Norman E. Fenton, Robin W. Whitty, A. A. Kaposi:
A Generalised Mathematical Theory of Structured Programming. 145-171 - Ivan Hal Sudborough, Emo Welzl:
Complexity and Decidability for Chain Code Picture Languages. 173-202 - Jirí Demel, Marie Demlová, Václav Koubek:
Fast Algorithms Constructing Minimal Subalgebras, Congruences, and Ideals in a Finite Algebra. 203-216 - Michael Kaminski:
A Classification of omega-Regular Languages. 217-229 - Eric Allender, Maria M. Klawe:
Improved Lower Bounds for the Cycle Detection Problem. 231-237 - Ronald Fagin, Maria M. Klawe, Nicholas Pippenger, Larry J. Stockmeyer:
Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions. 239-250 - Luis Fariñas del Cerro, Ewa Orlowska:
DAL - A Logic for Data Analysis. 251-264 - Mark Jerrum:
The Complexity of Finding Minimum-Length Generator Sequences. 265-289 - Hiroshi Matsuno, Katsushi Inoue, Hiroshi Taniguchi, Itsuo Takanami:
Alternating Simple Multihead Finite Automata. 291-308 - Walter Keller-Gehrig:
Fast Algorithms for the Characteristic Polynomial. 309-317 - Krzysztof Diks:
Embeddings of Binary Trees in Lines. 319-331 - Helmut Alt:
Multiplication is the Easiest Nontrivial Arithmetic Function. 333-339 - Wojciech Rytter, Marek Chrobak:
A Characterization of Reversal-Bounded Multipushdown Machine Languages. 341-344 - Graham Farr, Colin McDiarmid:
The Compexity of Counting Homeomorphs. 345-348
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 01:27 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:
