scientific article; zbMATH DE number 1305406

MaRDI QIDQ4252287zbMATH OpenFDO

Authors Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins, Moses Charikar, Jon M. Kleinberg

Publication date 17 June 1999

zbMATH Keywords

VLSI design

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• Minimizing Wirelength in Zero and Bounded Skew Clock Trees
• Practical approximation algorithms for zero- and bounded-skew trees
• Practical approximation algorithms for zero- and bounded-skew trees

Cited in

(9)

• Elmor model-based algorithm to select optimal connections on the clock tree
• Skew minimization problem with possible sink displacement
• Using well-solvable minimum cost exact covering for VLSI clock energy minimization
• HEX: scaling honeycombs is easier than scaling clock trees
• Practical approximation algorithms for zero- and bounded-skew trees
• On the complexity of designing optimal branch-and-combine clock networks
• Minimizing Wirelength in Zero and Bounded Skew Clock Trees
• A single layer zero skew clock routing in X architecture
• Reliable buffered clock tree routing algorithm with process variation tolerance

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252287)