On the public citation graph
On the complexity of connectivity binding
0 signed · 63 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.1109/dac.1979.1600091openalex-snapshot
The CMU Design Automation System - An Example of Automated Data Path Design
inferredcites →https://doi.org/10.1109/dac.1983.1585697openalex-snapshot
A Method of Automatic Data Path Synthesis
inferredcites →https://doi.org/10.1109/dac.1984.1585857openalex-snapshot
The MIMOLA Design System: Tools for the Design of Digital Processors
inferredcites →https://doi.org/10.1109/dac.1985.1585949openalex-snapshot
The VLSI Design Automation Assistant: What's in a Knowledge Base
inferredcites →https://doi.org/10.1109/dac.1986.1586129openalex-snapshot
MAHA: A Program for Datapath Synthesis
inferredcites →https://doi.org/10.1109/dac.1988.14812openalex-snapshot
Splicer: a heuristic approach to connectivity binding
inferredcites →https://doi.org/10.1109/mc.1983.1654268openalex-snapshot
Automatic Data Path Synthesis
inferredcites →https://doi.org/10.1109/mc.1983.1654270openalex-snapshot
MacPitts: An Approach to Silicon Compilation
inferredcites →https://doi.org/10.1109/tcad.1986.1270207openalex-snapshot
Automated Synthesis of Data Paths in Digital Systems
inferredcites →https://doi.org/10.1109/tcad.1987.1270350openalex-snapshot
Design Tools for Intelligent Silicon Compilation
inferredcites →https://doi.org/10.1145/12130.12138openalex-snapshot
The complexity of optimization problems
inferredcites →https://doi.org/10.1145/800009.808055openalex-snapshot
Polynomial complete scheduling problems
inferredcites →https://doi.org/10.1145/957195.808055openalex-snapshot
Polynomial complete scheduling problems
inferredcites →https://doi.org/10.5555/285730.285817openalex-snapshot
Splicer: a heuristic approach to connectivity binding
inferredcites →https://doi.org/10.5555/318013.318055openalex-snapshot
HAL: A Multi-Paradigm Approach to Automatic Data Path Synthesis
inferredcites →https://doi.org/10.5555/800032.800712openalex-snapshot
A Method of Automatic Data Path Synthesis
inferredcites →https://doi.org/10.5555/800033.800857openalex-snapshot
The MIMOLA Design System: Tools for the Design of Digital Processors
inferredcites →https://doi.org/10.5555/800292.811694openalex-snapshot
The CMU Design Automation System - An Example of Automated Data Path Design
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1520-6440(200105)84:5<13::aid-ecjc2>3.0.co;2-hopenalex-snapshot
A proposal of a greedy-GA combined algorithm for data transfer binding problems
inferred← citeshttps://doi.org/10.1007/bf00971962openalex-snapshot
Incorporating testability considerations in high-level synthesis
inferred← citeshttps://doi.org/10.1016/s0898-1221(98)00076-5openalex-snapshot
Some new results in the complexity of allocation and binding in data path synthesis
inferred← citeshttps://doi.org/10.1023/a:1008191708726openalex-snapshot
A Framework for High Level Estimations of Signal Processing VLSI Implementations
inferred← citeshttps://doi.org/10.1023/a:1008357805049openalex-snapshot
Allocation Techniques for Reducing BIST Area Overhead of Data Paths
inferred← citeshttps://doi.org/10.1109/43.541441openalex-snapshot
Incorporating performance and testability constraints during binding in high-level synthesis
inferred← citeshttps://doi.org/10.1109/92.238417openalex-snapshot
Estimating architectural resources and performance for high-level synthesis applications
inferred← citeshttps://doi.org/10.1109/asic.1993.410752openalex-snapshot
Interconnect optimization in behavioral synthesis of ASICs
inferred← citeshttps://doi.org/10.1109/asicon.2013.6811938openalex-snapshot
Interconnection allocation between functional units and registers in High-Level Synthesis
inferred← citeshttps://doi.org/10.1109/aspdac.2004.1337542openalex-snapshot
Register binding and port assignment for multiplexer optimization
inferred← citeshttps://doi.org/10.1109/aspdac.2007.358040openalex-snapshot
High-Level Power Estimation and Low-Power Design Space Exploration for FPGAs
inferred← citeshttps://doi.org/10.1109/aspdac.2010.5419795openalex-snapshot
A high-level synthesis flow for custom instruction set extensions for application-specific processors
inferred← citeshttps://doi.org/10.1109/aspdac.2012.6164954openalex-snapshot
Clock-constrained simultaneous allocation and binding for multiplexer optimization in high-level synthesis
inferred← citeshttps://doi.org/10.1109/asqed.2013.6643576openalex-snapshot
Port assignment for multiplexer and interconnection optimization
inferred← citeshttps://doi.org/10.1109/ats.2000.893630openalex-snapshot
Strong self-testability for data paths high-level synthesis
inferred← citeshttps://doi.org/10.1109/dac.1995.249980openalex-snapshot
Data Path Allocation for Synthesizing RTL Designs with Low BIST Area Overhead
inferred← citeshttps://doi.org/10.1109/date.2008.4484821openalex-snapshot
Simultaneous FU and Register Binding Based on Network Flow Method
inferred← citeshttps://doi.org/10.1109/ftcs.1994.315634openalex-snapshot
Behavioral synthesis of testable designs
inferred← citeshttps://doi.org/10.1109/glsv.1992.218366openalex-snapshot
A heuristic for data path synthesis using multiport memories
inferred← citeshttps://doi.org/10.1109/iccad.2006.320017openalex-snapshot
Platform-Based Resource Binding Using a Distributed Register-File Microarchitecture
inferred← citeshttps://doi.org/10.1109/iccad.2007.4397262openalex-snapshot
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
inferred← citeshttps://doi.org/10.1109/icvd.1994.282677openalex-snapshot
BINET: an algorithm for solving the binding problem
inferred← citeshttps://doi.org/10.1109/iscas.2002.1009908openalex-snapshot
A heuristic DSP BIST insertion algorithm with minimum area overhead
inferred← citeshttps://doi.org/10.1109/lpe.2003.1231849openalex-snapshot
Low-power high-level synthesis for FPGA architectures
inferred← citeshttps://doi.org/10.1109/norchp.2012.6403107openalex-snapshot
Optimal register allocation by augmented left-edge algorithm on arbitrary control-flow structures
inferred← citeshttps://doi.org/10.1109/sasp.2008.4570779openalex-snapshot
Resource Sharing in Custom Instruction Set Extensions
inferred← citeshttps://doi.org/10.1109/tcad.2009.2026355openalex-snapshot
Design-Space Exploration of Resource-Sharing Solutions for Custom Instruction Set Extensions
inferred← citeshttps://doi.org/10.1109/tvlsi.2009.2013353openalex-snapshot
LOPASS: A Low-Power Architectural Synthesis System for FPGAs With Interconnect Estimation and Optimization
inferred← citeshttps://doi.org/10.1109/tvlsi.2016.2607758openalex-snapshot
Interconnection Allocation Between Functional Units and Registers in High-Level Synthesis
inferred← citeshttps://doi.org/10.1109/vdat.2009.5158164openalex-snapshot
On the complexity of the Port Assignment Problem for Binary Commutative Operators in high-level synthesis
inferred← citeshttps://doi.org/10.1109/vlsi-dat.2012.6212613openalex-snapshot
Port assignment for interconnect reduction in high-level synthesis
inferred← citeshttps://doi.org/10.1145/1233501.1233648openalex-snapshot
Platform-based resource binding using a distributed register-file microarchitecture
inferred← citeshttps://doi.org/10.1145/127601.127741openalex-snapshot
Relevant issues in high-level connectivity synthesis
inferred← citeshttps://doi.org/10.1145/1403375.1403629openalex-snapshot
Simultaneous FU and register binding based on network flow method
inferred← citeshttps://doi.org/10.1145/1529255.1529257openalex-snapshot
Simultaneous resource binding and interconnection optimization based on a distributed register-file microarchitecture
inferred← citeshttps://doi.org/10.1145/157485.164929openalex-snapshot
Estimating architectural resources and performance for high-level synthesis applications
inferred← citeshttps://doi.org/10.1145/1629911.1630125openalex-snapshot
FPGA-targeted high-level binding algorithm for power and area reduction with glitch-estimation
inferred← citeshttps://doi.org/10.1145/1687399.1687527openalex-snapshot
Memory organization and data layout for instruction set extensions with architecturally visible storage
inferred← citeshttps://doi.org/10.1145/217474.217561openalex-snapshot
Data path allocation for synthesizing RTL design with low BIST area overhead
inferred← citeshttps://doi.org/10.1145/871506.871541openalex-snapshot
Low-power high-level synthesis for FPGA architectures
inferred← citeshttps://doi.org/10.2197/ipsjtsldm.2.43openalex-snapshot
Binding Refinement for Multiplexer Reduction
inferred← citeshttps://doi.org/10.5555/1015090.1015109openalex-snapshot
Register binding and port assignment for multiplexer optimization
inferred← citeshttps://doi.org/10.5555/1326073.1326109openalex-snapshot
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
inferred← citeshttps://doi.org/10.5555/1899721.1899885openalex-snapshot
A high-level synthesis flow for custom instruction set extensions for application-specific processors
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.