Dieter Spreen - RankMe

65 papers B 3C 2Misc 1Journal 45Unranked 7

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Domains, Information Frames, Rough Sets: An Equivalence of Categories. CoRR Dieter Spreen
2025	J	`jnl`	Domains, Information Frames, and Their Logic. CoRR Dieter Spreen
2025	J	`jnl`	Domains, information frames, and their logic. Theor. Comput. Sci. Dieter Spreen
2023	J	`jnl`	Computing with Infinite Objects: the Gray Code Case. Log. Methods Comput. Sci. Dieter Spreen, Ulrich Berger
2023	J	`jnl`	Concurrent Gaussian elimination. CoRR Ulrich Berger, Monika Seisenberger, Dieter Spreen, Hideki Tsuiki
2023	J	`jnl`	How Much Partiality Is Needed for a Theory of Computability? CoRR Dieter Spreen
2023	J	`jnl`	How much partiality is needed for a theory of computability? Comput. Dieter Spreen
2023	J	`jnl`	On the main scientific achievements of Victor Selivanov. Comput. Nikolay Bazhenov, Takayuki Kihara, Svetlana Selivanova, Dieter Spreen
2021	J	`jnl`	Computing with Infinite Objects: the Gray Code Case. CoRR Dieter Spreen, Ulrich Berger
2021	J	`jnl`	Computing with continuous objects: a uniform co-inductive approach. Math. Struct. Comput. Sci. Dieter Spreen
2021	J	`jnl`	Generalised information systems capture L-domains. Theor. Comput. Sci. Dieter Spreen
2020	J	`jnl`	Computing with Continuous Objects: A Uniform Co-inductive Approach. CoRR Dieter Spreen
2017	J	`jnl`	CID - Computing with Infinite Data. Bull. EATCS Dieter Spreen
2017	J	`jnl`	Continuity, computability, constructivity: from logic to algorithms 2014 (Preface to the special issue: Continuity, Computability, Constructivity: From Logic to Algorithms 2014). J. Log. Anal. Andrej Bauer, Ulrich Berger, Willem L. Fouché, Dieter Spreen, Hideki Tsuiki, Martin Ziegler
2017	J	`jnl`	Information Systems with Witnesses: The Function Space Construction. CoRR Dieter Spreen
2017	J	`jnl`	Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013. Math. Struct. Comput. Sci. Hajime Ishihara, Margarita V. Korovina, Arno Pauly, Monika Seisenberger, Dieter Spreen
2017	J	`jnl`	Some results related to the continuity problem. Math. Struct. Comput. Sci. Dieter Spreen
2016	J	`jnl`	A coinductive approach to computing with compact sets. J. Log. Anal. Ulrich Berger, Dieter Spreen
2016	J	`jnl`	Generalised Information Systems Capture L-Domains. CoRR Dieter Spreen
2015	J	`jnl`	A Coinductive Approach to Computing with Compact Sets. CoRR Ulrich Berger, Dieter Spreen
2015	J	`jnl`	Duality in Computer Science (Dagstuhl Seminar 15441). Dagstuhl Reports Mai Gehrke, Achim Jung, Victor L. Selivanov, Dieter Spreen
2015	J	`jnl`	Preface to the special issue: Computing with infinite data: topological and logical foundations. Math. Struct. Comput. Sci. Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki
2014	—	`ch.`	An Isomorphism Theorem for Partial Numberings. Logic, Computation, Hierarchies Dieter Spreen
2014	—	`book`	Logic, Computation, Hierarchies Logic, Computation, Hierarchies Vasco Brattka, Hannes Diener, Dieter Spreen
2014	—	`ch.`	Partial Numberings and Precompleteness. Logic, Computation, Hierarchies Dieter Spreen
2014	—	`ch.`	The life and work of Victor L. Selivanov. Logic, Computation, Hierarchies Dieter Spreen
2013	J	`jnl`	Duality in Computer Science (Dagstuhl Seminar 13311). Dagstuhl Reports Mai Gehrke, Jean-Eric Pin, Victor L. Selivanov, Dieter Spreen
2012	J	`jnl`	Foreword. Ann. Pure Appl. Log. Ulrich Berger, Vasco Brattka, Andrei S. Morozov, Dieter Spreen
2011	J	`jnl`	Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411). Dagstuhl Reports Ulrich Berger, Vasco Brattka, Victor L. Selivanov, Dieter Spreen, Hideki Tsuiki
2010	J	`jnl`	Effectivity and effective continuity of multifunctions. J. Symb. Log. Dieter Spreen
2010	C	`conf`	Every D CiE Dieter Spreen
2008	J	`jnl`	Foreword. Theor. Comput. Sci. Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen
2008	J	`jnl`	Information systems revisited - the general continuous case. Theor. Comput. Sci. Dieter Spreen, Luoshan Xu, Xuxin Mao
2008	C	`conf`	On the Continuity of Effective Multifunctions. CCA Dieter Spreen
2007	—	`ed.`	Computational Structures for Modelling Space, Time and Causality, 20.08. - 25.08.2006 Computational Structures for Modelling Space, Time and Causality Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen
2006	—	`conf`	06341 Abstracts Collection -- Computational Structures for Modelling Space, Time and Causality. Computational Structures for Modelling Space, Time and Causality Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen
2006	J	`jnl`	Foreword. Theor. Comput. Sci. Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster
2005	—	`conf`	04351 Abstracts Collection - Spatial Representation: Discrete vs. Continuous Computational Models. Spatial Representation Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster
2005	—	`conf`	04351 Summary - Spatial Representation: Discrete vs. Continuous Computational Models. Spatial Representation Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster
2005	J	`jnl`	A note on partial numberings. Math. Log. Q. Serikzhan A. Badaev, Dieter Spreen
2005	—	`ed.`	Spatial Representation: Discrete vs. Continuous Computational Models Spatial Representation Ralph Kopperman, Michael B. Smyth, Dieter Spreen, Julian Webster
2005	J	`jnl`	Strong reducibility of partial numberings. Arch. Math. Log. Dieter Spreen
2005	J	`jnl`	The largest Cartesian closed category of domains, considered constructively. Math. Struct. Comput. Sci. Dieter Spreen
2002	J	`jnl`	Safe Weak Minimization Revisited. SIAM J. Comput. Dieter Spreen
2001	J	`jnl`	Can Partial Indexings be Totalized? J. Symb. Log. Dieter Spreen
2001	J	`jnl`	Corrigendum to "On functions preserving levels of approximation: a refined model construction for various lambda calculi". Theor. Comput. Sci. Dieter Spreen
2001	J	`jnl`	Representations versus numberings: on the relationship of two computability notions. Theor. Comput. Sci. Dieter Spreen
2000	B	`conf`	A New Model Construction for the Polymorphic Lambda Calculus. LPAR Dieter Spreen
2000	J	`jnl`	Corrigendum. J. Symb. Log. Dieter Spreen
2000	—	`ed.`	Workshop on Domains IV 1998, Haus Humboldtstein, Remagen-Rolandseck, Germany, October 2-4, 1998 Workshop on Domains Dieter Spreen, Ralf Greb, Holger Schulz, Michel P. Schellekens
1999	J	`jnl`	Corrigendum to "On Some Decision Problems in Programming". Inf. Comput. Dieter Spreen
1999	J	`jnl`	On Functions Preserving Levels of Approximation: A Refined Model Construction for Various lambda Calculi. Theor. Comput. Sci. Dieter Spreen
1998	J	`jnl`	On Effective Topological Spaces. J. Symb. Log. Dieter Spreen
1998	—	`conf`	Preface. Workshop on Domains Dieter Spreen
1996	J	`jnl`	Effective Inseparability in a Topological Setting. Ann. Pure Appl. Log. Dieter Spreen
1996	—	`conf`	Representations versus Numberings: On Two Computability Notions. DMTCS Dieter Spreen
1995	J	`jnl`	On Some Decision Problems in Programming Inf. Comput. Dieter Spreen
1992	Misc	`conf`	Effective Operators and Continuity Revisited. LFCS Dieter Spreen
1990	J	`jnl`	Computable One-to-One Enumerations of Effective Domains Inf. Comput. Dieter Spreen
1988	J	`jnl`	On the Equivalence Problem in Automata Theory: A Uniform Approach. J. Inf. Process. Cybern. Dieter Spreen
1987	B	`conf`	Computable One-to-one Enumerations of Effective Domains. MFPS Dieter Spreen
1987	B	`conf`	On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations. CSL Dieter Spreen
1987	—	`conf`	On the Power of Single-Valued Nondeterministic Polynomial Time Computations. Computation Theory and Logic Dieter Spreen, Hans Stahl
1983	—	`conf`	On r.e. inseparability of CPO index sets. Logic and Machines Dieter Spreen
1981	J	`jnl`	A further anticycling rule in multichain policy iteration for undiscounted Markov renewal programs. Z. Oper. Research Dieter Spreen