default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 56 matches
- 2024
- Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale:
On Basic Feasible Functionals and the Interpretation Method. FoSSaCS (2) 2024: 70-91 - Victor Sannier, Patrick Baillot:
A Linear Type System for Lp-Metric Sensitivity Analysis. FSCD 2024: 12:1-12:22 - Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale:
On Basic Feasible Functionals and the Interpretation Method. CoRR abs/2401.12385 (2024) - 2023
- june wunder, Arthur Azevedo de Amorim, Patrick Baillot, Marco Gaboardi:
Bunched Fuzz: Sensitivity for Vector Metrics. ESOP 2023: 451-478 - 2022
- Patrick Baillot, Alexis Ghyselen:
Types for Complexity of Parallel Computation in Pi-calculus. ACM Trans. Program. Lang. Syst. 44(3): 15:1-15:50 (2022) - june wunder, Arthur Azevedo de Amorim, Patrick Baillot, Marco Gaboardi:
Bunched Fuzz: Sensitivity for Vector Metrics. CoRR abs/2202.01901 (2022) - 2021
- Patrick Baillot, Alexis Ghyselen, Naoki Kobayashi:
Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes. CONCUR 2021: 34:1-34:22 - Patrick Baillot, Alexis Ghyselen:
Types for Complexity of Parallel Computation in Pi-Calculus. ESOP 2021: 59-86 - Patrick Baillot, Alexis Ghyselen, Naoki Kobayashi:
Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes. CoRR abs/2104.07293 (2021) - 2020
- Patrick Baillot, Alexis Ghyselen:
Combining linear logic and size types for implicit complexity. Theor. Comput. Sci. 813: 70-99 (2020) - 2019
- Patrick Baillot, Gilles Barthe, Ugo Dal Lago:
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. J. Autom. Reason. 63(4): 813-855 (2019) - Patrick Baillot, Alexis Ghyselen:
Types for Parallel Complexity in the Pi-calculus. CoRR abs/1910.02145 (2019) - 2018
- Patrick Baillot, Erika De Benedetti, Simona Ronchi Della Rocca:
Characterizing polynomial and exponential complexity classes in elementary lambda-calculus. Inf. Comput. 261: 55-77 (2018) - Patrick Baillot, Alexis Ghyselen:
Combining Linear Logic and Size Types for Implicit Complexity. CSL 2018: 9:1-9:21 - 2016
- Patrick Baillot, Ugo Dal Lago:
Higher-order interpretations and program complexity. Inf. Comput. 248: 56-81 (2016) - Patrick Baillot, Anupam Das:
Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic. CSL 2016: 40:1-40:18 - 2015
- Patrick Baillot:
On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy. Inf. Comput. 241: 3-31 (2015) - Patrick Baillot, Gilles Barthe, Ugo Dal Lago:
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. LPAR 2015: 203-218 - 2014
- Patrick Baillot, Erika De Benedetti, Simona Ronchi Della Rocca:
Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus. IFIP TCS 2014: 151-163 - 2012
- Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen:
On quasi-interpretations, blind abstractions and implicit complexity. Math. Struct. Comput. Sci. 22(4): 549-580 (2012) - Patrick Baillot, Ugo Dal Lago:
Higher-Order Interpretations and Program Complexity. CSL 2012: 62-76 - 2011
- Patrick Baillot, Paolo Coppola, Ugo Dal Lago:
Light logics and optimal reduction: Completeness and complexity. Inf. Comput. 209(2): 118-142 (2011) - Patrick Baillot:
Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy. APLAS 2011: 337-352 - 2010
- Patrick Baillot, Damiano Mazza:
Linear logic by levels and bounded time complexity. Theor. Comput. Sci. 411(2): 470-503 (2010) - Patrick Baillot, Marco Gaboardi, Virgile Mogbil:
A PolyTime Functional Language from Light Linear Logic. ESOP 2010: 104-124 - Patrick Baillot, Martin Hofmann:
Type inference in intuitionistic linear logic. PPDP 2010: 219-230 - Patrick Baillot:
Proceedings International Workshop on Developments in Implicit Computational complExity, DICE 2010, Paphos, Cyprus, 27-28th March 2010. EPTCS 23, 2010 [contents] - Roberto M. Amadio, Patrick Baillot, Antoine Madet:
An affine-intuitionistic system of types and effects: confluence and termination. CoRR abs/1005.0835 (2010) - 2009
- Patrick Baillot, Kazushige Terui:
Light types for polynomial time computation in lambda calculus. Inf. Comput. 207(1): 41-62 (2009) - Patrick Baillot, Jean-Yves Marion, Simona Ronchi Della Rocca:
Guest editorial: Special issue on implicit computational complexity. ACM Trans. Comput. Log. 10(4): 23:1-23:2 (2009)
skipping 26 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-18 23:44 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint