Journals in DBLP

Theor. Comput. Sci.
1985, volume: 36, number:

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