論文

DBLP

1. Michal Konečný, Sewon Park, Holger Thies: Formalizing Hyperspaces for Extracting Efficient Exact Real Computation. Proc. of the 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) (2023), 59:1--59:16.
2. Michal Konečný, Sewon Park, Holger Thies: Extracting efficient exact real number computation from proofs in constructive type theory. accepted for journal publication (to appear), .
3. Michal Konečný, Sewon Park, Holger Thies: Certified Computation of Nondeterministic Limits. NASA Formal Methods Symposium 2022 (2022), pp. 771-789.
4. Svetlana Selivanova, Florian Steinberg, Holger Thies, Martin Ziegler: Exact Real Computation of Solution Operators for Linear Analytic Systems of Partial Differential Equations. Proc. of the 23rd International Workshop on Computer Algebra in Scientific Computing (CASC 2021) (2021), pp. 370-390.
5. Michal Konečný, Sewon Park, Holger Thies: Axiomatic Reals and Certified Efficient Exact Real Computation. Proc. of the 27th International Workshop on Logic, Language, Information, and Computation (Wollic 2021) (2021), pp. 252-268.
6. Florian Steinberg, Laurent Thery, Holger Thies: Computable analysis and notions of continuity in Coq. Logical Methods of Computer Science, Vol. 17(2) (2021), .
7. Michal Konečný, Florian Steinberg, Holger Thies: Computable Analysis for Verified Exact Real Computation. Proc. of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020), December 14-18, 2020. (2020), 50:1-50:18.
8. Michal Konečný, Florian Steinberg, Holger Thies: Continuous and Monotone Machines. Proc. of the 45rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), August 24-28, 2020. (2020), pp. 56:1-56:16.
9. Florian Steinberg, Laurent Thery, Holger Thies: Quantitative Continuity and Computable Analysis in Coq. Proc. of the 10th International Conference on Interactive Theorem Proving (ITP 2019), September 9-12, 2019, Portland, OR, USA (2019), pp. 28:1-28:21.
10. Akitoshi Kawamura, Florian Steinberg, Holger Thies: Second-order linear-time computability with applications to computable analysis. Proc. of the 15th Annual Conference on Theory and Applications of Models of Computation (TAMC 2019), April 13-16, 2019, Kitakyushu, Japan (2019), Chapter 21.
11. Akitoshi Kawamura, Holger Thies, Martin Ziegler: Average-case polynomial-time computability of Hamiltonian dynamics. Proc. of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), August 27-31, 2018, Liverpool, UK. (2018), pp. 30:1-30:17.
12. Akitoshi Kawamura, Florian Steinberg, Holger Thies: Parameterized Complexity for Uniform Operators on Multidimensional Analytic Functions and ODE Solving. Proc. of the 25th International Workshop on Logic, Language, Information, and Computation (WoLLIC 2018), July 24-27, 2018, Bogota, Colombia (2018), pp. 223-236.

予稿

1. Michal Konečný, Florian Steinberg, Holger Thies: Continuous and monotone machines.

学位論文

1. Holger Thies: Uniform computational complexity of ordinary differential equations with applications to dynamical systems and exact real arithmetic. PhD thesis, Graduate School of Arts and Sciences, University of Tokyo (2018)
2. Holger Thies: Case Studies in Exact Real Arithmetic -- Implementations and empirical Evaluation. Master thesis, Department of Mathematics, Darmstadt University of Technology (2015)
3. Holger Thies: Complexity Theory and Practice of Integrating Lipschitz-continuous functions in Exact Real Arithmetic (in German). Bachelor thesis, Department of Mathematics, Darmstadt University of Technology (2011)

職歴

学歴

長期的研究訪問、留学等

その他資格

主な学会発表 (全て)

17th International Conference on Computability, Complexity and Randomness

Talk: Applications of Exact Real Computation in Particle Physics

Fifth Workshop on Digitalization and Computable Models

Talk: Formal verification and program extraction for efficient computations over real numbers and hyperspaces (Invited Talk)

Continuity, Computability, Constructivity - From Logic to Algorithms 2023

Talk: Advances in verified set and function calculi in Coq

Autumn school Proof and Computation

Talk: Complexity Theory in Analysis with Applications to Differential Equations (Invited Talk)

Computability, Continuity, Constructivity - from Logic to Algorithms 2019

Talk: Analytic ordinary differential equations - from computational complexity to efficient and verified algorithms (Invited talk)

Sixteenth International Conference on Computability and Complexity in Analysis

Talk: Formal proofs about metric spaces and continuity in Coq

研究資金