A probability-based approach to VLSI circuit partitioning
- 24 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A probability-based approach to VLSI circuit partitioningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- New faster Kernighan-Lin-type graph-partitioning algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast spectral methods for ratio cut partitioning and clusteringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A fast algorithm for performance-driven placementPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A general framework for vertex orderings with applications to circuit clusteringIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1996
- Spectral Partitioning: The More Eigenvectors, The BetterProceedings of the 39th conference on Design automation - DAC '02, 1995
- Partitioning very large circuits using analytical placement techniquesPublished by Association for Computing Machinery (ACM) ,1994
- An Improved Min-Cut Algonthm for Partitioning VLSI NetworksIEEE Transactions on Computers, 1984
- A Linear-Time Heuristic for Improving Network PartitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- A proper model for the partitioning of electrical circuitsPublished by Association for Computing Machinery (ACM) ,1972