Ulrich Kohlenbach
Orcid: 0000-0002-4925-3506Affiliations:
- Technische Universität Darmstadt, Germany
According to our database1,
Ulrich Kohlenbach
authored at least 56 papers
between 1992 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
1
3
1
1
2
1
4
3
1
1
2
1
2
2
2
1
2
1
2
2
2
2
3
1
1
1
3
1
3
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on viaf.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on isni.org
-
on andrej.com
On csauthors.net:
Bibliography
2023
J. Optim. Theory Appl., April, 2023
2022
On the proximal point algorithm and its Halpern-type variant for generalized monotone operators in Hilbert space.
Optim. Lett., 2022
Correction to: Quantitative analysis of a subgradient-type method for equilibrium problems.
Numer. Algorithms, 2022
Numer. Algorithms, 2022
2021
Proof-theoretic uniform boundedness and bounded collection principles and countable Heine-Borel compactness.
Arch. Math. Log., 2021
2020
Rates of convergence for iterative solutions of equations involving set-valued accretive operators.
Comput. Math. Appl., 2020
2019
A Polynomial Rate of Asymptotic Regularity for Compositions of Projections in Hilbert Space.
Found. Comput. Math., 2019
On the reverse mathematics and Weihrauch complexity of moduli of regularity and uniqueness.
Comput., 2019
2018
Interrelation between Weak Fragments of double Negation Shift and Related Principles.
J. Symb. Log., 2018
2017
J. Comput. Syst. Sci., 2017
Inf. Comput., 2017
2015
Math. Log. Q., 2015
Log. J. IGPL, 2015
2014
Ann. Pure Appl. Log., 2014
2013
2012
2011
2010
Math. Log. Q., 2010
2009
Notre Dame J. Formal Log., 2009
2008
Springer Monographs in Mathematics, Springer, ISBN: 978-3-540-77532-4, 2008
2007
Proof Interpretations and the Computational Content of Proofs in Mathematics.
Bull. EATCS, 2007
2006
Proceedings of the 13th Workshop on Logic, Language, Information and Computation, 2006
2005
Arch. Math. Log., 2005
Proceedings of the Mathematics, Algorithms, Proofs, 9.-14. January 2005, 2005
Generalized metatheorems on the extractability of uniform bounds in functional analysis.
Proceedings of the Mathematics, Algorithms, Proofs, 9.-14. January 2005, 2005
Proceedings of the New Computational Paradigms, 2005
2004
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004
2003
2002
2001
2000
Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000
1999
1998
On the Arithmetical Content of Restricted Forms of Comprehension, Choice and General Uniform Boundedness.
Ann. Pure Appl. Log., 1998
Arch. Math. Log., 1998
1997
Proceedings of the Third Workshop on Computation and Approximation, 1997
1996
Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals.
Arch. Math. Log., 1996
1995
1993
Effective Moduli from Ineffective Uniqueness Proofs. An Unwinding of de La Vallée Poussin's Proof for Chebycheff Approximation.
Ann. Pure Appl. Log., 1993
1992
Effective Bounds from Ineffective Proofs in Analysis: An Application of Functional Interpretation and Majorization.
J. Symb. Log., 1992