default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID50. Birthday: Dieter Rödding, 1987
- Egon Börger:
Computation Theory and Logic, In Memory of Dieter Rödding. Lecture Notes in Computer Science 270, Springer 1987, ISBN 3-540-18170-9 - Klaus Ambos-Spies:
Minimal Pairs for Polynomial Time Reducibilities. 1-13 - Günter Asser:
Primitive Recursive Word-Functions of one Variable. 14-19 - Andreas Blass, Yuri Gurevich:
Existential Fixed-Point Logic. 20-36 - Egon Börger:
Unsolvable Decision Problems for Prolog Programs. 37-48 - Hans-Jürgen Brämik:
You have not understodd a sentence, unless you can prove it. 49-58 - Anne Brüggemann-Klein, Rolf Klein:
On the Minimality of K, F and D or: Why Löten is Non-Trivial. 59-66 - Hans Georg Carstens:
A 5-Color-Extension-Theorem. 67-77 - Daniel E. Cohen:
Closure Relations, Buchberger's Algorithm, and Polynomials in Infinitely Many Variables. 78-87 - Elmar Cohors-Fresenborg:
The Benefit of Microworlds inLearning Computer Programming. 88-100 - Elias Dahlhaus:
Skolem Normal Forms Concerning the Least Fixpoint. 101-106 - M. Deutsch:
Spectral Representation of Recursively Enumerable and Coenumerable Predicates. 107-116 - Anne Drosdol, Britta Schinzel:
Aggregating Inductive Expertise on Partial Recursive Functions. 117-130 - Heinz-Dieter Ebbinghaus:
Domino Threads and Complexity. 131-142 - Erwin Engeler:
Modelling of Cooperative Processes. 143-153 - Giorgio Germano, Stefano Mazzanti:
A Setting for Generalized Computability. 154-165 - Etienne Grandjean:
First-order Spectra with One Variable. 166-180 - Gisbert Hasenjaeger:
On the Early History of Register Machines. 181-188 - Marek Karpinski, Rutger Verbeek:
Randomness, Provability, and the Seperation of Monte Carlo Time and Space. 189-207 - Hans Kleine Büning, Theodor Lettmann:
Representation Independent Query and Update Operations on Propositional Definite Horn Formulas. 208-223 - H. Kull, Ernst Specker:
Direct Construction of Mutually Orthogonal Latin Square. 224-236 - Martin Kummer:
Negative Results about the Length Problem. 237-248 - Thomas Lickteig, Hugo Volger:
Some Results on the Complexity of Powers. 249-255 - Daniele Mundici:
The Turing Complexity of AF C*-algebras with Lattice-ordered Ko. 256-264 - Klaus Nökel, Robert Rehbold, Michael M. Richter:
Remarks on SASL and the Verification of Functional Programming Languages. 265-276 - Thomas Ottmann, Gerald Thiemt, Christian P. Ullrich:
Numerical Stability of simple Geometric Algorithms in the plane. 277-293 - Lutz Priese:
Communication with Concurrent Systems via I/O-Procedures. 294-305 - Bruno Scarpellini:
A Class of EXP-Time Machines which can be Simulated by Polytape Machines. 306-319 - Inge Schwank:
Alpha-Beta-Gamma - Automata Realizing Preferences. 320-333 - Helmut Schwichtenberg:
Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen. 334-348 - Dirk Siefkes:
Grammars for Terms and Automata - On a book by the late J. Richard Büchi. 349-359 - Wilfried Sieg:
Relative Konsistenz. 360-381 - Wolfgang A. Slaby:
Segment Translation Systems. 382-390 - Volker Sperschneider:
First Steps towards a Theory of Complexity over more General Data Structures. 391-402 - Dieter Spreen, Hans Stahl:
On the Power of Single-Valued Nondeterministic Polynomial Time Computations. 403-414 - Wolfgang Thomas:
A Concatenation Game and the Dot-Depth Hierarchy. 415-426 - Klaus W. Wagner:
Do There Exist Languages With an Arbitrarily Small Amount of Context-Sensitivity. 427-432 - Ingo Wegener:
The Complexity of Symmetric Boolean Functions. 433-442
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-20 19:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
