| Publication | Date of Publication | Type |
|---|
| Feasible real random access machines | 2024-06-21 | Paper |
Nearly computable real numbers
Computability | 2024-04-15 | Paper |
Remarks on the effective Jordan decomposition
Theoretical Computer Science | 2023-04-20 | Paper |
EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces
ACM Transactions on Computational Logic | 2022-12-08 | Paper |
Topological properties of the binary supremum function
Semigroup Forum | 2022-07-05 | Paper |
| On the computational complexity of the range computation problem | 2020-12-15 | Paper |
Forests describing Wadge degrees and topological Weihrauch degrees of certain classes of functions and relations
Computability | 2020-11-09 | Paper |
| EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 1: ESPACE-Algorithms | 2019-08-09 | Paper |
| EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness | 2019-08-09 | Paper |
Clarke's generalized gradient and Edalat's L-derivative
Journal of Logic and Analysis | 2017-05-18 | Paper |
Effective subsets under homeomorphisms of \(\mathbb{R}^n\)
Information and Computation | 2015-12-07 | Paper |
| Complexity issues for preorders on finite labeled forests | 2015-04-09 | Paper |
Computing a solution of Feigenbaum's functional equation in polynomial time
Logical Methods in Computer Science | 2015-01-15 | Paper |
A comparison of certain representations of regularly closed sets
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
Complexity issues for preorders on finite labeled forests
Models of Computation in Context | 2011-09-09 | Paper |
| Shifts with decidable language and non-computable entropy | 2010-07-27 | Paper |
| Computability theoretic properties of the entropy of gap shifts | 2008-06-11 | Paper |
| A tutorial on computable analysis | 2008-04-29 | Paper |
| Simply normal numbers to different bases | 2007-10-17 | Paper |
| scientific article; zbMATH DE number 5200717 (Why is no real title available?) | 2007-10-15 | Paper |
A sequentially computable function that is not effectively continuous at any point
Journal of Complexity | 2007-02-08 | Paper |
A Banach-Mazur computable but not Markov computable function on the computable real numbers
Annals of Pure and Applied Logic | 2005-02-23 | Paper |
Is the Mandelbrot set computable?
MLQ | 2005-02-16 | Paper |
| scientific article; zbMATH DE number 2086686 (Why is no real title available?) | 2004-08-11 | Paper |
Random elements in effective topological spaces with measure.
Information and Computation | 2003-08-19 | Paper |
Topological complexity of zero finding with algebraic operations
Journal of Complexity | 2003-05-14 | Paper |
Randomness on full shift spaces
Chaos, Solitons and Fractals | 2003-04-28 | Paper |
Topological properties of real number representations.
Theoretical Computer Science | 2002-07-31 | Paper |
A lower bound for range enclosure in interval arithmetic
Theoretical Computer Science | 2002-07-15 | Paper |
| scientific article; zbMATH DE number 1746034 (Why is no real title available?) | 2002-05-27 | Paper |
A limitation for underestimation via twin arithmetic
Reliable Computing | 2001-12-03 | Paper |
Nonlinear Lebesgue and Itô integration problems of high complexity
Journal of Complexity | 2001-10-14 | Paper |
Recursively enumerable reals and Chaitin \(\Omega\) numbers
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1543075 (Why is no real title available?) | 2001-02-26 | Paper |
| scientific article; zbMATH DE number 1543069 (Why is no real title available?) | 2001-02-26 | Paper |
| scientific article; zbMATH DE number 1543073 (Why is no real title available?) | 2001-02-26 | Paper |
| scientific article; zbMATH DE number 1405572 (Why is no real title available?) | 2000-09-15 | Paper |
scientific article; zbMATH DE number 1453809 (Why is no real title available?)
(available as arXiv preprint) | 2000-05-30 | Paper |
| scientific article; zbMATH DE number 1418486 (Why is no real title available?) | 2000-03-19 | Paper |
Standard representations of real numbers
Chaos, Solitons and Fractals | 1999-11-29 | Paper |
An effective Riemann Mapping Theorem
Theoretical Computer Science | 1999-06-21 | Paper |
Feasible real random access machines
Journal of Complexity | 1999-06-13 | Paper |
A Real Number Structure that is Effectively Categorical
Mathematical Logic Quarterly | 1999-05-24 | Paper |
| scientific article; zbMATH DE number 1222103 (Why is no real title available?) | 1999-03-02 | Paper |
| scientific article; zbMATH DE number 1223737 (Why is no real title available?) | 1999-02-14 | Paper |
| scientific article; zbMATH DE number 1189123 (Why is no real title available?) | 1998-08-13 | Paper |
| scientific article; zbMATH DE number 1183247 (Why is no real title available?) | 1998-08-02 | Paper |
| scientific article; zbMATH DE number 1136091 (Why is no real title available?) | 1998-04-01 | Paper |
| scientific article; zbMATH DE number 1064118 (Why is no real title available?) | 1997-11-20 | Paper |
Topological complexity with continuous operations
Journal of Complexity | 1997-05-25 | Paper |
Small spanning sets of cusp forms
Mathematische Annalen | 1996-03-31 | Paper |
Regainingly approximable numbers and sets
(available as arXiv preprint) | N/A | Paper |
