A fast algorithm for context-aware buffer insertion

No abstract is available for this paper.

• Publication year

  2002

• Venue

  TODE

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/504914.504922
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Simultaneous buffer insertion and wire sizing considering systematic CMP variation and random leff variation

  2005cited by this paper
• A fast algorithm for context-aware buffer insertion

  2000cited by this paper
• Simultaneous routing and buffer insertion with restrictions on buffer locations

  1999influential reference
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• The shortest route problem with constraints

  1966cited by this paper
• The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers

  1948cited by this paper

• Cost reduction in bottom‐up hierarchical‐based VLSI floorplanning designs

  2015cites this paper
• Buffer sizing for clock networks using robust geometric programming considering variations in buffer sizes

  2013cites this paper
• Variable-Order Ant System for VLSI multiobjective floorplanning

  2013cites this paper
• Hierarchical congregated ant system for bottom-up VLSI placements

  2013cites this paper
• PPTP: Pre-Post Terminal Propagation in modern fixed-outline soft module VLSI floorplanning design

  2012cites this paper
• Algorithms for the scaling toward nanometer VLSI physical synthesis

  2007cites this paper
• Tree optimization and synthesis techniques with applications in automated design of integrated circuits

  2004cites this paper
• Fast and flexible buffer trees that navigate the physical layout environment

  2004cites this paper
• Fixed-outline floorplanning: enabling hierarchical design

  2003cites this paper
• Spec based flip-flop and buffer insertion

  2003cites this paper
• Creating and exploiting flexibility in rectilinear Steiner trees

  2003cites this paper
• Buffered routing tree construction under buffer placement blockages

  2002cites this paper
• Buffer insertion with adaptive blockage avoidance

  2002cites this paper
• Buffer tree synthesis with consideration of temporal locality, sink polarity requirements, solution cost and blockages

  2002cites this paper
• Fundamental algorithms for physical design planning of VLSI

  2002influential citation
• Buffer Insertion with Adaptive Blockage Avoidance [ Extended

  2002cites this paper
• A new algorithm for routing tree construction with buffer insertion and wire sizing under obstacle constraints

  2001cites this paper
• Creating and exploiting flexibility in Steiner trees

  2001cites this paper
• A fast algorithm for context-aware buffer insertion

  2000cites this paper