default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDieter Spreen
Person information
- affiliation: University of Siegen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j32]Nikolay Bazhenov, Takayuki Kihara, Svetlana Selivanova, Dieter Spreen:
On the main scientific achievements of Victor Selivanov. Comput. 12(4): 301-314 (2023)- [j31]Dieter Spreen:
How much partiality is needed for a theory of computability? Comput. 12(4): 371-426 (2023) - [j30]Dieter Spreen, Ulrich Berger:
Computing with Infinite Objects: the Gray Code Case. Log. Methods Comput. Sci. 19(3) (2023) - [i13]Dieter Spreen:
How Much Partiality Is Needed for a Theory of Computability? CoRR abs/2305.06982 (2023) - [i12]Ulrich Berger, Monika Seisenberger, Dieter Spreen, Hideki Tsuiki:
Concurrent Gaussian elimination. CoRR abs/2305.10125 (2023) - 2021
- [j29]Dieter Spreen
:
Computing with continuous objects: a uniform co-inductive approach. Math. Struct. Comput. Sci. 31(2): 144-192 (2021) - [j28]Dieter Spreen:
Generalised information systems capture L-domains. Theor. Comput. Sci. 869: 1-28 (2021) - [i11]Dieter Spreen, Ulrich Berger:
Computing with Infinite Objects: the Gray Code Case. CoRR abs/2105.14261 (2021) - 2020
- [i10]Dieter Spreen:
Computing with Continuous Objects: A Uniform Co-inductive Approach. CoRR abs/2004.05392 (2020)
2010 – 2019
- 2017
- [j27]Dieter Spreen:
CID - Computing with Infinite Data. Bull. EATCS 122 (2017) - [j26]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) - [j25]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): 1285-1286 (2017) - [j24]Dieter Spreen:
Some results related to the continuity problem. Math. Struct. Comput. Sci. 27(8): 1601-1624 (2017) - [i9]Dieter Spreen:
Information Systems with Witnesses: The Function Space Construction. CoRR abs/1702.05079 (2017) - 2016
- [j23]Ulrich Berger, Dieter Spreen:
A coinductive approach to computing with compact sets. J. Log. Anal. 8 (2016) - [i8]Dieter Spreen:
Generalised Information Systems Capture L-Domains. CoRR abs/1610.02260 (2016) - 2015
- [j22]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): 1463-1465 (2015) - [i7]Ulrich Berger, Dieter Spreen:
A Coinductive Approach to Computing with Compact Sets. CoRR abs/1510.08498 (2015) - [i6]Mai Gehrke, Achim Jung, Victor L. Selivanov, Dieter Spreen:
Duality in Computer Science (Dagstuhl Seminar 15441). Dagstuhl Reports 5(10): 66-88 (2015) - 2014
- [p3]Dieter Spreen:
The life and work of Victor L. Selivanov. Logic, Computation, Hierarchies 2014: 1-8 - [p2]Dieter Spreen:
Partial Numberings and Precompleteness. Logic, Computation, Hierarchies 2014: 325-340 - [p1]Dieter Spreen:
An Isomorphism Theorem for Partial Numberings. Logic, Computation, Hierarchies 2014: 341-382 - [e4]Vasco Brattka, Hannes Diener, Dieter Spreen:
Logic, Computation, Hierarchies. Ontos Mathematical Logic 4, De Gruyter 2014, ISBN 978-1-61451-804-4 [contents] - 2013
- [i5]Mai Gehrke, Jean-Eric Pin, Victor L. Selivanov, Dieter Spreen:
Duality in Computer Science (Dagstuhl Seminar 13311). Dagstuhl Reports 3(7): 54-73 (2013) - 2012
- [j21]Ulrich Berger, Vasco Brattka, Andrei S. Morozov, Dieter Spreen:
Foreword. Ann. Pure Appl. Log. 163(8): 973-974 (2012) - 2011
- [i4]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): 14-36 (2011) - 2010
- [j20]Dieter Spreen:
Effectivity and effective continuity of multifunctions. J. Symb. Log. 75(2): 602-640 (2010) - [c10]Dieter Spreen:
Every D02\Delta^0_2-Set Is Natural, Up to Turing Equivalence. CiE 2010: 386-393
2000 – 2009
- 2008
- [j19]Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen:
Foreword. Theor. Comput. Sci. 405(1-2): 1-2 (2008) - [j18]Dieter Spreen, Luoshan Xu, Xuxin Mao:
Information systems revisited - the general continuous case. Theor. Comput. Sci. 405(1-2): 176-187 (2008) - [c9]Dieter Spreen:
On the Continuity of Effective Multifunctions. CCA 2008: 271-286 - 2007
- [e3]Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen:
Computational Structures for Modelling Space, Time and Causality, 20.08. - 25.08.2006. Dagstuhl Seminar Proceedings 06341, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - 2006
- [j17]Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster:
Foreword. Theor. Comput. Sci. 365(3): 169-170 (2006) - [i3]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 - 2005
- [j16]Dieter Spreen:
Strong reducibility of partial numberings. Arch. Math. Log. 44(2): 209-217 (2005) - [j15]Serikzhan A. Badaev, Dieter Spreen:
A note on partial numberings. Math. Log. Q. 51(2): 129-136 (2005) - [j14]Dieter Spreen:
The largest Cartesian closed category of domains, considered constructively. Math. Struct. Comput. Sci. 15(2): 299-321 (2005) - [e2]Ralph Kopperman, Michael B. Smyth, Dieter Spreen, Julian Webster:
Spatial Representation: Discrete vs. Continuous Computational Models. Dagstuhl Seminar Proceedings 04351, IBFI, Schloss Dagstuhl, Germany 2005 [contents] - [i2]Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster:
04351 Summary - Spatial Representation: Discrete vs. Continuous Computational Models. Spatial Representation 2005 - [i1]Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster:
04351 Abstracts Collection - Spatial Representation: Discrete vs. Continuous Computational Models. Spatial Representation 2005 - 2002
- [j13]Dieter Spreen:
Safe Weak Minimization Revisited. SIAM J. Comput. 31(5): 1542-1556 (2002) - 2001
- [j12]Dieter Spreen:
Can Partial Indexings be Totalized? J. Symb. Log. 66(3): 1157-1185 (2001) - [j11]Dieter Spreen:
Representations versus numberings: on the relationship of two computability notions. Theor. Comput. Sci. 262(1): 473-499 (2001) - [j10]Dieter Spreen:
Corrigendum to "On functions preserving levels of approximation: a refined model construction for various lambda calculi". Theor. Comput. Sci. 266(1-2): 997-998 (2001) - 2000
- [j9]Dieter Spreen:
Corrigendum. J. Symb. Log. 65(4): 1917-1918 (2000) - [c8]Dieter Spreen:
A New Model Construction for the Polymorphic Lambda Calculus. LPAR 2000: 275-292 - [e1]Dieter Spreen, Ralf Greb, Holger Schulz, Michel P. Schellekens:
Workshop on Domains IV 1998, Haus Humboldtstein, Remagen-Rolandseck, Germany, October 2-4, 1998. Electronic Notes in Theoretical Computer Science 35, Elsevier 2000 [contents]
1990 – 1999
- 1999
- [j8]Dieter Spreen:
Corrigendum to "On Some Decision Problems in Programming". Inf. Comput. 148(2): 241-244 (1999) - [j7]Dieter Spreen:
On Functions Preserving Levels of Approximation: A Refined Model Construction for Various lambda Calculi. Theor. Comput. Sci. 212(1-2): 261-303 (1999) - 1998
- [j6]Dieter Spreen:
On Effective Topological Spaces. J. Symb. Log. 63(1): 185-221 (1998) - [c7]Dieter Spreen:
Preface. Workshop on Domains 1998: 1 - 1996
- [j5]Dieter Spreen:
Effective Inseparability in a Topological Setting. Ann. Pure Appl. Log. 80(3): 257-275 (1996) - [c6]Dieter Spreen:
Representations versus Numberings: On Two Computability Notions. DMTCS 1996: 387-401 - 1995
- [j4]Dieter Spreen:
On Some Decision Problems in Programming. Inf. Comput. 122(1): 120-139 (1995) - 1992
- [c5]Dieter Spreen:
Effective Operators and Continuity Revisited. LFCS 1992: 459-469 - 1990
- [j3]Dieter Spreen:
Computable One-to-One Enumerations of Effective Domains. Inf. Comput. 84(1): 26-46 (1990)
1980 – 1989
- 1988
- [j2]Dieter Spreen:
On the Equivalence Problem in Automata Theory: A Uniform Approach. J. Inf. Process. Cybern. 24(1/2): 31-50 (1988) - 1987
- [c4]Dieter Spreen, Hans Stahl:
On the Power of Single-Valued Nondeterministic Polynomial Time Computations. Computation Theory and Logic 1987: 403-414 - [c3]Dieter Spreen:
On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations. CSL 1987: 289-303 - [c2]Dieter Spreen:
Computable One-to-one Enumerations of Effective Domains. MFPS 1987: 372-384 - 1983
- [c1]Dieter Spreen:
On r.e. inseparability of CPO index sets. Logic and Machines 1983: 103-117 - 1981
- [j1]Dieter Spreen:
A further anticycling rule in multichain policy iteration for undiscounted Markov renewal programs. Z. Oper. Research 25(7): 225-233 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
