default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnoop Bhagyanath
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j2]Klaus Schneider
, Anoop Bhagyanath:
Consistency Constraints for Mapping Dataflow Graphs to Hybrid Dataflow/von Neumann Architectures. ACM Trans. Embed. Comput. Syst. 22(5): 81:1-81:25 (2023)- [c13]Anoop Bhagyanath, Klaus Schneider:
Program Balancing in Compilation for Buffered Hybrid Dataflow Processors. COMPSAC 2023: 57-66 - [c12]Julius Roob, Anoop Bhagyanath, Klaus Schneider:
Towards Buffers as a Scalable Alternative to Registers for Processor-Local Memory. MBMV 2023: 1-12 - [c11]Anoop Bhagyanath, Nadine Kercher, Klaus Schneider:
Allocation and Scheduling of Dataflow Graphs on Hybrid Dataflow/von Neumann Architectures. MEMOCODE 2023: 59-70 - 2022
- [c10]Klaus Schneider, Anoop Bhagyanath, Julius Roob:
Code generation criteria for buffered exposed datapath architectures from dataflow graphs. LCTES 2022: 133-145 - [c9]Klaus Schneider, Anoop Bhagyanath, Julius Roob:
Virtual Buffers for Exposed Datapath Architectures. MBMV 2022: 1-11 - [c8]Anoop Bhagyanath, Klaus Schneider:
Buffer Allocation for Exposed Datapath Architectures. MCSoC 2022: 18-25 - 2021
- [b1]Anoop Bhagyanath:
Code Generation for Synchronous Control Asynchronous Dataflow Architectures. Kaiserslautern University of Technology, Germany, 2021
2010 – 2019
- 2018
- [j1]Marc Dahlem, Anoop Bhagyanath, Klaus Schneider:
Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP. Theory Pract. Log. Program. 18(3-4): 438-451 (2018) - [c7]Markus Anders, Anoop Bhagyanath, Klaus Schneider:
On Memory Optimal Code Generation for Exposed Datapath Architectures with Buffered Processing Units. ACSD 2018: 115-124 - [i1]Marc Dahlem, Anoop Bhagyanath, Klaus Schneider:
Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP. CoRR abs/1804.10998 (2018) - 2017
- [c6]Anoop Bhagyanath, Klaus Schneider:
Exploring the Potential of Instruction-Level Parallelism of Exposed Datapath Architectures with Buffered Processing Units. ACSD 2017: 106-115 - [c5]Anoop Bhagyanath, Klaus Schneider:
Exploring different execution paradigms in exposed datapath architectures with buffered processing units. SAMOS 2017: 1-10 - 2016
- [c4]Anoop Bhagyanath, Tripti Jain, Klaus Schneider:
Towards Code Generation for the Synchronous Control Asynchronous Dataflow (SCAD) Architectures. MBMV 2016: 77-88 - [c3]Anoop Bhagyanath, Klaus Schneider:
Optimal compilation for exposed datapath architectures with buffered processing units by SAT solvers. MEMOCODE 2016: 143-152 - [c2]Tripti Jain, Klaus Schneider, Anoop Bhagyanath:
The selector-tree network: A new self-routing and non-blocking interconnection network. ReCoSoC 2016: 1-8 - 2015
- [c1]Anoop Bhagyanath, Tripti Jain, Klaus Schneider:
A Time-Predictable Model of Computation. RTSS 2015: 376
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
