On the public citation graph
Integer Linear Programming-Based Scheduling for Transport Triggered Architectures
0 signed · 41 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11823285_31openalex-snapshot
Code Generation for STA Architecture
inferredcites →https://doi.org/10.1007/11823285_48openalex-snapshot
Optimal Integrated VLIW Code Generation with Integer Linear Programming
inferredcites →https://doi.org/10.1007/978-1-4615-2323-9_14openalex-snapshot
Code Generation for Transport Triggered Architectures
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-540-27776-7_36openalex-snapshot
Synchronous Transfer Architecture (STA)
inferredcites →https://doi.org/10.1007/978-3-540-49051-7_9openalex-snapshot
Code Optimization by Integer Linear Programming
inferredcites →https://doi.org/10.1007/978-3-540-68155-7_4openalex-snapshot
Constraint Integer Programming: A New Approach to Integrate CP and MIP
inferredcites →https://doi.org/10.1007/978-3-540-68279-0openalex-snapshot
50 years of integer programming 1958-2008 : from the early years to the state-of-the-art
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_5openalex-snapshot
An Automatic Method for Solving Discrete Programming Problems
inferredcites →https://doi.org/10.1007/978-3-540-70550-5_4openalex-snapshot
Impact of Software Bypassing on Instruction Level Parallelism and Register File Traffic
inferredcites →https://doi.org/10.1007/978-3-540-92990-1_7openalex-snapshot
Integrated Modulo Scheduling for Clustered VLIW Architectures
inferredcites →https://doi.org/10.1007/978-3-642-33558-7_54openalex-snapshot
Constraint-Based Register Allocation and Instruction Scheduling
inferredcites →https://doi.org/10.1007/s11265-014-0924-xopenalex-snapshot
Code Density and Energy Efficiency of Exposed Datapath Architectures
inferredcites →https://doi.org/10.1016/0004-3702(77)90007-8openalex-snapshot
Consistency in networks of relations
inferredcites →https://doi.org/10.1016/s0898-1221(97)00184-3openalex-snapshot
Using integer linear programming for instruction scheduling and register allocation in multi-issue processors
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/fpl.2010.51openalex-snapshot
Customized Exposed Datapath Soft-Core Design Flow with Compiler Support
inferredcites →https://doi.org/10.1109/tc.1985.1676531openalex-snapshot
An Optimal Instruction-Scheduling Model for a Class of Vector Processors
inferredcites →https://doi.org/10.1145/1361096.1361099openalex-snapshot
Optimal vs. heuristic integrated code generation for clustered VLIW architectures
inferredcites →https://doi.org/10.1145/192724.192751openalex-snapshot
Register file port requirements of transport triggered architectures
inferredcites →https://doi.org/10.1145/2180887.2180896openalex-snapshot
Integrated Code Generation for Loops
inferredcites →https://doi.org/10.1145/2463596.2486155openalex-snapshot
Constraint-based code generation
inferredcites →https://doi.org/10.1145/285930.285985openalex-snapshot
Very long instruction work architectures and the ELI-512
inferredcites →https://doi.org/10.1145/349299.349318openalex-snapshot
Optimal instruction scheduling using integer programming
inferredcites →https://doi.org/10.1145/384196.384217openalex-snapshot
ILP-based Instruction Scheduling for IA-64
inferredcites →https://doi.org/10.1145/384197.384217openalex-snapshot
ILP-based Instruction Scheduling for IA-64
inferredcites →https://doi.org/10.1145/800046.801649openalex-snapshot
Very Long Instruction Word architectures and the ELI-512
inferredcites →https://doi.org/10.1287/opre.16.2.353openalex-snapshot
A Branch-Bound Solution to the General Scheduling Problem
inferredcites →https://doi.org/10.2307/1910129openalex-snapshot
An Automatic Method of Solving Discrete Programming Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11265-019-01493-2openalex-snapshot
Evolutionary Algorithms for Instruction Scheduling, Operation Merging, and Register Allocation in VLIW Compilers
inferred← citeshttps://doi.org/10.1017/s1471068418000170openalex-snapshot
Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP
inferred← citeshttps://doi.org/10.1109/acsd.2018.00020openalex-snapshot
On Memory Optimal Code Generation for Exposed Datapath Architectures with Buffered Processing Units
inferred← citeshttps://doi.org/10.1109/dsd57027.2022.00030openalex-snapshot
Prebypass: Software Register File Bypassing for Reduced Interconnection Architectures
inferred← citeshttps://doi.org/10.1109/fdl68117.2025.11165276openalex-snapshot
Performance Modeling and Analysis of Exposed Datapath Architectures
inferred← citeshttps://doi.org/10.1109/norcas64408.2024.10752440openalex-snapshot
Cycle Count Estimation of VLIW Processors Using Machine Learning
inferred← citeshttps://doi.org/10.1109/samos.2016.7818355openalex-snapshot
Aggressively bypassing list scheduler for transport triggered architectures
inferred← citeshttps://doi.org/10.1109/samos.2017.8344605openalex-snapshot
Exploring different execution paradigms in exposed datapath architectures with buffered processing units
inferred← citeshttps://doi.org/10.1109/samos.2017.8344625openalex-snapshot
Exposed datapath optimizations for loop scheduling
inferred← citeshttps://doi.org/10.1145/3656642openalex-snapshot
R-Blocks: an Energy-Efficient, Flexible, and Programmable CGRA
inferred← citeshttps://doi.org/10.1186/s43067-026-00360-yopenalex-snapshot
Optimization of transmission maintenance schedule using transformer load forecasting with modified hybrid CNN-LSTM and integer linear programming
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.