Publications
Search

Publications :: Search

Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity.

Show publication

On this page you see the details of the selected publication.

    Publication properties
    Title: Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity.
    Rating: (not rated yet)
    Discussion: 0 comments
    Date: 2011
    Publication type: Conference paper
    Authors:
    No. First name Last name Show
    1. Georg Moser
    2. Andreas Schnabl
    Download (by DOI): 10.4230/LIPIcs.RTA.2011.235
    BibTeX: conf/rta/MoserS11
    DBLP: db/conf/rta/rta2011.html#MoserS11
    Bookmark:

    The following keywords have been assigned to this publication so far. If you have logged in, you can tag this publication with additional keywords.

    Keywords
    No keywords have been assigned to this publication yet.

    If you log in you can tag this publication with additional keywords

    A publication can refer to another publication (outgoing references) or it can be referred to by other publications (incoming references).

    Incoming References
    No incoming references have been assigned to this publication yet.
    Outgoing References
    No outgoing references have been assigned to this publication yet.

    If you log in you can add references to other publications

    A publication can be assigned to a conference, a journal or a school.

    Conference
    Name: Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, RTA 2011, May 30 - June 1, 2011, Novi Sad, Serbia 2011
    URL: http://www.dagstuhl.de/dagpub/978-3-939897-30-9
    DBLP: db/conf/rta/rta2011.html