Journals in DBLP

Theor. Comput. Sci.
1984, volume: 29, number:

1. Joseph F. Traub, Grzegorz W. Wasilkowski, Henryk Wozniakowski
   Average Case Optimality for Linear Problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:29, n:, pp:1-25 [Journal]
   
2. Ewa Orlowska, Zdzislaw Pawlak
   Representation of Nondeterministic Information. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:29, n:, pp:27-39 [Journal]
   
3. Grzegorz Rozenberg, R. Verraedt
   On Simulation and Propagating E0L Forms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:29, n:, pp:41-48 [Journal]
   
4. Aviezri S. Fraenkel
   Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:29, n:, pp:49-73 [Journal]
   
5. Greg N. Frederickson
   Recursively Rotated Orders and Implicit Data Structures: A Lower Bound. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:29, n:, pp:75-85 [Journal]
   
6. Ryszard Janicki
   Nets, Sequential Components and Concurrency Relations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:29, n:, pp:87-121 [Journal]
   
7. Oscar H. Ibarra, Sam M. Kim
   Characterizations and Computational Complexity of Systolic Trellis Automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:29, n:, pp:123-153 [Journal]
   
8. Tsutomu Kamimura, Adrian Tang
   Effectively Given Spaces. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:29, n:, pp:155-166 [Journal]
   
9. Jean-Louis Lassez, Michael J. Maher
   Closures and Fairness in the Semantics of Programming Logic. [Citation Graph (2, 0)][DBLP]
   Theor. Comput. Sci., 1984, v:29, n:, pp:167-184 [Journal]
   
10. Emanuela Fachini, Margherita Napoli
    Hierarchies of Primitive Recursive Wordsequence Functions: Comparisons and Decision Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:29, n:, pp:185-227 [Journal]
    
11. J. W. de Bakker, John-Jules Ch. Meyer, Jeffery I. Zucker
    On Infinite Computations in Denotational Semantics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:29, n:, pp:229-230 [Journal]
    
12. Tzilla Elrad, Nissim Francez
    A Weakest Precondition Semantics for Communicating Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:29, n:, pp:231-250 [Journal]
    
13. Marisa Venturini Zilli
    Reduction Graphs in the Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:29, n:, pp:251-275 [Journal]
    
14. D. H. Potts
    Remarks on an Example of Jantzen. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:29, n:, pp:277-284 [Journal]
    
15. Juhani Karhumäki
    The Ehrenfeucht Conjecutre: A Compactness Claim for Finitely Generated Free Monoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:29, n:, pp:285-308 [Journal]
    
16. Mario Coppo
    Completeness of Type Assignment in Continuous Lambda Models. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:29, n:, pp:309-324 [Journal]
    
17. Gerald S. Eisman
    On the Ratio of Growth Functions in EDT0L Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:29, n:, pp:325-349 [Journal]