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