Conferences in DBLP

Theoretical Computer Science (tcs)
1979 (conf/tcs/1979)

1. Luc Boasson
   Context-Free Sets of Infinite Words. [Citation Graph (0, 0)][DBLP]
   Theoretical Computer Science, 1979, pp:1-9 [Conf]
   
2. Hermann A. Maurer
   New Aspects of Homomorphisms. [Citation Graph (0, 0)][DBLP]
   Theoretical Computer Science, 1979, pp:10-24 [Conf]
   
3. Albert R. Meyer, Irene Greif
   Can Partial Correctness Assertions Specify Programming Language Semantics?. [Citation Graph (0, 0)][DBLP]
   Theoretical Computer Science, 1979, pp:25-26 [Conf]
   
4. Robin Milner
   An Algebraic Theory for Synchronization. [Citation Graph (0, 0)][DBLP]
   Theoretical Computer Science, 1979, pp:27-35 [Conf]
   
5. Arnold Schönhage
   Storage Modification Machines. [Citation Graph (0, 0)][DBLP]
   Theoretical Computer Science, 1979, pp:36-37 [Conf]
   
6. Leslie G. Valiant
   Negative Results on Counting. [Citation Graph (0, 0)][DBLP]
   Theoretical Computer Science, 1979, pp:38-46 [Conf]
   
7. Joffroy Beauquier
   Strong Non-Deterministic Context-Free Languages. [Citation Graph (0, 0)][DBLP]
   Theoretical Computer Science, 1979, pp:47-57 [Conf]
   
8. Victor L. Bennison
   Information Content Characterizations of Complexity Theoretic Properties. [Citation Graph (0, 0)][DBLP]
   Theoretical Computer Science, 1979, pp:58-66 [Conf]
   
9. Norbert Blum, Kurt Mehlhorn
   Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen. [Citation Graph (0, 0)][DBLP]
   Theoretical Computer Science, 1979, pp:67-78 [Conf]
   
10. Gérard Boudol
    A new Recursion Induction Principle. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:79-90 [Conf]
    
11. Burchard von Braunmühl, Rutger Verbeek
    Finite-Change Automata. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:91-100 [Conf]
    
12. Peter van Emde Boas, Jan van Leeuwen
    Move Rules and Trade-Offs in the Pebble Game. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:101-112 [Conf]
    
13. Dietmar Friede
    Transition Diagrams and Strict Deterministic Grammars. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:113-123 [Conf]
    
14. Péter Gács
    Exact Expressions for some Randomness Tests. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:124-131 [Conf]
    
15. Harald Ganzinger
    On Storage Optimization for Automatically Generated Compilers. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:132-141 [Conf]
    
16. Irène Guessarian
    On Continuous Completions. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:142-152 [Conf]
    
17. Joos Heintz
    A New Method to Show Lower Bounds for Polynomials which are Hard to Compute. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:153-157 [Conf]
    
18. Matthias Jantzen
    On Zerotesting-Bounded Multicounter Machines. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:158-169 [Conf]
    
19. Akira Kanda, David Park
    When are two Effectively given Domains Identical?. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:170-181 [Conf]
    
20. Michel Latteux
    Sur deux langages linéaires. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:182-189 [Conf]
    
21. Mila E. Majster-Cederbaum, Angelika Reiser
    An Efficient On-Line Position Tree Construction Algorithm. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:190-198 [Conf]
    
22. Kurt Mehlhorn
    Sorting Presorted Files. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:199-212 [Conf]
    
23. Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood
    Node-Visit Optimal 1-2 Brother Trees. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:213-221 [Conf]
    
24. Wolfgang J. Paul, Rüdiger Reischuk
    A Graph Theoretic Approach to Determinism versus Non-Determinism. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:222-232 [Conf]
    
25. Jean-Eric Pin
    Une caractérisation de trois variétés de langages bien connues. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:233-243 [Conf]
    
26. Lutz Priese
    Über eine minimale universelle Turing-Maschine. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:244-259 [Conf]
    
27. Christophe Reutenauer
    Sur les variétés de langages et de monoídes. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:260-265 [Conf]
    
28. Hans-Anton Rollik
    Automaten in planaren Graphen. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:266-275 [Conf]
    
29. Jacques Sakarovitch
    Théorème de transversale rationnelle pour les automates à pile déterministes. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:276-285 [Conf]
    
30. Claus-Peter Schnorr
    On the Additive Complexity of Polynomials and some New Lower Bounds. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:286-297 [Conf]
    
31. Esko Ukkonen
    Remarks on the Nonexistence of some Covering Grammars. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:298-309 [Conf]
    
32. Kai Wöhl
    Zur Komplexität der Presburger Artihmetik und des Äquivalenzproblems einfacher Programme. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:310-318 [Conf]