@inproceedings(AM05,
 author       = "T. Arai and G. Moser",
 year         = "2005",
 title        = "{Proofs of Termination of Rewrite Systems for Polytime Functions}",
 booktitle    = "Proceedings of the 25th FSTTCS",
 series       = "LNCS",
 volume       = "3821",
 pages        = "529--540",
 doi          = "10.1007/11590156\_43",
)
@inproceedings(ADL15,
 author       = "M. Avanzini and U. {Dal Lago}",
 year         = "2015",
 title        = "{On Sharing, Memoization, and Polynomial Time}",
 booktitle    = "Proceedings of the 32nd STACS",
 pages        = "62--75",
 doi          = "10.4230/LIPIcs.STACS.2015.62",
)
@inproceedings(AEM11,
 author       = "M. Avanzini and N. Eguchi and G. Moser",
 year         = "2011",
 title        = "{A Path Order for Rewrite Systems that Compute Exponential Time Functions}",
 booktitle    = "Proceedings of the 22nd RTA",
 series       = "LIPIcs",
 volume       = "10",
 pages        = "123--138",
 doi          = "10.4230/LIPIcs.RTA.2011.123",
)
@inproceedings(AEM12,
 author       = "M. Avanzini and N. Eguchi and G. Moser",
 year         = "2012",
 title        = "{A New Order-theoretic Characterisation of the Polytime Computable Functions}",
 booktitle    = "Proceedings of the 10th APLAS",
 series       = "LNCS",
 volume       = "7705",
 pages        = "280--295",
 doi          = "10.1007/978-3-642-35182-2\_20",
)
@inproceedings(BareEGKPS87,
 author       = "H. P. Barendregt and M. C. J. D. van Eekelen and J. R. W. Glauert and R. Kennaway and M. J. Plasmeijer and M. R. Sleep",
 year         = "1987",
 title        = "{Term Graph Rewriting}",
 booktitle    = "Parallel Architectures and Languages Europe, Volume II",
 volume       = "259",
 pages        = "141--158",
 doi          = "10.1007/3-540-17945-3\_8",
)
@article(BC92,
 author       = "S. Bellantoni and S. A. Cook",
 year         = "1992",
 title        = "{A New Recursion-theoretic Characterization of the Polytime Functions}",
 journal      = "Computational Complexity",
 volume       = "2",
 number       = "2",
 pages        = "97--110",
 doi          = "10.1007/BF01201998",
)
@article(Bonfante01,
 author       = "G. Bonfante and A. Cichon and J.-Y. Marion and H. Touzet",
 year         = "2001",
 title        = "{Algorithms with Polynomial Interpretation Termination Proof}",
 journal      = "J. Funct. Program.",
 volume       = "11",
 number       = "1",
 pages        = "33--53",
 doi          = "10.1017/S0956796800003877",
)
@inproceedings(Bonfante01LPO,
 author       = "G. Bonfante and J.-Y. Marion and J.-Y. Moyen",
 year         = "2001",
 title        = "{On Lexicographic Termination Ordering with Space Bound Certifications}",
 booktitle    = "The 4th Andrei Ershov Memorial Conference, Revised Papers",
 pages        = "482--493",
 doi          = "10.1007/3-540-45575-2\_46",
)
@article(Bonfante11,
 author       = "G. Bonfante and J.-Y. Marion and J.-Y. Moyen",
 year         = "2011",
 title        = "{Quasi-interpretations A Way to Control Resources}",
 journal      = "Theor. Comput. Sci.",
 volume       = "412",
 number       = "25",
 pages        = "2776--2796",
 doi          = "10.1016/j.tcs.2011.02.007",
)
@inproceedings(GRR2010,
 author       = "U. {Dal Lago} and S. Martini and M. Zorzi",
 year         = "2010",
 title        = "{General Ramified Recurrence is Sound for Polynomial Time}",
 editor       = "Patrick Baillot",
 booktitle    = "Proceedings DICE 2010",
 pages        = "47--62",
 doi          = "10.4204/EPTCS.23.4",
)
@misc(Eguchi_wst14,
 author       = "N. Eguchi",
 year         = "2014",
 title        = "{Proving Termination of Unfolding Graph Rewriting for General Safe Recursion}",
 url          = "http://arxiv.org/abs/1404.6196",
 note         = "Technical report",
)
@incollection(HW99,
 author       = "W. G. Handley and S. S. Wainer",
 year         = "1999",
 title        = "{Complexity of Primitive Recursion}",
 editor       = "U. Berger and H. Schwichtenberg",
 booktitle    = "Computational Logic",
 series       = "NATO ASI Series F: Computer and Systems Science",
 volume       = "165",
 publisher    = "Springer",
 pages        = "273--300",
 doi          = "10.1007/978-3-642-58622-4\_8",
)
@incollection(Leivant95,
 author       = "D. Leivant",
 year         = "1995",
 title        = "{Ramified Recurrence and Computational Complexity I: Word Recurrence and Poly-time}",
 editor       = "Peter Clote and Jeffrey B. Remmel",
 booktitle    = "Feasible Mathematics II, Progress in Computer Science and Applied Logic",
 volume       = "13",
 publisher    = "{Birkh\"{a}user Boston}",
 pages        = "320--343",
 doi          = "10.1007/978-1-4612-2566-9\_11",
)
@inproceedings(LM94,
 author       = "D. Leivant and J.-Y. Marion",
 year         = "1994",
 title        = "{Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space}",
 booktitle    = "The 8th CSL, Selected Papers",
 pages        = "486--500",
 doi          = "10.1007/BFb0022277",
)
@article(Marion03,
 author       = "J.-Y. Marion",
 year         = "2003",
 title        = "{Analysing the Implicit Complexity of Programs}",
 journal      = "Information and Computation",
 volume       = "183",
 number       = "1",
 pages        = "2--18",
 doi          = "10.1016/S0890-5401(03)00011-7",
)
@inproceedings(MidOZ96,
 author       = "A. Middeldorp and H. Ohsaki and H. Zantema",
 year         = "1996",
 title        = "{Transforming Termination by Self-Labeling}",
 booktitle    = "Proceedings of the 13th CADE",
 series       = "LNCS",
 volume       = "1104",
 pages        = "373--387",
 doi          = "10.1007/3-540-61511-3\_101",
)