On the public citation graph

A unified lower bound estimation technique for high-level synthesis

0 signed · 43 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

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.31522openalex-snapshot
Force-directed scheduling for the behavioral synthesis of ASICs
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/cicc.1992.591165openalex-snapshot
A Branch-and-bound Method For The Optimal Scheduling
inferredcites →https://doi.org/10.1109/dac.1986.1586131openalex-snapshot
Using Bottom-Up Design Techniques in the Synthesis of Digital Hardware from Abstract Behavioral Descriptions
inferredcites →https://doi.org/10.1109/iccad.1989.76896openalex-snapshot
A new integer linear programming formulation for the scheduling problem in data path synthesis
inferredcites →https://doi.org/10.1109/iccad.1992.279347openalex-snapshot
Accurate layout area and delay modeling for system level design
inferredcites →https://doi.org/10.1109/iccad.1993.580097openalex-snapshot
Execution interval analysis under resource constraints
inferredcites →https://doi.org/10.1109/iccd.1992.276272openalex-snapshot
Estimating lower-bound performance of schedules using a relaxation technique
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/ishls.1994.302341openalex-snapshot
SMASH: a program for scheduling memory-intensive application-specific hardware
inferredcites →https://doi.org/10.1109/ishls.1994.302344openalex-snapshot
Computing lower bounds on functional units before scheduling
inferredcites →https://doi.org/10.1109/proc.1984.12944openalex-snapshot
On supercomputing with systolic/wavefront array processors
inferredcites →https://doi.org/10.1145/127601.127609openalex-snapshot
Simultaneous scheduling and allocation for cost constrained optimal architectural synthesis
inferredcites →https://doi.org/10.1145/157485.164926openalex-snapshot
InSyn
inferredcites →https://doi.org/10.5555/254208.254220openalex-snapshot
Computing lower bounds on functional units before scheduling
inferredcites →https://doi.org/10.5555/254208.254225openalex-snapshot
SMASH: a program for scheduling memory-intensive application-specific hardware
inferredcites →https://doi.org/10.5555/259794.259869openalex-snapshot
Execution interval analysis under resource constraints

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-45373-3_4openalex-snapshot
Power Macro-Modelling for Firm-Macro
inferred← citeshttps://doi.org/10.1007/978-3-540-30205-6_64openalex-snapshot
Enhancing GALS Processor Performance Using Data Classification Based on Data Latency
inferred← citeshttps://doi.org/10.1007/bf02960762openalex-snapshot
Lower bound estimation of hardware resources for scheduling in high-level 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.1016/s1383-7621(03)00012-2openalex-snapshot
New design methodology with efficient prediction of quality metrics for logic level design towards dynamic reconfigurable logic
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.920813openalex-snapshot
Estimation of lower and upper bounds on the power consumption from scheduled data flow graphs
inferred← citeshttps://doi.org/10.1109/cvprw.2006.167openalex-snapshot
Reconfigurable Streaming Architectures for Embedded Smart Cameras
inferred← citeshttps://doi.org/10.1109/fpl.2006.311288openalex-snapshot
High-Level Synthesis of Multiple Word-Length DSP Algorithms Using Heterogeneous-Resource FPGAs
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/isss.1998.730600openalex-snapshot
Concurrent error detection at architectural level
inferred← citeshttps://doi.org/10.1109/isss.2000.874047openalex-snapshot
Lower bound estimation for low power high-level synthesis
inferred← citeshttps://doi.org/10.1109/mcom.2005.1561924openalex-snapshot
Streaming processors for next-generation mobile imaging applications
inferred← citeshttps://doi.org/10.1109/rsp.2006.33openalex-snapshot
Rapid Resource-Constrained Hardware Performance Estimation
inferred← citeshttps://doi.org/10.1109/tc.2004.105openalex-snapshot
A-combined approach to high-level synthesis for dynamically reconfigurable systems
inferred← citeshttps://doi.org/10.1109/tcsii.2005.862175openalex-snapshot
Optimal combined word-length allocation and architectural synthesis of digital signal processing circuits
inferred← citeshttps://doi.org/10.1109/tvlsi.2004.827564openalex-snapshot
Efficient metrics and high-level synthesis for dynamically reconfigurable logic
inferred← citeshttps://doi.org/10.1117/12.2285825openalex-snapshot
Estimating the circuit delay of FPGA with a transfer learning method
inferred← citeshttps://doi.org/10.1145/313817.313891openalex-snapshot
Lower and upper bounds on the switching activity in scheduled data flow graphs
inferred← citeshttps://doi.org/10.1155/2009/703267openalex-snapshot
Architectural Synthesis of Fixed‐Point DSP Datapaths Using FPGAs
inferred← citeshttps://doi.org/10.20868/upm.thesis.1822openalex-snapshot
Combined Word-Length Allocation and High-Level Synthesis of Digital Signal Processing Circuits
inferred← citeshttps://doi.org/10.5555/293016.293032openalex-snapshot
Concurrent error detection at architectural level
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.