The SCEAS System
Navigation Menu

Conferences in DBLP

Birthday ... (birthday)
1987 (conf/birthday/1987rodding)

  1. Klaus Ambos-Spies
    Minimal Pairs for Polynomial Time Reducibilities. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:1-13 [Conf]
  2. Günter Asser
    Primitive Recursive Word-Functions of one Variable. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:14-19 [Conf]
  3. Andreas Blass, Yuri Gurevich
    Existential Fixed-Point Logic. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:20-36 [Conf]
  4. Egon Börger
    Unsolvable Decision Problems for Prolog Programs. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:37-48 [Conf]
  5. Hans-Jürgen Brämik
    You have not understodd a sentence, unless you can prove it. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:49-58 [Conf]
  6. Anne Brüggemann-Klein, Rolf Klein
    On the Minimality of K, F and D or: Why Löten is Non-Trivial. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:59-66 [Conf]
  7. Hans Georg Carstens
    A 5-Color-Extension-Theorem. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:67-77 [Conf]
  8. Daniel E. Cohen
    Closure Relations, Buchberger's Algorithm, and Polynomials in Infinitely Many Variables. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:78-87 [Conf]
  9. Elmar Cohors-Fresenborg
    The Benefit of Microworlds inLearning Computer Programming. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:88-100 [Conf]
  10. Elias Dahlhaus
    Skolem Normal Forms Concerning the Least Fixpoint. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:101-106 [Conf]
  11. M. Deutsch
    Spectral Representation of Recursively Enumerable and Coenumerable Predicates. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:107-116 [Conf]
  12. Anne Drosdol, Britta Schinzel
    Aggregating Inductive Expertise on Partial Recursive Functions. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:117-130 [Conf]
  13. Heinz-Dieter Ebbinghaus
    Domino Threads and Complexity. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:131-142 [Conf]
  14. Erwin Engeler
    Modelling of Cooperative Processes. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:143-153 [Conf]
  15. Giorgio Germano, Stefano Mazzanti
    A Setting for Generalized Computability. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:154-165 [Conf]
  16. Etienne Grandjean
    First-order Spectra with One Variable. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:166-180 [Conf]
  17. Gisbert Hasenjaeger
    On the Early History of Register Machines. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:181-188 [Conf]
  18. Marek Karpinski, Rutger Verbeek
    Randomness, Provability, and the Seperation of Monte Carlo Time and Space. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:189-207 [Conf]
  19. Hans Kleine Büning, Theodor Lettmann
    Representation Independent Query and Update Operations on Propositional Definite Horn Formulas. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:208-223 [Conf]
  20. H. Kull, Ernst Specker
    Direct Construction of Mutually Orthogonal Latin Square. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:224-236 [Conf]
  21. Martin Kummer
    Negative Results about the Length Problem. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:237-248 [Conf]
  22. Thomas Lickteig, Hugo Volger
    Some Results on the Complexity of Powers. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:249-255 [Conf]
  23. Daniele Mundici
    The Turing Complexity of AF C*-algebras with Lattice-ordered Ko. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:256-264 [Conf]
  24. Klaus Nökel, Robert Rehbold, Michael M. Richter
    Remarks on SASL and the Verification of Functional Programming Languages. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:265-276 [Conf]
  25. Thomas Ottmann, Gerald Thiemt, Christian P. Ullrich
    Numerical Stability of simple Geometric Algorithms in the plane. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:277-293 [Conf]
  26. Lutz Priese
    Communication with Concurrent Systems via I/O-Procedures. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:294-305 [Conf]
  27. Bruno Scarpellini
    A Class of EXP-Time Machines which can be Simulated by Polytape Machines. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:306-319 [Conf]
  28. I. Schwank
    Alpha-Beta-Gamma - Automata Realizing Preferences. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:320-333 [Conf]
  29. Helmut Schwichtenberg
    Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:334-348 [Conf]
  30. Dirk Siefkes
    Grammars for Terms and Automata - On a book by the late J. Richard Büchi. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:349-359 [Conf]
  31. Wilfried Sieg
    Relative Konsistenz. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:360-381 [Conf]
  32. Wolfgang A. Slaby
    Segment Translation Systems. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:382-390 [Conf]
  33. Volker Sperschneider
    First Steps towards a Theory of Complexity over more General Data Structures. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:391-402 [Conf]
  34. Dieter Spreen, Hans Stahl
    On the Power of Single-Valued Nondeterministic Polynomial Time Computations. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:403-414 [Conf]
  35. Wolfgang Thomas
    A Concatenation Game and the Dot-Depth Hierarchy. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:415-426 [Conf]
  36. Klaus W. Wagner
    Do There Exist Languages With an Arbitrarily Small Amount of Context-Sensitivity. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:427-432 [Conf]
  37. Ingo Wegener
    The Complexity of Symmetric Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:433-442 [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