External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs

Patrick Baillot, Gilles Barthe, Ugo Dal Lago. Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. In Martin Davis, Ansgar Fehnker, Annabelle McIver, Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning - 20th International Conference, LPAR-20 2015, Suva, Fiji, November 24-28, 2015, Proceedings. Volume 9450 of Lecture Notes in Computer Science, pages 203-218, Springer, 2015. [doi]

Authors

Patrick Baillot

This author has not been identified. Look up 'Patrick Baillot' in Google

Gilles Barthe

This author has not been identified. Look up 'Gilles Barthe' in Google

Ugo Dal Lago

This author has not been identified. Look up 'Ugo Dal Lago' in Google
runs on