On the public citation graph
Computing lower bounds on functional units before scheduling
0 signed · 42 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.1002/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-1-4613-1519-3openalex-snapshot
Algorithmic and Register-Transfer Level Synthesis: The System Architect’s Workbench
inferredcites →https://doi.org/10.1007/978-1-4615-4018-2openalex-snapshot
Optimal VLSI Architectural Synthesis
inferredcites →https://doi.org/10.1016/s0022-0000(75)80008-0openalex-snapshot
NP-complete scheduling problems
inferredcites →https://doi.org/10.1109/43.149767openalex-snapshot
Predicting system-level area and delay for pipelined and nonpipelined designs
inferredcites →https://doi.org/10.1109/43.238604openalex-snapshot
SALSA: a new approach to scheduling with timing constraints
inferredcites →https://doi.org/10.1109/43.285240openalex-snapshot
Estimating implementation bounds for real time DSP application specific circuits
inferredcites →https://doi.org/10.1109/43.75629openalex-snapshot
A formal approach to the scheduling problem in high level synthesis
inferredcites →https://doi.org/10.1109/92.238417openalex-snapshot
Estimating architectural resources and performance for high-level synthesis applications
inferredcites →https://doi.org/10.1109/92.335014openalex-snapshot
Analyzing and exploiting the structure of the constraints in the ILP approach to the scheduling problem
inferredcites →https://doi.org/10.1109/92.502199openalex-snapshot
Computing lower bounds on functional units before scheduling
inferredcites →https://doi.org/10.1109/iccd.1993.393411openalex-snapshot
Lower bounds on the iteration time and the number of resources for functional pipelined data flow graphs
inferredcites →https://doi.org/10.1109/iscas.1994.408813openalex-snapshot
Improved lower bounds for the scheduling optimization problem
inferredcites →https://doi.org/10.1109/isss.1995.520616openalex-snapshot
An exact methodology for scheduling in a 3D design space
inferredcites →https://doi.org/10.1109/tc.1973.5009153openalex-snapshot
Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules
inferredcites →https://doi.org/10.1145/224486.224505openalex-snapshot
An exact methodology for scheduling in a 3D design space
inferredcites →https://doi.org/10.5555/191326.191401openalex-snapshot
Comprehensive lower bound estimation from behavioral descriptions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-30502-6_6openalex-snapshot
Design Exploration Framework Under Impreciseness Based on Register-Constrained Inclusion Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-28977-4_2openalex-snapshot
Formal Methods in High-Level and System Synthesis
inferred← citeshttps://doi.org/10.1016/s0026-2714(01)00263-3openalex-snapshot
On-line testable data path synthesis for minimizing testing time
inferred← citeshttps://doi.org/10.1023/a:1008921705476openalex-snapshot
Efficient Block Scheduling to Minimize Context Switching Time for Programmable Embedded Processors
inferred← citeshttps://doi.org/10.1023/a:1008965304567openalex-snapshot
Synthesis of Hard Real-Time Application Specific Systems
inferred← citeshttps://doi.org/10.1109/43.851990openalex-snapshot
Functional area lower bound and upper bound on multicomponent selection for interval scheduling
inferred← citeshttps://doi.org/10.1109/92.555988openalex-snapshot
A solution methodology for exact design space exploration in a three-dimensional design space
inferred← citeshttps://doi.org/10.1109/date.1998.655833openalex-snapshot
Hardware software partitioning with integrated hardware design space exploration
inferred← citeshttps://doi.org/10.1109/glsv.1999.757408openalex-snapshot
Efficiently searching the optimal design space
inferred← citeshttps://doi.org/10.1109/glsv.1999.757449openalex-snapshot
Accurate resource estimation algorithms for behavioral synthesis
inferred← citeshttps://doi.org/10.1109/iccd.1998.727023openalex-snapshot
Accuracy sensitive word-length selection for algorithm optimization
inferred← citeshttps://doi.org/10.1109/iscas.1999.780174openalex-snapshot
A lower bound on general minimal resource interval scheduling with arbitrary component selection
inferred← citeshttps://doi.org/10.1109/isie.2008.4677118openalex-snapshot
High-level delay estimation technique for porting C-based applications on FPGA
inferred← citeshttps://doi.org/10.1109/rsp.2006.33openalex-snapshot
Rapid Resource-Constrained Hardware Performance Estimation
inferred← citeshttps://doi.org/10.1145/1698759.1698762openalex-snapshot
Speeding-up heuristic allocation, scheduling and binding with SAT-based abstraction/refinement techniques
inferred← citeshttps://doi.org/10.1145/224486.224505openalex-snapshot
An exact methodology for scheduling in a 3D design space
inferred← citeshttps://doi.org/10.1145/224486.224528openalex-snapshot
A comprehensive estimation technique for high-level synthesis
inferred← citeshttps://doi.org/10.1145/240518.240545openalex-snapshot
Lower bounds on test resources for scheduled data flow graphs
inferred← citeshttps://doi.org/10.1145/250243.250245openalex-snapshot
Recent developments in high-level synthesis
inferred← citeshttps://doi.org/10.1145/337292.337573openalex-snapshot
On lower bounds for scheduling problems in high-level synthesis
inferred← citeshttps://doi.org/10.1145/348019.348058openalex-snapshot
Efficient optimal design space characterization methodologies
inferred← citeshttps://doi.org/10.1145/378239.379039openalex-snapshot
Statistical design space exploration for application-specific unit synthesis
inferred← citeshttps://doi.org/10.1155/2012/156907openalex-snapshot
Formal ESL Synthesis for Control-Intensive Applications
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.2447openalex-snapshot
Power and memory optimization techniques in embedded systems design
showing the first 24 of 25 · page through all 25
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.