On the public citation graph
Retiming revisited and reversed
0 signed · 70 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/43.184852openalex-snapshot
Computing the initial states of retimed circuits
inferredcites →https://doi.org/10.1109/43.275352openalex-snapshot
Symbolic model checking for sequential circuit verification
inferredcites →https://doi.org/10.1109/43.62792openalex-snapshot
Synchronous logic synthesis: algorithms for cycle-time minimization
inferredcites →https://doi.org/10.1109/43.62793openalex-snapshot
Retiming and resynthesis: optimizing sequential networks with combinational techniques
inferredcites →https://doi.org/10.1109/dac.1995.249966openalex-snapshot
The Validity of Retiming Sequential Circuits
inferredcites →https://doi.org/10.1109/iccad.1992.279320openalex-snapshot
Performance optimization of sequential circuits by eliminating retiming bottlenecks
inferredcites →https://doi.org/10.1109/iccd.1994.331965openalex-snapshot
In the driver's seat of BooleDozer
inferredcites →https://doi.org/10.1109/iscas.1989.100747openalex-snapshot
Combinational profiles of sequential benchmark circuits
inferredcites →https://doi.org/10.1109/test.1992.527801openalex-snapshot
A small test generator for large designs
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-44585-4_10openalex-snapshot
Transformation-Based Verification Using Generalized Retiming
inferred← citeshttps://doi.org/10.1007/3-540-44798-9_11openalex-snapshot
Register Transformations with Multiple Clock Domains
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_27openalex-snapshot
On Some Transformation Invariants Under Retiming and Resynthesis
inferred← citeshttps://doi.org/10.1007/bf02960770openalex-snapshot
Variables bounding based retiming algorithm
inferred← citeshttps://doi.org/10.1016/s0167-9260(97)00002-3openalex-snapshot
Retiming: Theory and practice
inferred← citeshttps://doi.org/10.1109/43.806805openalex-snapshot
Optimal FPGA mapping and retiming with efficient initial state computation
inferred← citeshttps://doi.org/10.1109/43.908455openalex-snapshot
Theory of safe replacements for sequential circuits
inferred← citeshttps://doi.org/10.1109/92.661250openalex-snapshot
Efficient retiming of large circuits
inferred← citeshttps://doi.org/10.1109/apccas.2000.913558openalex-snapshot
An adaptive algorithm for computing the initial states of retimed circuits
inferred← citeshttps://doi.org/10.1109/aspdac.2005.1466506openalex-snapshot
Deriving a new efficient algorithm for min-period retiming
inferred← citeshttps://doi.org/10.1109/aspdac.2005.1466515openalex-snapshot
A practical cut-based physical retiming algorithm for field programmable gate arrays
inferred← citeshttps://doi.org/10.1109/aspdac.2007.358042openalex-snapshot
Clock Skew Scheduling with Delay Padding for Prescribed Skew Domains
inferred← citeshttps://doi.org/10.1109/aspdac.2010.5419917openalex-snapshot
iRetILP: An efficient incremental algorithm for min-period retiming under general delay model
inferred← citeshttps://doi.org/10.1109/dac.1997.597107openalex-snapshot
An Improved Algorithm For Minimum-area Retiming
inferred← citeshttps://doi.org/10.1109/dac.1999.781318openalex-snapshot
A practical approach to multiple-class retiming
inferred← citeshttps://doi.org/10.1109/dac.2006.229416openalex-snapshot
An efficient retiming algorithm under setup and hold constraints
inferred← citeshttps://doi.org/10.1109/date.1999.761198openalex-snapshot
Retiming sequential circuits with multiple register classes
inferred← citeshttps://doi.org/10.1109/date.2003.1253700openalex-snapshot
Performance-directed retiming for FPGAs using post-placement delay information
inferred← citeshttps://doi.org/10.1109/date.2009.5090778openalex-snapshot
Multi-domain clock skew scheduling-aware register placement to optimize clock distribution network
inferred← citeshttps://doi.org/10.1109/edtc.1997.582337openalex-snapshot
Fast controllers for data dominated applications
inferred← citeshttps://doi.org/10.1109/famcad.2007.31openalex-snapshot
Fast Minimum-Register Retiming via Binary Maximum-Flow
inferred← citeshttps://doi.org/10.1109/fmcad.2009.5351122openalex-snapshot
Retiming and resynthesis with sweep are complete for sequential transformation
inferred← citeshttps://doi.org/10.1109/icaecc.2014.7002437openalex-snapshot
The FPGA based emulation of complex SoC for ADAS market on ZeBu-Server
inferred← citeshttps://doi.org/10.1109/iccad.1996.571329openalex-snapshot
The case for retiming with explicit reset circuitry
inferred← citeshttps://doi.org/10.1109/iccad.1997.643523openalex-snapshot
Minimum area retiming with equivalent initial states
inferred← citeshttps://doi.org/10.1109/iccad.2001.968615openalex-snapshot
Min-area retiming on flexible circuit structures
inferred← citeshttps://doi.org/10.1109/iccad.2003.159768openalex-snapshot
Multi-domain clock skew scheduling
inferred← citeshttps://doi.org/10.1109/iccad.2004.1382619openalex-snapshot
Optimal wire retiming without binary search
inferred← citeshttps://doi.org/10.1109/icvd.1999.745183openalex-snapshot
Optimal retiming for initial state computation
inferred← citeshttps://doi.org/10.1109/tcad.2005.858268openalex-snapshot
Optimal wire retiming without binary search
inferred← citeshttps://doi.org/10.1109/tcad.2006.882520openalex-snapshot
Retiming and Resynthesis: A Complexity Perspective
inferred← citeshttps://doi.org/10.1109/tcad.2010.2041845openalex-snapshot
Pulse Width Allocation and Clock Skew Scheduling: Optimizing Sequential Circuits Based on Pulsed Latches
inferred← citeshttps://doi.org/10.1109/tcad.2011.2182352openalex-snapshot
Efficient Retiming of Multirate DSP Algorithms
inferred← citeshttps://doi.org/10.1109/tvlsi.2005.862726openalex-snapshot
Wire retiming as fixpoint computation
inferred← citeshttps://doi.org/10.1145/1120725.1120774openalex-snapshot
Deriving a new efficient algorithm for min-period retiming
inferred← citeshttps://doi.org/10.1145/1120725.1120783openalex-snapshot
A practical cut-based physical retiming algorithm for field programmable gate arrays
inferred← citeshttps://doi.org/10.1145/1146909.1147149openalex-snapshot
An efficient retiming algorithm under setup and hold constraints
inferred← citeshttps://doi.org/10.1145/1297666.1297673openalex-snapshot
A new efficient retiming algorithm derived by formal manipulation
inferred← citeshttps://doi.org/10.1145/1391469.1391603openalex-snapshot
An efficient incremental algorithm for min-area retiming
inferred← citeshttps://doi.org/10.1145/1391469.1391604openalex-snapshot
Scalable min-register retiming under timing and initializability constraints
inferred← citeshttps://doi.org/10.1145/266021.266025openalex-snapshot
An improved algorithm for minimum-area retiming
inferred← citeshttps://doi.org/10.1145/277044.277139openalex-snapshot
Optimal FPGA mapping and retiming with efficient initial state computation
inferred← citeshttps://doi.org/10.1145/307418.307582openalex-snapshot
Retiming sequential circuits with multiple register classes
inferred← citeshttps://doi.org/10.1145/309847.309920openalex-snapshot
A practical approach to multiple-class retiming
inferred← citeshttps://doi.org/10.1147/rd.414.0515openalex-snapshot
Design methodology for the S/390 Parallel Enterprise Server G4 microprocessors
inferred← citeshttps://doi.org/10.21236/ada603903openalex-snapshot
Integration of Physical Design and Sequential Optimization
inferred← citeshttps://doi.org/10.31274/rtd-180813-4997openalex-snapshot
Fast algorithms for retiming large digital circuits
inferred← citeshttps://doi.org/10.3923/itj.2007.325.331openalex-snapshot
Optimizing CMOS Circuits for Performance Improvements Using Adiabatic Logic
inferred← citeshttps://doi.org/10.5555/1874620.1874824openalex-snapshot
Multi-domain clock skew scheduling-aware register placement to optimize clock distribution network
inferred← citeshttps://doi.org/10.5555/1899721.1899735openalex-snapshot
iRetILP: an efficient incremental algorithm for min-period retiming under general delay model
inferred← citeshttps://doi.org/10.5555/244522.244523openalex-snapshot
Logic optimization by output phase assignment in dynamic logic synthesis
inferred← citeshttps://doi.org/10.5555/244522.244936openalex-snapshot
The case for retiming with explicit reset circuitry
inferred← citeshttps://doi.org/10.5555/266388.266474openalex-snapshot
Minimum area retiming with equivalent initial states
inferred← citeshttps://doi.org/10.5555/603095.603131openalex-snapshot
Min-area retiming on flexible circuit structures
inferred← citeshttps://doi.org/10.5555/787260.787641openalex-snapshot
Fast controllers for data dominated applications
inferred← citeshttps://doi.org/10.5555/789083.1022818openalex-snapshot
Performance-Directed Retiming for FPGAs Using Post-Placement Delay Information
inferred← citeshttps://doi.org/10.5555/996070.1009980openalex-snapshot
Multi-Domain Clock Skew Scheduling
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.