@inproceedings{DBLP:conf/lpar/BaillotBL15,
  author       = {Patrick Baillot and
                  Gilles Barthe and
                  Ugo Dal Lago},
  editor       = {Martin Davis and
                  Ansgar Fehnker and
                  Annabelle McIver and
                  Andrei Voronkov},
  title        = {Implicit Computational Complexity of Subrecursive Definitions and
                  Applications to Cryptographic Proofs},
  booktitle    = {Logic for Programming, Artificial Intelligence, and Reasoning - 20th
                  International Conference, {LPAR-20} 2015, Suva, Fiji, November 24-28,
                  2015, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9450},
  pages        = {203--218},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-48899-7\_15},
  doi          = {10.1007/978-3-662-48899-7\_15},
  timestamp    = {Mon, 03 Jan 2022 22:31:30 +0100},
  biburl       = {https://dblp.org/rec/conf/lpar/BaillotBL15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"m9guyvoPBhWNysJmq","bibbaseid":"baillot-barthe-lago-implicitcomputationalcomplexityofsubrecursivedefinitionsandapplicationstocryptographicproofs-2015","author_short":["Baillot, P.","Barthe, G.","Lago, U. D."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Patrick"],"propositions":[],"lastnames":["Baillot"],"suffixes":[]},{"firstnames":["Gilles"],"propositions":[],"lastnames":["Barthe"],"suffixes":[]},{"firstnames":["Ugo","Dal"],"propositions":[],"lastnames":["Lago"],"suffixes":[]}],"editor":[{"firstnames":["Martin"],"propositions":[],"lastnames":["Davis"],"suffixes":[]},{"firstnames":["Ansgar"],"propositions":[],"lastnames":["Fehnker"],"suffixes":[]},{"firstnames":["Annabelle"],"propositions":[],"lastnames":["McIver"],"suffixes":[]},{"firstnames":["Andrei"],"propositions":[],"lastnames":["Voronkov"],"suffixes":[]}],"title":"Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs","booktitle":"Logic for Programming, Artificial Intelligence, and Reasoning - 20th International Conference, LPAR-20 2015, Suva, Fiji, November 24-28, 2015, Proceedings","series":"Lecture Notes in Computer Science","volume":"9450","pages":"203–218","publisher":"Springer","year":"2015","url":"https://doi.org/10.1007/978-3-662-48899-7\\_15","doi":"10.1007/978-3-662-48899-7_15","timestamp":"Mon, 03 Jan 2022 22:31:30 +0100","biburl":"https://dblp.org/rec/conf/lpar/BaillotBL15.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/lpar/BaillotBL15,\n author = {Patrick Baillot and\n Gilles Barthe and\n Ugo Dal Lago},\n editor = {Martin Davis and\n Ansgar Fehnker and\n Annabelle McIver and\n Andrei Voronkov},\n title = {Implicit Computational Complexity of Subrecursive Definitions and\n Applications to Cryptographic Proofs},\n booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning - 20th\n International Conference, {LPAR-20} 2015, Suva, Fiji, November 24-28,\n 2015, Proceedings},\n series = {Lecture Notes in Computer Science},\n volume = {9450},\n pages = {203--218},\n publisher = {Springer},\n year = {2015},\n url = {https://doi.org/10.1007/978-3-662-48899-7\\_15},\n doi = {10.1007/978-3-662-48899-7\\_15},\n timestamp = {Mon, 03 Jan 2022 22:31:30 +0100},\n biburl = {https://dblp.org/rec/conf/lpar/BaillotBL15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Baillot, P.","Barthe, G.","Lago, U. D."],"editor_short":["Davis, M.","Fehnker, A.","McIver, A.","Voronkov, A."],"key":"DBLP:conf/lpar/BaillotBL15","id":"DBLP:conf/lpar/BaillotBL15","bibbaseid":"baillot-barthe-lago-implicitcomputationalcomplexityofsubrecursivedefinitionsandapplicationstocryptographicproofs-2015","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-662-48899-7\\_15"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/44/3105.bib","dataSources":["YqxpDqzvaehKMgHN9"],"keywords":[],"search_terms":["implicit","computational","complexity","subrecursive","definitions","applications","cryptographic","proofs","baillot","barthe","lago"],"title":"Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs","year":2015}