Dieter Spreen

Publication Activity (10 Years)

Years Active: 1981-2023
Publications (10 Years): 16

Top Topics

Information Systems

Logical Foundations

Mutual Exclusion

Top Venues

Math. Struct. Comput. Sci.

Publications

Ulrich Berger, Monika Seisenberger, Dieter Spreen, Hideki Tsuiki
Concurrent Gaussian elimination. CoRR (2023)
Dieter Spreen, Ulrich Berger
Computing with Infinite Objects: the Gray Code Case. Log. Methods Comput. Sci. 19 (3) (2023)
Nikolay Bazhenov, Takayuki Kihara, Svetlana Selivanova, Dieter Spreen
On the main scientific achievements of Victor Selivanov. Comput. 12 (4) (2023)
Dieter Spreen
How much partiality is needed for a theory of computability? Comput. 12 (4) (2023)
Dieter Spreen
How Much Partiality Is Needed for a Theory of Computability? CoRR (2023)
Dieter Spreen, Ulrich Berger
Computing with Infinite Objects: the Gray Code Case. CoRR (2021)
Dieter Spreen
Generalised information systems capture L-domains. Theor. Comput. Sci. 869 (2021)
Dieter Spreen
Computing with continuous objects: a uniform co-inductive approach. Math. Struct. Comput. Sci. 31 (2) (2021)
Dieter Spreen
Computing with Continuous Objects: A Uniform Co-inductive Approach. CoRR (2020)
Dieter Spreen
Some results related to the continuity problem. Math. Struct. Comput. Sci. 27 (8) (2017)
Dieter Spreen
Information Systems with Witnesses: The Function Space Construction. CoRR (2017)
Dieter Spreen
CID - Computing with Infinite Data. Bull. EATCS 122 (2017)
Andrej Bauer, Ulrich Berger, Willem L. Fouché, Dieter Spreen, Hideki Tsuiki, Martin Ziegler
Continuity, computability, constructivity: from logic to algorithms 2014 (Preface to the special issue: Continuity, Computability, Constructivity: From Logic to Algorithms 2014). J. Log. Anal. 9 (2017)
Hajime Ishihara, Margarita V. Korovina, Arno Pauly, Monika Seisenberger, Dieter Spreen
Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013. Math. Struct. Comput. Sci. 27 (8) (2017)
Ulrich Berger, Dieter Spreen
A coinductive approach to computing with compact sets. J. Log. Anal. 8 (2016)
Dieter Spreen
Generalised Information Systems Capture L-Domains. CoRR (2016)
Ulrich Berger, Dieter Spreen
A Coinductive Approach to Computing with Compact Sets. CoRR (2015)
Mai Gehrke, Achim Jung, Victor L. Selivanov, Dieter Spreen
Duality in Computer Science (Dagstuhl Seminar 15441). Dagstuhl Reports 5 (10) (2015)
Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki
Preface to the special issue: Computing with infinite data: topological and logical foundations. Math. Struct. Comput. Sci. 25 (7) (2015)
Mai Gehrke, Jean-Eric Pin, Victor L. Selivanov, Dieter Spreen
Duality in Computer Science (Dagstuhl Seminar 13311). Dagstuhl Reports 3 (7) (2013)
Ulrich Berger, Vasco Brattka, Andrei S. Morozov, Dieter Spreen
Foreword. Ann. Pure Appl. Log. 163 (8) (2012)
Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki
Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411). Dagstuhl Reports 1 (10) (2011)
Dieter Spreen
Effectivity and effective continuity of multifunctions. J. Symb. Log. 75 (2) (2010)
Dieter Spreen
\Delta^0_2-Set Is Natural, Up to Turing Equivalence. CiE (2010)
Dieter Spreen, Luoshan Xu, Xuxin Mao
Information systems revisited - the general continuous case. Theor. Comput. Sci. 405 (1-2) (2008)
Dieter Spreen
On the Continuity of Effective Multifunctions. Electron. Notes Theor. Comput. Sci. 221 (2008)
Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen
Foreword. Theor. Comput. Sci. 405 (1-2) (2008)
Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster
Foreword. Theor. Comput. Sci. 365 (3) (2006)
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)
Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster
04351 Abstracts Collection - Spatial Representation: Discrete vs. Continuous Computational Models. Spatial Representation (2005)
Serikzhan A. Badaev, Dieter Spreen
A note on partial numberings. Math. Log. Q. 51 (2) (2005)
Dieter Spreen
The largest Cartesian closed category of domains, considered constructively. Math. Struct. Comput. Sci. 15 (2) (2005)
Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster
04351 Summary - Spatial Representation: Discrete vs. Continuous Computational Models. Spatial Representation (2005)
Dieter Spreen
Strong reducibility of partial numberings. Arch. Math. Log. 44 (2) (2005)
Dieter Spreen
Safe Weak Minimization Revisited. SIAM J. Comput. 31 (5) (2002)
Dieter Spreen
Can Partial Indexings be Totalized? J. Symb. Log. 66 (3) (2001)
Dieter Spreen
Corrigendum to "On functions preserving levels of approximation: a refined model construction for various lambda calculi". Theor. Comput. Sci. 266 (1-2) (2001)
Dieter Spreen
Representations versus numberings: on the relationship of two computability notions. Theor. Comput. Sci. 262 (1) (2001)
Dieter Spreen
Preface. Electron. Notes Theor. Comput. Sci. 35 (2000)
Dieter Spreen
A New Model Construction for the Polymorphic Lambda Calculus. LPAR (2000)
Dieter Spreen
Corrigendum. J. Symb. Log. 65 (4) (2000)
Dieter Spreen
On Functions Preserving Levels of Approximation: A Refined Model Construction for Various lambda Calculi. Theor. Comput. Sci. 212 (1-2) (1999)
Dieter Spreen
Corrigendum to "On Some Decision Problems in Programming". Inf. Comput. 148 (2) (1999)
Dieter Spreen
On Effective Topological Spaces. J. Symb. Log. 63 (1) (1998)
Dieter Spreen
Effective Inseparability in a Topological Setting. Ann. Pure Appl. Log. 80 (3) (1996)
Dieter Spreen
Representations versus Numberings: On Two Computability Notions. DMTCS (1996)
Dieter Spreen
On Some Decision Problems in Programming Inf. Comput. 122 (1) (1995)
Dieter Spreen
Effective Operators and Continuity Revisited. LFCS (1992)
Dieter Spreen
Computable One-to-One Enumerations of Effective Domains Inf. Comput. 84 (1) (1990)
Dieter Spreen
On the Equivalence Problem in Automata Theory: A Uniform Approach. J. Inf. Process. Cybern. 24 (1/2) (1988)
Dieter Spreen
On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations. CSL (1987)
Dieter Spreen, Hans Stahl
On the Power of Single-Valued Nondeterministic Polynomial Time Computations. Computation Theory and Logic (1987)
Dieter Spreen
Computable One-to-one Enumerations of Effective Domains. MFPS (1987)
Dieter Spreen
On r.e. inseparability of CPO index sets. Logic and Machines (1983)
Dieter Spreen
A further anticycling rule in multichain policy iteration for undiscounted Markov renewal programs. Z. Oper. Research 25 (7) (1981)