default search action

combined dblp search
author search
venue search
publication search

ask others

"Implicit Computational Complexity of Subrecursive Definitions and ..."

Patrick Baillot, Gilles Barthe, Ugo Dal Lago (2019)

> Home

Details and statistics

DOI: 10.1007/S10817-019-09530-2

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jar/BaillotBL19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jar/BaillotBL19
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)

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.