Dieter Spreen

From MaRDI portal
Person:582907

Available identifiers

zbMath Open spreen.dieterMaRDI QIDQ582907

List of research outcomes





PublicationDate of PublicationType
On the main scientific achievements of Victor Selivanov2024-01-31Paper
How much partiality is needed for a theory of computability?2024-01-31Paper
https://portal.mardi4nfdi.de/entity/Q61357682023-08-26Paper
Information Systems with Witnesses: The Function Space Construction2023-08-04Paper
Concurrent Gaussian Elimination2023-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50949012022-08-05Paper
Computing with continuous objects: a uniform co-inductive approach2021-10-11Paper
Bi-topological spaces and the Continuity Problem2021-09-02Paper
Generalised information systems capture L-domains2021-05-10Paper
Computing with Continuous Objects: A Uniform Co-inductive Approach2020-04-11Paper
Some results related to the continuity problem2017-11-22Paper
A coinductive approach to computing with compact sets2017-04-10Paper
Partial numberings and precompleteness2015-04-09Paper
https://portal.mardi4nfdi.de/entity/Q49823562015-04-09Paper
https://portal.mardi4nfdi.de/entity/Q49823412015-04-09Paper
Representing L-domains as information systems2014-06-24Paper
On the continuity of effective multifunctions2013-05-03Paper
Every \({\Delta}^0_2\)-set is natural, up to Turing equivalence2010-07-29Paper
Effectivity and effective continuity of multifunctions2010-06-24Paper
https://portal.mardi4nfdi.de/entity/Q36332592009-06-18Paper
Information systems revisited -- the general continuous case2008-10-21Paper
https://portal.mardi4nfdi.de/entity/Q54573902008-04-14Paper
The largest Cartesian closed category of domains, considered constructively2005-05-06Paper
A note on partial numberings2005-04-07Paper
Strong reducibility of partial numberings2005-03-02Paper
Can partial indexings be totalized?2002-10-02Paper
Safe Weak Minimization Revisited2002-09-29Paper
https://portal.mardi4nfdi.de/entity/Q27670252002-07-22Paper
Corrigendum to ``On functions preserving levels of approximation: A refined model construction for various lambda calculi2002-07-14Paper
Representations versus numberings: On the relationship of two computability notions2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27578452001-12-04Paper
Corrigendum to: ``On effective topological spaces2001-09-03Paper
https://portal.mardi4nfdi.de/entity/Q45285332001-01-31Paper
On effective topological spaces1999-06-27Paper
On functions preserving levels of approximation: A refined model construction for various lambda calculi1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42176101998-11-11Paper
Effective inseparability in a topological setting1996-10-09Paper
On some decision problems in programming1995-10-30Paper
https://portal.mardi4nfdi.de/entity/Q39750331992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q34848241990-01-01Paper
Computable one-to-one enumerations of effective domains1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38097891988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47307831988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38261151988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859391987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47207881986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33357711984-01-01Paper
On some properties of the Cesaro limit of a stochastic matrix1981-01-01Paper
A further anticycling rule in multichain policy iteration for undiscounted Markov renewal programs1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47496191981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38839371980-01-01Paper
A New Specification of the Multichain Policy Iteration Algorithm in Undiscounted Markov Renewal Programs1980-01-01Paper

Research outcomes over time

This page was built for person: Dieter Spreen