On the public citation graph
SALSA: a new approach to scheduling with timing constraints
0 signed · 103 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/978-1-4613-1519-3openalex-snapshot
Algorithmic and Register-Transfer Level Synthesis: The System Architect’s Workbench
inferredcites →https://doi.org/10.1007/978-94-009-3649-2_4openalex-snapshot
Symbolic Layout and Procedural Design
inferredcites →https://doi.org/10.1109/101.17235openalex-snapshot
Simulated annealing algorithms: an overview
inferredcites →https://doi.org/10.1109/43.240074openalex-snapshot
Global optimization approach for architectural synthesis
inferredcites →https://doi.org/10.1109/43.31522openalex-snapshot
Force-directed scheduling for the behavioral synthesis of ASICs
inferredcites →https://doi.org/10.1109/43.31534openalex-snapshot
Algorithms for hardware allocation in data path synthesis
inferredcites →https://doi.org/10.1109/43.59070openalex-snapshot
Incorporating bottom-up design into hardware synthesis
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/5.52214openalex-snapshot
The high-level synthesis of digital systems
inferredcites →https://doi.org/10.1109/54.82037openalex-snapshot
Fast prototyping of datapath-intensive architectures
inferredcites →https://doi.org/10.1109/dac.1983.1585697openalex-snapshot
A Method of Automatic Data Path Synthesis
inferredcites →https://doi.org/10.1109/dac.1986.1586129openalex-snapshot
MAHA: A Program for Datapath Synthesis
inferredcites →https://doi.org/10.1109/dac.1988.14802openalex-snapshot
High-level synthesis: current status and future directions
inferredcites →https://doi.org/10.1109/edac.1991.206441openalex-snapshot
Improved force-directed scheduling
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.1989.76905openalex-snapshot
A resource sharing and control synthesis method for conditional branches
inferredcites →https://doi.org/10.1109/mwscas.1990.140679openalex-snapshot
Applying simulated evolution to scheduling in high level synthesis
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1109/tcad.1983.1270022openalex-snapshot
An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints
inferredcites →https://doi.org/10.1109/tcad.1986.1270207openalex-snapshot
Automated Synthesis of Data Paths in Digital Systems
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1145/123186.123227openalex-snapshot
Relative scheduling under timing constraints
inferredcites →https://doi.org/10.1145/74382.74383openalex-snapshot
Scheduling and binding algorithms for high-level synthesis
inferredcites →https://doi.org/10.1145/74382.74384openalex-snapshot
Loop optimization in register-transfer scheduling for DSP-systems
inferredcites →https://doi.org/10.1145/74382.74396openalex-snapshot
Automatic production of controller specifications from control and timing behavioral descriptions
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.5555/285730.285797openalex-snapshot
Bridge: a versatile behavioral synthesis system
inferredcites →https://doi.org/10.5555/318013.318087openalex-snapshot
MAHA: A Program for Datapath Synthesis
inferredcites →https://doi.org/10.5555/800032.800712openalex-snapshot
A Method of Automatic Data Path Synthesis
inferredcites →https://doi.org/10.5555/951513.951607openalex-snapshot
Improved force-directed scheduling
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cta.3666openalex-snapshot
Simulated annealing‐based high‐level synthesis methodology for reliable and energy‐aware application specific integrated circuit designs with multiple supply voltages
inferred← citeshttps://doi.org/10.1007/978-1-4615-2762-6_2openalex-snapshot
Synthesizing Optimal Application-Specific DSP Architectures
inferred← citeshttps://doi.org/10.1007/978-1-4615-3966-7_10openalex-snapshot
Architectural Optimization Methods for Control-Dominated Machines
inferred← citeshttps://doi.org/10.1007/s12065-019-00302-wopenalex-snapshot
A novel method for high-level synthesis of datapaths in digital filters using a moth-flame optimization algorithm
inferred← citeshttps://doi.org/10.1016/0167-9260(91)90025-gopenalex-snapshot
New methods for coloring and clique partitioning in data path allocation
inferred← citeshttps://doi.org/10.1016/0167-9260(91)90033-hopenalex-snapshot
Constrained resource sharing and conflict resolution in Hebe
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2014.12.008openalex-snapshot
Automated design space exploration of multi-cycle transient fault detectable datapath based on multi-objective user constraints for application specific computing
inferred← citeshttps://doi.org/10.1016/j.amc.2015.07.042openalex-snapshot
Adaptive bacterial foraging driven datapath optimization: Exploring power-performance tradeoff in high level synthesis
inferred← citeshttps://doi.org/10.1016/j.eswa.2015.01.058openalex-snapshot
Bacterial foraging driven exploration of multi cycle fault tolerant datapath based on power-performance tradeoff in high level synthesis
inferred← citeshttps://doi.org/10.1016/j.micpro.2025.105154openalex-snapshot
A novel machine learning-driven optimization methodology for faster and more efficient design space exploration in high-level synthesis
inferred← citeshttps://doi.org/10.1016/j.microrel.2015.03.010openalex-snapshot
Swarm intelligence driven design space exploration of optimal k-cycle transient fault secured datapath during high level synthesis based on user power–delay budget
inferred← citeshttps://doi.org/10.1016/j.swevo.2019.04.006openalex-snapshot
Grey Wolf Optimizer Driven design space exploration: A novel framework for multi-objective trade-off in architectural synthesis
inferred← citeshttps://doi.org/10.1016/s0045-7906(01)00047-7openalex-snapshot
A neural networks algorithm for data path synthesis
inferred← citeshttps://doi.org/10.1049/iet-cdt:20070162openalex-snapshot
Heuristic algorithm for the resource-constrained scheduling problem during high-level synthesis
inferred← citeshttps://doi.org/10.1109/4.209990openalex-snapshot
Synthesizing embedded speed-optimized architectures
inferred← citeshttps://doi.org/10.1109/43.215002openalex-snapshot
Applying simulated evolution to high level synthesis
inferred← citeshttps://doi.org/10.1109/43.293941openalex-snapshot
Exploiting the special structure of conflict and compatibility graphs in high-level synthesis
inferred← citeshttps://doi.org/10.1109/43.631209openalex-snapshot
A unified lower bound estimation technique for high-level synthesis
inferred← citeshttps://doi.org/10.1109/92.406996openalex-snapshot
Global scheduling with code-motions for high-level synthesis applications
inferred← citeshttps://doi.org/10.1109/92.502199openalex-snapshot
Computing lower bounds on functional units before 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/asic.1996.551982openalex-snapshot
Performance optimization and system clock determination for synthesis of DSP cores targeting FPGAs
inferred← citeshttps://doi.org/10.1109/ccece.2000.849734openalex-snapshot
An evolutionary approach for data path synthesis
inferred← citeshttps://doi.org/10.1109/ccece.2001.933591openalex-snapshot
A genetic algorithm for testable data path synthesis
inferred← citeshttps://doi.org/10.1109/ccece.2001.933689openalex-snapshot
A genetic algorithm for testable data path synthesis
inferred← citeshttps://doi.org/10.1109/codes.2002.1003613openalex-snapshot
Strongly polynomial-time algorithm for over-constraint resolution: efficient debugging of timing constraint violations
inferred← citeshttps://doi.org/10.1109/dsd.2002.1115384openalex-snapshot
An efficient list-based scheduling algorithm for high-level synthesis
inferred← citeshttps://doi.org/10.1109/dsd.2008.120openalex-snapshot
Restricted Chaining and Fragmentation Techniques in Power Aware High Level Synthesis
inferred← citeshttps://doi.org/10.1109/edtc.1994.326858openalex-snapshot
Optimal operation scheduling using resource lower bound estimations
inferred← citeshttps://doi.org/10.1109/eurdac.1996.558253openalex-snapshot
Specification and management of timing constraints in behavioral VHDL
inferred← citeshttps://doi.org/10.1109/eurmic.1998.711781openalex-snapshot
Operation binding and scheduling for low power using constraint logic programming
inferred← citeshttps://doi.org/10.1109/icasic.1996.562760openalex-snapshot
On fast exploration of ASIC design space
inferred← citeshttps://doi.org/10.1109/iscas.1993.394064openalex-snapshot
SALSA II: A fast transformational scheduler for high-level synthesis
inferred← citeshttps://doi.org/10.1109/iscas.1993.692989openalex-snapshot
SALSA II: a fast transformational scheduler for high-level synthesis
inferred← citeshttps://doi.org/10.1109/iscas.1995.521531openalex-snapshot
ANSA: a new neural net based scheduling algorithm for high level synthesis
inferred← citeshttps://doi.org/10.1109/iscas.2003.1206391openalex-snapshot
An exploration-based binding and scheduling technique for synthesis of digital blocks for mixed-signal applications
inferred← citeshttps://doi.org/10.1109/isqed.2011.5770772openalex-snapshot
Integrated scheduling, allocation and binding in High Level Synthesis using multi structure genetic algorithm based design space exploration
inferred← citeshttps://doi.org/10.1109/isqed.2014.6783307openalex-snapshot
Integrated particle swarm optimization (i-PSO): An adaptive design space exploration framework for power-performance tradeoff in architectural synthesis
inferred← citeshttps://doi.org/10.1109/isqed.2017.7918321openalex-snapshot
Power-delay product based resource library construction for effective power optimization in HLS
inferred← citeshttps://doi.org/10.1109/isqed51717.2021.9424266openalex-snapshot
On the Correlation between Resource Minimization and Interconnect Complexities in High-Level Synthesis
inferred← citeshttps://doi.org/10.1109/isss.1995.520616openalex-snapshot
An exact methodology for scheduling in a 3D design space
inferred← citeshttps://doi.org/10.1109/mce.2016.2556760openalex-snapshot
Cognizance on Intellectual Property: A High-Level Perspective [Hardware Matters]
inferred← citeshttps://doi.org/10.1109/mwscas.1994.519252openalex-snapshot
PASSOS: a different approach for assignment and scheduling for power, area and speed optimization in high-level synthesis
inferred← citeshttps://doi.org/10.1109/reconfig.2005.27openalex-snapshot
Optimizing Register Binding in FPGAs Using Simulated Annealing
inferred← citeshttps://doi.org/10.1109/tevc.2005.860764openalex-snapshot
A genetic algorithm for the design space exploration of datapaths during high-level synthesis
inferred← citeshttps://doi.org/10.1142/s0218126605002362openalex-snapshot
AN EVOLUTIONARY ALGORITHM FOR THE ALLOCATION PROBLEM IN HIGH-LEVEL SYNTHESIS
inferred← citeshttps://doi.org/10.1145/1132357.1132359openalex-snapshot
A formal method for hardware IP design and integration under I/O and timing constraints
inferred← citeshttps://doi.org/10.1145/1455229.1455237openalex-snapshot
Provably efficient algorithms for resolving temporal and spatial difference constraint violations
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/224818.224842openalex-snapshot
High-level synthesis scheduling and allocation using genetic algorithms
inferred← citeshttps://doi.org/10.1145/2660768openalex-snapshot
Automated Iterative Pipelining for ASIC Design
inferred← citeshttps://doi.org/10.1145/323480.323486openalex-snapshot
A flexible datapath allocation method for architectural synthesis
inferred← citeshttps://doi.org/10.1145/3520140openalex-snapshot
Adaptive Clock Management of HLS-generated Circuits on FPGAs
inferred← citeshttps://doi.org/10.1145/378239.379037openalex-snapshot
Integrated high-level synthesis and power-net routing for digital design under switching noise constraints
inferred← citeshttps://doi.org/10.1145/589411.589423openalex-snapshot
Efficient algorithms for debugging timing constraint violations
inferred← citeshttps://doi.org/10.1145/774789.774816openalex-snapshot
A strongly polynomial-time algorithm for over-constraint resolution
inferred← citeshttps://doi.org/10.2298/fuee1402235sopenalex-snapshot
Execution time - area tradeoff in gausing residual load decoder: Integrated exploration of chaining based schedule and allocation in HLS for hardware accelerators
inferred← citeshttps://doi.org/10.2298/fuee1403317sopenalex-snapshot
Rapid exploration of cost-performance tradeoffs using dominance effect during design of hardware accelerators
inferred← citeshttps://doi.org/10.23919/date.2018.8341975openalex-snapshot
A fast and effective lookahead and fractional search based scheduling algorithm for high-level synthesis
inferred← citeshttps://doi.org/10.26076/0e94-1111openalex-snapshot
A Methodology to Design Pipelined Simulated Annealing Kernel Accelerators on Space-borne Field-Programmable Gate Arrays
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.2447openalex-snapshot
Power and memory optimization techniques in embedded systems design
inferred← citeshttps://doi.org/10.4018/978-1-5225-3935-3.ch017openalex-snapshot
Optimization of Dynamic Power for System on Programmable Chip SOPC
inferred← citeshttps://doi.org/10.52547/jsdp.18.3.3openalex-snapshot
An efficient CAD tool for High-Level Synthesis of VLSI digital transformers
inferred← citeshttps://doi.org/10.5555/113938.110381openalex-snapshot
Representing conditional branches for high-level synthesis applications
inferred← citeshttps://doi.org/10.5555/113938.149396openalex-snapshot
High-level synthesis from VHDL with exact timing constraints
inferred← citeshttps://doi.org/10.5555/113938.149445openalex-snapshot
Data path allocation using an extended binding model
inferred← citeshttps://doi.org/10.5555/224841.878265openalex-snapshot
Time-constrained loop pipelining
inferred← citeshttps://doi.org/10.5555/252471.252557openalex-snapshot
Specification and management of timing constraints in behavioral VHDL
inferred← citeshttps://doi.org/10.5555/832284.835416openalex-snapshot
A Heuristic for Clock Selection in High-Level Synthesis
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93313openalex-snapshot
Loop pipelining with resource and timing constraints
inferred← citeshttps://doi.org/10.6100/ir465366openalex-snapshot
The application of genetic algorithms to high-level synthesis
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.