default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Seiller
Person information
- affiliation: CNRS, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b1]Thomas Seiller:
Mathematical Informatics: Outline of a mathematical theory of computer science. University Sorbonne Paris Nord, France, 2024- [j11]Thomas Seiller, Luc Pellissier, Ulysse Léchine:
Unifying lower bounds for algebraic machines, semantically. Inf. Comput. 301: 105232 (2024) - [j10]Thomas Seiller:
Zeta Functions and the (Linear) Logic of Markov Processes. Log. Methods Comput. Sci. 20(3) (2024) - [c13]Ulysse Léchine, Thomas Seiller
, Jakob Grue Simonsen:
Agafonov's Theorem for Probabilistic Selectors. MFCS 2024: 67:1-67:15 - 2023
- [c12]Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller:
pymwp: A Static Analyzer Determining Polynomial Growth Bounds. ATVA 2023: 263-275 - [c11]Adrien Ragot, Thomas Seiller, Lorenzo Tortora de Falco:
Linear Realisability Over Nets and Second Order Quantification (short paper). ICTCS 2023: 59-64 - [c10]Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller:
Distributing and Parallelizing Non-canonical Loops. VMCAI 2023: 1-24 - [i30]Valentin Maestracci, Thomas Seiller:
Linear Realisability and Cobordisms. CoRR abs/2310.19339 (2023) - 2022
- [c9]Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller:
mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity. FSCD 2022: 26:1-26:23 - [i29]Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller:
mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity. CoRR abs/2203.03943 (2022) - [i28]Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller:
Realizing Implicit Computational Complexity. CoRR abs/2203.05221 (2022) - [i27]Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller:
A Novel Loop Fission Technique Inspired by Implicit Computational Complexity. CoRR abs/2206.08760 (2022) - [i26]Boris Eng, Thomas Seiller:
Multiplicative linear logic from a resolution-based tile system. CoRR abs/2207.08465 (2022) - 2021
- [c8]Eric Finster, Samuel Mimram, Maxime Lucas, Thomas Seiller:
A Cartesian Bicategory of Polynomial Functors in Homotopy Type Theory. MFPS 2021: 67-83 - [i25]Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller:
An extended and more practical mwp flow analysis. CoRR abs/2107.00086 (2021) - [i24]Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller:
An implementation of flow calculus for complexity analysis (tool paper). CoRR abs/2107.00097 (2021) - 2020
- [i23]Thomas Seiller:
Zeta Functions and the (Linear) Logic of Markov Processes. CoRR abs/2001.11906 (2020) - [i22]Thomas Seiller:
Probabilistic Complexity Classes through Semantics. CoRR abs/2002.00009 (2020) - [i21]Luc Pellissier, Thomas Seiller:
Lower bounds for prams over Z. CoRR abs/2002.10888 (2020) - [i20]Thomas Seiller, Jakob Grue Simonsen:
An Embellished Account of Agafonov's Proof of Agafonov's Theorem. CoRR abs/2007.03249 (2020) - [i19]Boris Eng, Thomas Seiller:
Stellar Resolution: Multiplicatives. CoRR abs/2007.16077 (2020) - [i18]Thomas Seiller, Jakob Grue Simonsen:
Agafonov's Theorem for finite and infinite alphabets and probability distributions different from equidistribution. CoRR abs/2011.08552 (2020)
2010 – 2019
- 2019
- [j9]Thomas Seiller:
Interaction Graphs: Exponentials. Log. Methods Comput. Sci. 15(3) (2019) - [e1]Thomas Seiller, Steffen Jost:
Proceedings Third Joint Workshop on Developments in Implicit Computational complExity and Foundational & Practical Aspects of Resource Analysis, DICE-FOPARA@ETAPS 2019, Prague, Czech Republic, April 6-7, 2019. EPTCS 298, 2019 [contents] - [i17]Lê Thành Dung Nguyên, Paolo Pistone, Thomas Seiller, Lorenzo Tortora de Falco:
Finite semantics of polymorphism, complexity and the power of type fixpoints. CoRR abs/1902.00196 (2019) - 2018
- [j8]Thomas Seiller:
A correspondence between maximal abelian sub-algebras and linear logic fragments. Math. Struct. Comput. Sci. 28(1): 77-139 (2018) - [j7]Thomas Seiller:
Interaction Graphs: Non-Deterministic Automata. ACM Trans. Comput. Log. 19(3): 21:1-21:24 (2018) - [c7]Lê Thành Dung Nguyên, Thomas Seiller:
Coherent Interaction Graphs. Linearity-TLLA@FLoC 2018: 104-117 - [i16]Luc Pellissier, Thomas Seiller:
PRAMs over integers do not compute maxflow efficiently. CoRR abs/1811.06787 (2018) - 2017
- [j6]Thomas Seiller:
Interaction graphs: Graphings. Ann. Pure Appl. Log. 168(2): 278-320 (2017) - [j5]Clovis Eberhart, Tom Hirschowitz, Thomas Seiller:
An intensionally fully-abstract sheaf model for π (expanded version). Log. Methods Comput. Sci. 13(4) (2017) - [c6]Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller:
Loop Quasi-Invariant Chunk Detection. ATVA 2017: 91-108 - [c5]Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller:
Loop Quasi-Invariant Chunk Motion by peeling with statement composition. DICE-FOPARA@ETAPS 2017: 47-59 - [i15]Clovis Eberhart, Tom Hirschowitz, Thomas Seiller:
An intensionally fully-abstract sheaf model for π (expanded version). CoRR abs/1710.06744 (2017) - 2016
- [j4]Thomas Seiller:
Interaction graphs: Additives. Ann. Pure Appl. Log. 167(2): 95-154 (2016) - [j3]Clément Aubert, Thomas Seiller:
Logarithmic space and permutations. Inf. Comput. 248: 2-21 (2016) - [j2]Clément Aubert, Thomas Seiller:
Characterizing co-NL by a group action. Math. Struct. Comput. Sci. 26(4): 606-638 (2016) - [c4]Clément Aubert, Marc Bagnol, Thomas Seiller:
Unary Resolution: Characterizing Ptime. FoSSaCS 2016: 373-389 - [c3]Thomas Seiller:
Interaction Graphs: Full Linear Logic. LICS 2016: 427-436 - [i14]Thomas Seiller:
From Dynamic to Static Semantics, Quantitatively. CoRR abs/1604.05047 (2016) - [i13]Thomas Seiller:
Interaction Graphs: Nondeterministic Automata. CoRR abs/1609.07895 (2016) - 2015
- [c2]Clovis Eberhart, Tom Hirschowitz, Thomas Seiller:
An Intensionally Fully-abstract Sheaf Model for pi. CALCO 2015: 86-100 - [i12]Clément Aubert, Marc Bagnol, Thomas Seiller:
Memoization for Unary Logic Programming: Characterizing PTIME. CoRR abs/1501.05104 (2015) - [i11]Thomas Seiller:
Towards a Complexity-through-Realizability Theory. CoRR abs/1502.01257 (2015) - [i10]Thomas Seiller:
Interaction Graphs: Full Linear Logic. CoRR abs/1504.04152 (2015) - 2014
- [c1]Clément Aubert, Marc Bagnol, Paolo Pistone, Thomas Seiller:
Logic Programming and Logarithmic Space. APLAS 2014: 39-57 - [i9]Thomas Seiller:
Interaction Graphs: Graphings. CoRR abs/1405.6331 (2014) - [i8]Clément Aubert, Marc Bagnol, Paolo Pistone, Thomas Seiller:
Logic Programming and Logarithmic Space. CoRR abs/1406.2110 (2014) - [i7]Thomas Seiller:
A Correspondence between Maximal Abelian Sub-Algebras and Linear Logic Fragments. CoRR abs/1408.2125 (2014) - 2013
- [i6]Thomas Seiller, Clément Aubert:
Logarithmic Space and Permutations. CoRR abs/1301.3189 (2013) - [i5]Clovis Eberhart, Tom Hirschowitz, Thomas Seiller:
Fully-abstract concurrent games for pi. CoRR abs/1310.4306 (2013) - [i4]Thomas Seiller:
Interaction Graphs: Exponentials. CoRR abs/1312.1094 (2013) - 2012
- [j1]Thomas Seiller:
Interaction graphs: Multiplicatives. Ann. Pure Appl. Log. 163(12): 1808-1837 (2012) - [i3]Thomas Seiller:
Interaction Graphs: Additives. CoRR abs/1205.6557 (2012) - [i2]Thomas Seiller:
Interaction Graphs: Multiplicatives. CoRR abs/1205.6558 (2012) - [i1]Clément Aubert, Thomas Seiller:
Characterizing co-NL by a group action. CoRR abs/1209.3422 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
