Thomas Seiller

Available identifiers

zbMath Open seiller.thomasWikidataQ102407820 ScholiaQ102407820MaRDI QIDQ276247

List of research outcomes

Publication	Date of Publication	Type
A Cartesian bicategory of polynomial functors in homotopy type theory	2024-12-17	Paper
Unifying lower bounds for algebraic machines, semantically	2024-12-03	Paper
Zeta functions and the (linear) logic of Markov processes	2024-09-04	Paper
Distributing and parallelizing non-canonical loops	2023-08-17	Paper
Multiplicative linear logic from a resolution-based tile system	2022-07-18	Paper
mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity	2022-03-08	Paper
https://portal.mardi4nfdi.de/entity/Q5018489	2021-12-20	Paper
An extended and more practical mwp flow analysis	2021-06-24	Paper
pymwp: A Tool for Guaranteeing Complexity Bounds for C Programs	2021-06-24	Paper
Verificationism and Classical Realizability	2020-08-06	Paper
Agafonov's Proof of Agafonov's Theorem: A Modern Account and New Insights	2020-07-07	Paper
https://portal.mardi4nfdi.de/entity/Q5232907	2019-09-13	Paper
Interaction Graphs	2018-10-24	Paper
Interaction Graphs	2018-04-23	Paper
A correspondence between maximal abelian sub-algebras and linear logic fragments	2018-01-04	Paper
https://portal.mardi4nfdi.de/entity/Q4596786	2017-12-11	Paper
https://portal.mardi4nfdi.de/entity/Q5275345	2017-07-11	Paper
Interaction graphs: graphings	2016-12-02	Paper
Characterizingco-NLby a group action	2016-07-28	Paper
Unary Resolution: Characterizing Ptime	2016-06-10	Paper
Logarithmic space and permutations	2016-05-03	Paper
From Dynamic to Static Semantics, Quantitatively	2016-04-18	Paper
Logic Programming and Logarithmic Space	2016-02-26	Paper
Interaction graphs: additives	2015-11-18	Paper
Towards a Complexity-through-Realisability Theory	2015-02-04	Paper
Memoization for Unary Logic Programming: Characterizing PTIME	2015-01-21	Paper
Interaction Graphs: Exponentials	2013-12-04	Paper
Interaction graphs: multiplicatives	2012-10-11	Paper

Research outcomes over time

This page was built for person: Thomas Seiller