A further anticycling rule in multichain policy iteration for undiscounted Markov renewal programs. - Dieter Spreen (Z. Oper. Research, 1981)

On r.e. inseparability of CPO index sets. - Dieter Spreen (Logic and Machines, 1983)

On the Power of Single-Valued Nondeterministic Polynomial Time Computations. - Dieter Spreen; Hans Stahl (Computation Theory and Logic, 1987)

On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations. - Dieter Spreen (CSL, 1987)

On the Equivalence Problem in Automata Theory: A Uniform Approach. - Dieter Spreen (J. Inf. Process. Cybern., 1988)

Computable One-to-One Enumerations of Effective Domains - Dieter Spreen (Inf. Comput., 1990)

Effective Operators and Continuity Revisited. - Dieter Spreen (LFCS, 1992)

On Some Decision Problems in Programming - Dieter Spreen (Inf. Comput., 1995)

Representations versus Numberings: On Two Computability Notions. - Dieter Spreen (DMTCS, 1996)

Effective Inseparability in a Topological Setting. - Dieter Spreen (Ann. Pure Appl. Log., 1996)

Preface. - Dieter Spreen (Workshop on Domains, 1998)

On Effective Topological Spaces. - Dieter Spreen (J. Symb. Log., 1998)

Corrigendum to "On Some Decision Problems in Programming". - Dieter Spreen (Inf. Comput., 1999)

On Functions Preserving Levels of Approximation: A Refined Model Construction for Various lambda Calculi. - Dieter Spreen (Theor. Comput. Sci., 1999)

A New Model Construction for the Polymorphic Lambda Calculus. - Dieter Spreen (LPAR, 2000)

Corrigendum. - Dieter Spreen (J. Symb. Log., 2000)

Can Partial Indexings be Totalized? - Dieter Spreen (J. Symb. Log., 2001)

Representations versus numberings: on the relationship of two computability notions. - Dieter Spreen (Theor. Comput. Sci., 2001)

Corrigendum to "On functions preserving levels of approximation: a refined model construction for various lambda calculi". - Dieter Spreen (Theor. Comput. Sci., 2001)

Safe Weak Minimization Revisited. - Dieter Spreen (SIAM J. Comput., 2002)

04351 Summary - Spatial Representation: Discrete vs. Continuous Computational Models. - Ralph Kopperman; Prakash Panangaden; Michael B. Smyth; Dieter Spreen; Julian Webster (Spatial Representation, 2005)

04351 Abstracts Collection - Spatial Representation: Discrete vs. Continuous Computational Models. - Ralph Kopperman; Prakash Panangaden; Michael B. Smyth; Dieter Spreen; Julian Webster (Spatial Representation, 2005)

Strong reducibility of partial numberings. - Dieter Spreen (Arch. Math. Log., 2005)

A note on partial numberings. - Serikzhan A. Badaev; Dieter Spreen (Math. Log. Q., 2005)

The largest Cartesian closed category of domains, considered constructively. - Dieter Spreen (Math. Struct. Comput. Sci., 2005)

06341 Abstracts Collection – Computational Structures for Modelling Space, Time and Causality. - Ralph Kopperman; Prakash Panangaden; Michael B. Smyth; Dieter Spreen (Computational Structures for Modelling Space, Time and Causality, 2006)

Foreword. - Ralph Kopperman; Prakash Panangaden; Michael B. Smyth; Dieter Spreen; Julian Webster (Theor. Comput. Sci., 2006)

On the Continuity of Effective Multifunctions. - Dieter Spreen (CCA, 2008)

Foreword. - Ralph Kopperman; Prakash Panangaden; Michael B. Smyth; Dieter Spreen (Theor. Comput. Sci., 2008)

Information systems revisited - the general continuous case. - Dieter Spreen; Luoshan Xu; Xuxin Mao (Theor. Comput. Sci., 2008)

Every D02 Delta^0_2-Set Is Natural, Up to Turing Equivalence. - Dieter Spreen (CiE, 2010)

Effectivity and effective continuity of multifunctions. - Dieter Spreen (J. Symb. Log., 2010)

Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411). - Ulrich Berger 001; Vasco Brattka; Victor L. Selivanov; Dieter Spreen; Hideki Tsuiki (Dagstuhl Reports, 2011)

Foreword. - Ulrich Berger 001; Vasco Brattka; Andrei S. Morozov; Dieter Spreen (Ann. Pure Appl. Log., 2012)

Duality in Computer Science (Dagstuhl Seminar 13311). - Mai Gehrke; Jean-Eric Pin; Victor L. Selivanov; Dieter Spreen (Dagstuhl Reports, 2013)

The life and work of Victor L. Selivanov. - Dieter Spreen (Logic, Computation, Hierarchies, 2014)

Partial Numberings and Precompleteness. - Dieter Spreen (Logic, Computation, Hierarchies, 2014)

An Isomorphism Theorem for Partial Numberings. - Dieter Spreen (Logic, Computation, Hierarchies, 2014)

Duality in Computer Science (Dagstuhl Seminar 15441). - Mai Gehrke; Achim Jung; Victor L. Selivanov; Dieter Spreen (Dagstuhl Reports, 2015)

Preface to the special issue: Computing with infinite data: topological and logical foundations. - Ulrich Berger 001; Vasco Brattka; Victor L. Selivanov; Dieter Spreen; Hideki Tsuiki (Math. Struct. Comput. Sci., 2015)

A coinductive approach to computing with compact sets. - Ulrich Berger 001; Dieter Spreen (J. Log. Anal., 2016)

Information Systems with Witnesses: The Function Space Construction. - Dieter Spreen (CoRR, 2017)

CID - Computing with Infinite Data. - Dieter Spreen (Bull. EATCS, 2017)

Continuity, computability, constructivity: from logic to algorithms 2014 (Preface to the special issue: Continuity, Computability, Constructivity: From Logic to Algorithms 2014). - Andrej Bauer; Ulrich Berger 001; Willem L. Fouché; Dieter Spreen; Hideki Tsuiki; Martin Ziegler 001 (J. Log. Anal., 2017)

Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013. - Hajime Ishihara; Margarita V. Korovina; Arno Pauly; Monika Seisenberger; Dieter Spreen (Math. Struct. Comput. Sci., 2017)

Some results related to the continuity problem. - Dieter Spreen (Math. Struct. Comput. Sci., 2017)

Computing with continuous objects: a uniform co-inductive approach. - Dieter Spreen (Math. Struct. Comput. Sci., 2021)

Generalised information systems capture L-domains. - Dieter Spreen (Theor. Comput. Sci., 2021)

On the main scientific achievements of Victor Selivanov. - Nikolay Bazhenov 001; Takayuki Kihara; Svetlana Selivanova; Dieter Spreen (Comput., 2023)

How much partiality is needed for a theory of computability? - Dieter Spreen (Comput., 2023)

Concurrent Gaussian elimination. - Ulrich Berger 001; Monika Seisenberger; Dieter Spreen; Hideki Tsuiki (CoRR, 2023)

Computing with Infinite Objects: the Gray Code Case. - Dieter Spreen; Ulrich Berger 001 (Log. Methods Comput. Sci., 2023)

Domains, Information Frames, Rough Sets: An Equivalence of Categories. - Dieter Spreen (CoRR, 2025)

Domains, Information Frames, and Their Logic. - Dieter Spreen (CoRR, 2025)