TP
Thomas Powell
math.LOcs.LOmath.OCmath.PRmath.FAcs.LGcs.DSAsymptotic regularitycs.DMcs.GT
On Valency
published · living versionsW_r5zfuxbs·v1 · currentpublished
Quantitative sub-ballisticity of self-avoiding walk on
with Ekin Arikök, Christoforos Panagiotis, Nicholas Pischke
1 version
Preprints & journals
26 papers in the corpus · 2012–2026Convergence guarantees for stochastic algorithms solving non-unique problems in metric spaces2605.06129v2 · Nicholas Pischke, Thomas Powell2026 · 0 citationsarXiv
Generalized fluctuation bounds for stochastic algorithms in the presence of compactness2602.22741v2 · Morenikeji Neri, Nicholas Pischke, Thomas Powell2026 · 0 citationsarXiv
Asymptotic Regularity of a Generalised Stochastic Halpern Scheme.42317603 · Pischke, Nicholas, Powell, Thomas2026 · 0 citationsJournal of optimization theory and applications. 2026;210(1):3
An approximate zero-one law via the Dialectica interpretation2508.20849v1 · Thomas Powell, Alex Wan2025 · 0 citationsarXiv
An abstract effective convergence theorem for stochastic processes, with applications to stochastic approximation2504.12922v3 · Morenikeji Neri, Nicholas Pischke, Thomas Powell2025 · 0 citationsarXiv
On the algorithmic structure of Dialectica realisers2501.16208v2 · Davide Barbarossa, Thomas Powell2025 · 0 citationsarXiv
A quantitative Robbins-Siegmund theorem2410.15986v2 · Morenikeji Neri, Thomas Powell2024 · 2 citationsarXiv
On quantitative convergence for stochastic processes: Crossings, fluctuations and martingales2406.19979v2 · Morenikeji Neri, Thomas Powell2024 · 4 citationsarXiv
Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language2301.01690v4 · Thomas Powell2023 · 0 citationsLogical Methods in Computer Science, Volume 20, Issue 1 (January 26, 2024) lmcs:10776
A computational study of a class of recursive inequalities2207.14559v2 · Morenikeji Neri, Thomas Powell2022 · 2 citationsarXiv
Rates of convergence for asymptotically weakly contractive mappings in normed spaces2104.14495v1 · Thomas Powell, Franziskus Wiesnet2021 · 3 citationsarXiv
A note on the finitization of Abelian and Tauberian theorems1910.07926v1 · Thomas Powell2019 · 5 citationsarXiv
Rates of convergence for iterative solutions of equations involving set-valued accretive operators1908.06734v2 · Ulrich Kohlenbach, Thomas Powell2019 · 9 citationsarXiv
A unifying framework for continuity and complexity in higher types1906.10719v4 · Thomas Powell2019 · 3 citationsLogical Methods in Computer Science, Volume 16, Issue 3 (September 9, 2020) lmcs:5746
An algorithmic approach to the existence of ideal objects in commutative algebra1903.03070v1 · Thomas Powell, Peter M Schuster, Franziskus Wiesnet2019 · 8 citationsarXiv
A new metastable convergence criterion and an application in the theory of uniformly convex Banach spaces1902.09284v2 · Thomas Powell2019 · 3 citationsarXiv
Dependent choice as a termination principle1902.09539v1 · Thomas Powell2019 · 0 citationsarXiv
Sequential algorithms and the computational content of classical proofs1812.11003v1 · Thomas Powell2018 · 1 citationarXiv
Computational interpretations of classical reasoning: From the epsilon calculus to stateful programs1812.05851v1 · Thomas Powell2018 · 3 citationsarXiv
A proof theoretic study of abstract termination principles1706.03577v2 · Thomas Powell2017 · 1 citationarXiv
Well quasi-orders and the functional interpretation1706.02881v1 · Thomas Powell2017 · 6 citationsarXiv
Parametrised bar recursion: A unifying framework for realizability interpretations of classical dependent choice1411.0457v2 · Thomas Powell2014 · 2 citationsarXiv
Spector bar recursion over finite partial functions1410.6361v3 · Paulo Oliva, Thomas Powell2014 · 4 citationsarXiv
Applying Gödel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma1210.3117v1 · Thomas Powell2012 · 5 citationsEPTCS 97, 2012, pp. 49-62
A Constructive Interpretation of Ramsey's Theorem via the Product of Selection Functions1204.5631v2 · Paulo Oliva, Thomas Powell2012 · 15 citationsarXiv
A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis1204.5244v1 · Paulo Oliva, Thomas Powell2012 · 9 citationsarXiv
Career total: 41 works. 26 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.