Graph-based Programming Models

Graph-Based Programming Models is a programming paradigm within FPGA design methodologies that represents computation as a directed graph of functional nodes and data dependencies, distinguishing itself by enabling explicit spatial and temporal parallelism through visual and structural abstraction of hardware operations.

32

Publications

1.2K

Citations

80

Authors

41

Institutions

Publications per year

2017–2026

8

Authors

80

  1. DP
    Detlef Plump

    University of York, United Kingdom

    4 publications · 101 citations

    4

    h-index

  2. CC
    Carlos Christensen

    Massachusetts Library Association, United States

    2 publications · 32 citations

    2

    h-index

  3. ME
    Martin Erwig

    Oregon State University, United States

    2 publications · 59 citations

    2

    h-index

  4. BC
    Bruno C. d. S. Oliveira

    University of Hong Kong, Hong Kong SAR China

    2 publications · 43 citations

    2

    h-index

  5. WR
    William R. Cook

    The University of Texas at Austin, United States

    2 publications · 43 citations

    2

    h-index

1–5 of 80

Venues

  1. Technische Universität Berlin – Universitätsbibliothek

    Repository · 2 publications · 37 citations

    2

    h-index

  2. IEEE Transactions on Software Engineering

    TSE · 2 publications · 55 citations

    2

    h-index

  3. ACM SIGPLAN Notices

    2 publications · 27 citations

    2

    h-index

  4. Applied Energy

    2 publications · 46 citations

    2

    h-index

  5. 2

    h-index

1–5