The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Dieter Spreen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Dieter Spreen
    On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations. [Citation Graph (0, 0)][DBLP]
    CSL, 1987, pp:289-303 [Conf]
  3. Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster
    04351 Summary - Spatial Representation: Discrete vs. Continuous Computational Models. [Citation Graph (0, 0)][DBLP]
    Spatial Representation, 2005, pp:- [Conf]
  4. Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster
    04351 Abstracts Collection - Spatial Representation: Discrete vs. Continuous Computational Models. [Citation Graph (0, 0)][DBLP]
    Spatial Representation, 2005, pp:- [Conf]
  5. Dieter Spreen
    On r.e. inseparability of CPO index sets. [Citation Graph (0, 0)][DBLP]
    Logic and Machines, 1983, pp:103-117 [Conf]
  6. Dieter Spreen
    Effective Operators and Continuity Revisited. [Citation Graph (0, 0)][DBLP]
    LFCS, 1992, pp:459-469 [Conf]
  7. Dieter Spreen
    A New Model Construction for the Polymorphic Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:275-292 [Conf]
  8. Dieter Spreen
    Computable One-to-one Enumerations of Effective Domains. [Citation Graph (0, 0)][DBLP]
    MFPS, 1987, pp:372-384 [Conf]
  9. Dieter Spreen
    Strong reducibility of partial numberings. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2005, v:44, n:2, pp:209-217 [Journal]
  10. Dieter Spreen
    Effective Inseparability in a Topological Setting. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:80, n:3, pp:257-275 [Journal]
  11. Dieter Spreen
    On the Equivalence Problem in Automata Theory: A Uniform Approach. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1988, v:24, n:1/2, pp:31-50 [Journal]
  12. Dieter Spreen
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
  13. Dieter Spreen
    Computable One-to-One Enumerations of Effective Domains [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:84, n:1, pp:26-46 [Journal]
  14. Dieter Spreen
    On Some Decision Problems in Programming [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:122, n:1, pp:120-139 [Journal]
  15. Dieter Spreen
    Corrigendum to ``On Some Decision Problems in Programming''. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:148, n:2, pp:241-244 [Journal]
  16. Dieter Spreen
    Corrigendum. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:4, pp:1917-1918 [Journal]
  17. Dieter Spreen
    Can Partial Indexings be Totalized? [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:3, pp:1157-1185 [Journal]
  18. Dieter Spreen
    On Effective Topological Spaces. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:1, pp:185-221 [Journal]
  19. Serikzhan Badaev, Dieter Spreen
    A note on partial numberings. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2005, v:51, n:2, pp:129-136 [Journal]
  20. Dieter Spreen
    The largest Cartesian closed category of domains, considered constructively. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2005, v:15, n:2, pp:299-321 [Journal]
  21. Dieter Spreen
    Safe Weak Minimization Revisited. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1542-1556 [Journal]
  22. Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:365, n:3, pp:169-170 [Journal]
  23. Dieter Spreen
    Representations versus numberings: on the relationship of two computability notions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:473-499 [Journal]
  24. Dieter Spreen
    Corrigendum to "On functions preserving levels of approximation: a refined model construction for various lambda calculi". [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:997-998 [Journal]
  25. Dieter Spreen
    On Functions Preserving Levels of Approximation: A Refined Model Construction for Various lambda Calculi. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:212, n:1-2, pp:261-303 [Journal]

  26. Every D02\Delta^0_2-Set Is Natural, Up to Turing Equivalence. [Citation Graph (, )][DBLP]


  27. 06341 Abstracts Collection -- Computational Structures for Modelling Space, Time and Causality. [Citation Graph (, )][DBLP]


  28. On the Continuity of Effective Multifunctions. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.305secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002