Conferences in DBLP

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

1. Robert L. Constable
   Partial functions in constructive formal theories. [Citation Graph (0, 0)][DBLP]
   Theoretical Computer Science, 1983, pp:1-18 [Conf]
   
2. Claus-Peter Schnorr
   Monte-Carlo factoring algorithm with finite storage. [Citation Graph (0, 0)][DBLP]
   Theoretical Computer Science, 1983, pp:19-33 [Conf]
   
3. Christos H. Papadimitriou
   Theory of concurrency control. [Citation Graph (0, 0)][DBLP]
   Theoretical Computer Science, 1983, pp:35-47 [Conf]
   
4. Gerhard Barth
   Interprocedural data flow systems. [Citation Graph (0, 0)][DBLP]
   Theoretical Computer Science, 1983, pp:49-59 [Conf]
   
5. Bernd Becker
   On the crossing-free, rectangular embedding of weighted graphs in the plane. [Citation Graph (0, 0)][DBLP]
   Theoretical Computer Science, 1983, pp:61-72 [Conf]
   
6. Eike Best, Agathe Merceron
   Discreteness, k-density and d-continuity of occurrence nets. [Citation Graph (0, 0)][DBLP]
   Theoretical Computer Science, 1983, pp:73-83 [Conf]
   
7. Ronald V. Book, Timothy J. Long, Alan L. Selman
   Controlled relativizations of P and NP. [Citation Graph (0, 0)][DBLP]
   Theoretical Computer Science, 1983, pp:85-90 [Conf]
   
8. Franz-Josef Brandenburg
   The computational complexity of certain graph grammars. [Citation Graph (0, 0)][DBLP]
   Theoretical Computer Science, 1983, pp:91-99 [Conf]
   
9. Andreas Eick, Elfriede Fehr
   Inconsistencies of pure LISP. [Citation Graph (0, 0)][DBLP]
   Theoretical Computer Science, 1983, pp:101-110 [Conf]
   
10. Alain Finkel, Gérard Memmi
    Fifo nets: a new model of parallel computation. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:111-121 [Conf]
    
11. Françoise Gire
    Une extension aux mots infinis de la notion de transduction rationelle. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:123-139 [Conf]
    
12. Martin Gogolla, Klaus Drosten, Udo W. Lipeck, Hans-Dieter Ehrich
    Algebraic and operational semantics of exceptions and errors. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:141-151 [Conf]
    
13. R. Kemp
    The expected number of nodes and leaves at level k in ordered trees. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:153-163 [Conf]
    
14. Christoph Kreitz, Klaus Weihrauch
    Complexity theory on real numbers and functions. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:165-174 [Conf]
    
15. Manfred Kunde
    A multifit algorithm for uniform multiprocessor scheduling. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:175-185 [Conf]
    
16. Karl J. Lieberherr, Stephen A. Vavasis
    Analysis of polynomial approximation algorithms for constraint expressions. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:187-197 [Conf]
    
17. Andrzej Lingas
    Heuristics for minimum edge length rectangular partitions of rectilinear figures. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:199-210 [Conf]
    
18. Johann A. Makowsky, Bernd Mahr
    An axiomatic approach to semantics of specification languages. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:211-219 [Conf]
    
19. Friedhelm Meyer auf der Heide
    Efficiency of universal parallel computers. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:221-241 [Conf]
    
20. Anton Nijholt, Jan Pittl
    A general scheme for some deterministically parsable grammars and their strong equivalents. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:243-255 [Conf]
    
21. Tobias Nipkow, Gerhard Weikum
    A decidability result about sufficient-completeness of axiomatically specified abstract data types. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:257-268 [Conf]
    
22. Christos H. Papadimitriou, Stathis Zachos
    Two remarks on the power of counting. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:269-276 [Conf]
    
23. Jean-Eric Pin, Jacques Sakarovitch
    Some operations and transductions that preserve rationality. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:277-288 [Conf]
    
24. Axel Poigné
    On algebras of computation sequences and proofs of equivalence of operational and denotational semantics. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:289-300 [Conf]
    
25. Patrice Séébold
    Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:301-311 [Conf]
    
26. Géraud Sénizergues
    The equivalence problem for N.T.S. languages is decidable. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:313-323 [Conf]
    
27. Kurt Sieber
    Weakest expressible preconditions: a new tool for proving completeness results about Hoare calculi. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:325-334 [Conf]
    
28. Wolfgang Thomas
    A hierarchy of sets of infinite trees. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:335-342 [Conf]
    
29. Athanasios K. Tsakalidis
    Maintaining order in a generalized linked list. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:343-352 [Conf]
    
30. Harry A. G. Wijshoff, Jan van Leeuwen
    Periodic versus arbitrary tessellations of the plane using polyominos of a single type. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:353-366 [Conf]