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.