Dieter Spreen

According to our database, Dieter Spreen authored at least 52 papers between 1981 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Computing with Infinite Objects: the Gray Code Case.

Dieter Spreen, Ulrich Berger

Log. Methods Comput. Sci., 2023

Concurrent Gaussian elimination.

Ulrich Berger, Monika Seisenberger, Dieter Spreen, Hideki Tsuiki

CoRR, 2023

How much partiality is needed for a theory of computability?

Dieter Spreen

Comput., 2023

On the main scientific achievements of Victor Selivanov.

Nikolay Bazhenov, Takayuki Kihara, Svetlana Selivanova, Dieter Spreen

Comput., 2023

2021

Generalised information systems capture L-domains.

Dieter Spreen

Theor. Comput. Sci., 2021

Computing with continuous objects: a uniform co-inductive approach.

Dieter Spreen

Math. Struct. Comput. Sci., 2021

2017

Some results related to the continuity problem.

Dieter Spreen

Math. Struct. Comput. Sci., 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

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, Willem L. Fouché, Dieter Spreen, Hideki Tsuiki, Martin Ziegler

J. Log. Anal., 2017

CID - Computing with Infinite Data.

Dieter Spreen

Bull. EATCS, 2017

Information Systems with Witnesses: The Function Space Construction.

Dieter Spreen

CoRR, 2017

2016

A coinductive approach to computing with compact sets.

Ulrich Berger, Dieter Spreen

J. Log. Anal., 2016

2015

Preface to the special issue: Computing with infinite data: topological and logical foundations.

Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki

Math. Struct. Comput. Sci., 2015

Duality in Computer Science (Dagstuhl Seminar 15441).

Mai Gehrke, Achim Jung, Victor L. Selivanov, Dieter Spreen

Dagstuhl Reports, 2015

2014

An Isomorphism Theorem for Partial Numberings.

Dieter Spreen

Proceedings of the Logic, Computation, Hierarchies, 2014

Partial Numberings and Precompleteness.

Dieter Spreen

Proceedings of the Logic, Computation, Hierarchies, 2014

The life and work of Victor L. Selivanov.

Dieter Spreen

Proceedings of the Logic, Computation, Hierarchies, 2014

2013

Duality in Computer Science (Dagstuhl Seminar 13311).

Mai Gehrke, Jean-Eric Pin, Victor L. Selivanov, Dieter Spreen

Dagstuhl Reports, 2013

2012

Foreword.

Ulrich Berger, Vasco Brattka, Andrei S. Morozov, Dieter Spreen

Ann. Pure Appl. Log., 2012

2011

Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411).

Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki

Dagstuhl Reports, 2011

2010

Effectivity and effective continuity of multifunctions.

Dieter Spreen

J. Symb. Log., 2010

Every D⁰₂\Delta^0_2-Set Is Natural, Up to Turing Equivalence.

Dieter Spreen

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2008

Information systems revisited - the general continuous case.

Dieter Spreen, Luoshan Xu, Xuxin Mao

Theor. Comput. Sci., 2008

Foreword.

Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen

Theor. Comput. Sci., 2008

On the Continuity of Effective Multifunctions.

Dieter Spreen

Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

2006

Foreword.

Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster

Theor. Comput. Sci., 2006

06341 Abstracts Collection -- Computational Structures for Modelling Space, Time and Causality.

Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen

Proceedings of the Computational Structures for Modelling Space, Time and Causality, 20.08., 2006

2005

The largest Cartesian closed category of domains, considered constructively.

Dieter Spreen

Math. Struct. Comput. Sci., 2005

A note on partial numberings.

Serikzhan A. Badaev, Dieter Spreen

Math. Log. Q., 2005

Strong reducibility of partial numberings.

Dieter Spreen

Arch. Math. Log., 2005

04351 Abstracts Collection - Spatial Representation: Discrete vs. Continuous Computational Models.

Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster

Proceedings of the Spatial Representation: Discrete vs. Continuous Computational Models, 2005

04351 Summary - Spatial Representation: Discrete vs. Continuous Computational Models.

Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster

Proceedings of the Spatial Representation: Discrete vs. Continuous Computational Models, 2005

2002

Safe Weak Minimization Revisited.

Dieter Spreen

SIAM J. Comput., 2002

2001

Corrigendum to "On functions preserving levels of approximation: a refined model construction for various lambda calculi".

Dieter Spreen

Theor. Comput. Sci., 2001

Representations versus numberings: on the relationship of two computability notions.

Dieter Spreen

Theor. Comput. Sci., 2001

Can Partial Indexings be Totalized?

Dieter Spreen

J. Symb. Log., 2001

2000

Corrigendum.

Dieter Spreen

J. Symb. Log., 2000

A New Model Construction for the Polymorphic Lambda Calculus.

Dieter Spreen

Proceedings of the Logic for Programming and Automated Reasoning, 2000

1999

On Functions Preserving Levels of Approximation: A Refined Model Construction for Various lambda Calculi.

Dieter Spreen

Theor. Comput. Sci., 1999

Corrigendum to "On Some Decision Problems in Programming".

Dieter Spreen

Inf. Comput., 1999

1998

On Effective Topological Spaces.

Dieter Spreen

J. Symb. Log., 1998

Preface.

Dieter Spreen

Proceedings of the Workshop on Domains IV 1998, 1998

1996

Effective Inseparability in a Topological Setting.

Dieter Spreen

Ann. Pure Appl. Log., 1996

Representations versus Numberings: On Two Computability Notions.

Dieter Spreen

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995

On Some Decision Problems in Programming

Dieter Spreen

Inf. Comput., October, 1995

1992

Effective Operators and Continuity Revisited.

Dieter Spreen

Proceedings of the Logical Foundations of Computer Science, 1992

1990

Computable One-to-One Enumerations of Effective Domains

Dieter Spreen

Inf. Comput., January, 1990

1988

On the Equivalence Problem in Automata Theory: A Uniform Approach.

Dieter Spreen

J. Inf. Process. Cybern., 1988

1987

On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations.

Dieter Spreen

Proceedings of the CSL '87, 1987

On the Power of Single-Valued Nondeterministic Polynomial Time Computations.

Dieter Spreen, Hans Stahl

Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1983

On r.e. inseparability of CPO index sets.

Dieter Spreen

Proceedings of the Logic and Machines: Decision Problems and Complexity, 1983

1981

A further anticycling rule in multichain policy iteration for undiscounted Markov renewal programs.

Dieter Spreen

Z. Oper. Research, 1981