Publication | Date of Publication | Type |
---|
On the main scientific achievements of Victor Selivanov | 2024-01-31 | Paper |
How much partiality is needed for a theory of computability? | 2024-01-31 | Paper |
https://portal.mardi4nfdi.de/entity/Q6135768 | 2023-08-26 | Paper |
Information Systems with Witnesses: The Function Space Construction | 2023-08-04 | Paper |
Concurrent Gaussian Elimination | 2023-08-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q5094901 | 2022-08-05 | Paper |
Computing with continuous objects: a uniform co-inductive approach | 2021-10-11 | Paper |
Bi-topological spaces and the Continuity Problem | 2021-09-02 | Paper |
Generalised information systems capture L-domains | 2021-05-10 | Paper |
Computing with Continuous Objects: A Uniform Co-inductive Approach | 2020-04-11 | Paper |
Some results related to the continuity problem | 2017-11-22 | Paper |
A coinductive approach to computing with compact sets | 2017-04-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4982341 | 2015-04-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4982355 | 2015-04-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4982356 | 2015-04-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4981459 | 2014-06-24 | Paper |
On the Continuity of Effective Multifunctions | 2013-05-03 | Paper |
Every $\Delta^0_2$ -Set Is Natural, Up to Turing Equivalence | 2010-07-29 | Paper |
Effectivity and effective continuity of multifunctions | 2010-06-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q3633259 | 2009-06-18 | Paper |
Information systems revisited -- the general continuous case | 2008-10-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q5457390 | 2008-04-14 | Paper |
The largest Cartesian closed category of domains, considered constructively | 2005-05-06 | Paper |
A note on partial numberings | 2005-04-07 | Paper |
Strong reducibility of partial numberings | 2005-03-02 | Paper |
Can partial indexings be totalized? | 2002-10-02 | Paper |
Safe Weak Minimization Revisited | 2002-09-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q2767025 | 2002-07-22 | Paper |
Corrigendum to ``On functions preserving levels of approximation: A refined model construction for various lambda calculi | 2002-07-14 | Paper |
Representations versus numberings: On the relationship of two computability notions | 2002-03-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q2757845 | 2001-12-04 | Paper |
Corrigendum | 2001-09-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q4528533 | 2001-01-31 | Paper |
On effective topological spaces | 1999-06-27 | Paper |
On functions preserving levels of approximation: A refined model construction for various lambda calculi | 1999-01-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q4217610 | 1998-11-11 | Paper |
Effective inseparability in a topological setting | 1996-10-09 | Paper |
On some decision problems in programming | 1995-10-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q3975033 | 1992-06-26 | Paper |
Computable one-to-one enumerations of effective domains | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3484824 | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3809789 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3826115 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4730783 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3785939 | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4720788 | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3335771 | 1984-01-01 | Paper |
On some properties of the Cesaro limit of a stochastic matrix | 1981-01-01 | Paper |
A further anticycling rule in multichain policy iteration for undiscounted Markov renewal programs | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4749619 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3883937 | 1980-01-01 | Paper |
A New Specification of the Multichain Policy Iteration Algorithm in Undiscounted Markov Renewal Programs | 1980-01-01 | Paper |