Dieter Spreen

According to our database1, Dieter Spreen authored at least 48 papers between 1981 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Computing with Continuous Objects: A Uniform Co-inductive Approach.
CoRR, 2020

2017
Some results related to the continuity problem.
Math. Struct. Comput. Sci., 2017

Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013.
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).
J. Log. Anal., 2017

CID - Computing with Infinite Data.
Bull. EATCS, 2017

Information Systems with Witnesses: The Function Space Construction.
CoRR, 2017

2016
A coinductive approach to computing with compact sets.
J. Log. Anal., 2016

Generalised Information Systems Capture L-Domains.
CoRR, 2016

2015
Preface to the special issue: Computing with infinite data: topological and logical foundations.
Math. Struct. Comput. Sci., 2015

Duality in Computer Science (Dagstuhl Seminar 15441).
Dagstuhl Reports, 2015

2014
An Isomorphism Theorem for Partial Numberings.
Proceedings of the Logic, Computation, Hierarchies, 2014

Partial Numberings and Precompleteness.
Proceedings of the Logic, Computation, Hierarchies, 2014

The life and work of Victor L. Selivanov.
Proceedings of the Logic, Computation, Hierarchies, 2014

2013
Duality in Computer Science (Dagstuhl Seminar 13311).
Dagstuhl Reports, 2013

2012
Foreword.
Ann. Pure Appl. Log., 2012

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

2010
Effectivity and effective continuity of multifunctions.
J. Symb. Log., 2010

Every D<sup>0</sup><sub>2</sub>\Delta^0_2-Set Is Natural, Up to Turing Equivalence.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2008
Information systems revisited - the general continuous case.
Theor. Comput. Sci., 2008

Foreword.
Theor. Comput. Sci., 2008

On the Continuity of Effective Multifunctions.
Electron. Notes Theor. Comput. Sci., 2008

2006
Foreword.
Theor. Comput. Sci., 2006

06341 Abstracts Collection -- Computational Structures for Modelling Space, Time and Causality.
Proceedings of the Computational Structures for Modelling Space, Time and Causality, 20.08., 2006

2005
The largest Cartesian closed category of domains, considered constructively.
Math. Struct. Comput. Sci., 2005

A note on partial numberings.
Math. Log. Q., 2005

Strong reducibility of partial numberings.
Arch. Math. Log., 2005

04351 Abstracts Collection - Spatial Representation: Discrete vs. Continuous Computational Models.
Proceedings of the Spatial Representation: Discrete vs. Continuous Computational Models, 2005

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

2002
Safe Weak Minimization Revisited.
SIAM J. Comput., 2002

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

Representations versus numberings: on the relationship of two computability notions.
Theor. Comput. Sci., 2001

Can Partial Indexings be Totalized?
J. Symb. Log., 2001

2000
Corrigendum.
J. Symb. Log., 2000

Preface.
Electron. Notes Theor. Comput. Sci., 2000

A New Model Construction for the Polymorphic Lambda Calculus.
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.
Theor. Comput. Sci., 1999

Corrigendum to "On Some Decision Problems in Programming".
Inf. Comput., 1999

1998
On Effective Topological Spaces.
J. Symb. Log., 1998

1996
Effective Inseparability in a Topological Setting.
Ann. Pure Appl. Log., 1996

Representations versus Numberings: On Two Computability Notions.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995
On Some Decision Problems in Programming
Inf. Comput., October, 1995

1992
Effective Operators and Continuity Revisited.
Proceedings of the Logical Foundations of Computer Science, 1992

1990
Computable One-to-One Enumerations of Effective Domains
Inf. Comput., January, 1990

1988
On the Equivalence Problem in Automata Theory: A Uniform Approach.
J. Inf. Process. Cybern., 1988

1987
On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations.
Proceedings of the CSL '87, 1987

On the Power of Single-Valued Nondeterministic Polynomial Time Computations.
Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1983
On r.e. inseparability of CPO index sets.
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.
Z. Oper. Research, 1981


  Loading...