The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On the Subword Complexity and Square-Freeness of Formal Languages. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:1-4 [Conf]
  2. Werner Kuich
    Cycle-Free N-Algebraic Systems. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:5-12 [Conf]
  3. Franz-Josef Brandenburg
    On the Height of Syntactical Graphs. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:13-21 [Conf]
  4. Ingo Wegener
    Boolean Functions Whose Monotone Complexity is of Size n2/log n. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:22-31 [Conf]
  5. Jürgen Sattler
    Netzwerke zur simultanen Berechnung Boolescher Funktionen. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:32-40 [Conf]
  6. Jürgen Avenhaus, Klaus Madlener
    P-Complete Problems in Free Groups. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:42-51 [Conf]
  7. Michel Latteux
    Quelques propriétés des langages à un Comptuer. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:52-63 [Conf]
  8. Jean-Michel Autebert
    Un resultat de discontinuité dans les familles de langages. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:64-69 [Conf]
  9. Ioannis Keklikoglou
    Verallgemeinerte kommutative Sprachen. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:70-75 [Conf]
  10. Günter Hotz
    Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien Sprachen. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:76-77 [Conf]
  11. Jean-Eric Pin
    Un analogue du théorème des variétés pour les cones et les cylindres. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:78-90 [Conf]
  12. Georg Schnitger
    A Family of Graphs with Expensive Depth-Reduction. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:91-97 [Conf]
  13. Henk J. Olivié
    On alpha-balanced Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:98-108 [Conf]
  14. Reiner Güttler
    Erzeugung optimalen Codes für Series - Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:109-122 [Conf]
  15. John E. Hopcroft
    Recent Directions in Algorithmic Research. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:123-134 [Conf]
  16. Ralf Hartmut Güting, Hans-Peter Kriegel
    Dynamic k-Dimensional Multiway Search under Time-Varying Access Frequencies. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:135-145 [Conf]
  17. Luc Boasson
    Some Applications of CFL's over Infinte Alphabets. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:146-151 [Conf]
  18. Jean-Jacques Pansiot
    A Decidable Property of Iterated Morphisms. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:152-158 [Conf]
  19. Christian Choffrut
    Prefix-Preservation fo Rational Partial Functions Is Decidable. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:159-166 [Conf]
  20. David Park
    Concurrency and Automata on Infinite Sequences. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:167-183 [Conf]
  21. Bernhard Josko
    An Effective Retract Calculus. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:184-194 [Conf]
  22. Klaus Weihrauch
    Recursion and Complexity Theory on CPO-S. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:195-202 [Conf]
  23. Herbert Klaeren, Martin Schulz
    Computable Algebras, Word Problems and Canonical Term Algebras. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:203-213 [Conf]
  24. Horst Müller
    Reachability Analysis with Assertion Systems. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:214-223 [Conf]
  25. Mark H. Overmars, Jan van Leeuwen
    Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:224-233 [Conf]
  26. Scott Huddleston, Kurt Mehlhorn
    Robust Balancing in B-Trees. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:234-244 [Conf]
  27. Luc Boasson, Maurice Nivat
    Centers of Languages. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:245-251 [Conf]
  28. Ronald V. Book, Matthias Jantzen, Celia Wrathall
    (Erasing)* Strings. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:252-259 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002