Dataflow Graphs

Dataflow Graphs is a directed graph model in which nodes represent computational operations and edges represent data dependencies between those operations, serving as a formal representation of parallelism and execution flow in high-level synthesis.

701

Publications

35.4K

Citations

1.5K

Authors

454

Institutions

Publications per year

2017–2026

75

Variants

Dataflow Graph

Authors

1.5K

  1. MG
    Marc Geilen

    Eindhoven University of Technology, Netherlands

    32 publications · 2K citations

    23

    h-index

  2. SS
    Sander Stuijk

    Eindhoven University of Technology, Netherlands

    27 publications · 1.8K citations

    20

    h-index

  3. TB
    Twan Basten

    Eindhoven University of Technology, Netherlands

    26 publications · 1.7K citations

    19

    h-index

  4. EA
    Edward A. Lee

    University of California, Berkeley, United States

    24 publications · 3.2K citations

    18

    h-index

  5. SS
    Shuvra S. Bhattacharyya

    University of Maryland, College Park, United States

    38 publications · 896 citations

    18

    h-index

1–5 of 1.5K

Venues

  1. 13

    h-index

  2. IEEE Transactions on Software Engineering

    TSE · 13 publications · 727 citations

    13

    h-index

  3. IEEE Transactions on Computers

    14 publications · 701 citations

    13

    h-index

  4. arXiv (Cornell University)

    Repository · 10 publications · 630 citations

    10

    h-index

  5. ACM SIGPLAN Notices

    10 publications · 438 citations

    10

    h-index

1–5