A Polynomial-time algorithm for the computation of the iteration-period bound in recursive data-flow graphs

Sabih H. Gerez, S.M. Heemstra de Groot, O.E. Herrmann

    Research output: Book/ReportReportProfessional

    Original languageUndefined
    Place of PublicationEnschede
    PublisherUniversiteit Twente EL/BSC
    Publication statusPublished - 1 Jan 1990

    Keywords

    • METIS-118197

    Cite this

    Gerez, S. H., Heemstra de Groot, S. M., & Herrmann, O. E. (1990). A Polynomial-time algorithm for the computation of the iteration-period bound in recursive data-flow graphs. Enschede: Universiteit Twente EL/BSC.
    Gerez, Sabih H. ; Heemstra de Groot, S.M. ; Herrmann, O.E. / A Polynomial-time algorithm for the computation of the iteration-period bound in recursive data-flow graphs. Enschede : Universiteit Twente EL/BSC, 1990.
    @book{b7947a00308f435cad322e4cde7ba300,
    title = "A Polynomial-time algorithm for the computation of the iteration-period bound in recursive data-flow graphs",
    keywords = "METIS-118197",
    author = "Gerez, {Sabih H.} and {Heemstra de Groot}, S.M. and O.E. Herrmann",
    year = "1990",
    month = "1",
    day = "1",
    language = "Undefined",
    publisher = "Universiteit Twente EL/BSC",

    }

    Gerez, SH, Heemstra de Groot, SM & Herrmann, OE 1990, A Polynomial-time algorithm for the computation of the iteration-period bound in recursive data-flow graphs. Universiteit Twente EL/BSC, Enschede.

    A Polynomial-time algorithm for the computation of the iteration-period bound in recursive data-flow graphs. / Gerez, Sabih H.; Heemstra de Groot, S.M.; Herrmann, O.E.

    Enschede : Universiteit Twente EL/BSC, 1990.

    Research output: Book/ReportReportProfessional

    TY - BOOK

    T1 - A Polynomial-time algorithm for the computation of the iteration-period bound in recursive data-flow graphs

    AU - Gerez, Sabih H.

    AU - Heemstra de Groot, S.M.

    AU - Herrmann, O.E.

    PY - 1990/1/1

    Y1 - 1990/1/1

    KW - METIS-118197

    M3 - Report

    BT - A Polynomial-time algorithm for the computation of the iteration-period bound in recursive data-flow graphs

    PB - Universiteit Twente EL/BSC

    CY - Enschede

    ER -

    Gerez SH, Heemstra de Groot SM, Herrmann OE. A Polynomial-time algorithm for the computation of the iteration-period bound in recursive data-flow graphs. Enschede: Universiteit Twente EL/BSC, 1990.