scientific article; zbMATH DE number 1538069

MaRDI QIDQ4518929zbMATH OpenFDO

Authors Rajat Kumar Pal

Publication date 3 December 2000

zbMATH Keywords

computational complexitydesign of algorithmsmulti-layer channel routing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computer science aspects of computer-aided design (68U07)

Recommendations

• Algorithmic aspects of VLSI layout.
• Nearly optimal algorithms and bounds for multilayer channel routing
• scientific article; zbMATH DE number 4077133
• scientific article; zbMATH DE number 4037776
• VLSI physical design. From graph partitioning to timing closure

Cited in

(8)

• Packet Routing: Complexity and Algorithms
• Algorithms – ESA 2004
• scientific article; zbMATH DE number 4077133 (Why is no real title available?)
• Direct routing: Algorithms and complexity
• scientific article; zbMATH DE number 3907789 (Why is no real title available?)
• Channel routing in a diagonal overlap model
• Hexagonal three-layer channel routing
• scientific article; zbMATH DE number 3893100 (Why is no real title available?)

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 Q4518929)