ACM Home Page
Please provide us with feedback. Feedback
Acyclic multi-way partitioning of Boolean networks
Full text PdfPdf (65 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 31st annual Design Automation Conference table of contents
San Diego, California, United States
Pages: 670 - 675  
Year of Publication: 1994
ISBN:0-89791-653-0
Authors
Jason Cong  Department of Computer Science, University of California, Los Angeles, CA
Zheng Li  Department of Computer Science, University of California, Los Angeles, CA
Rajive Bagrodia  Department of Computer Science, University of California, Los Angeles, CA
Sponsors
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
EDAC : Electronic Design Automation Consortium
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 14,   Citation Count: 19
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/196244.196609
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
Ba82
Barnes, E. R., "An Algorithm for Partitioning the Nodes of a Graph," SIAM J. Alg. Disc. Math., Vol. 3, pp. 541-550, 1982.
 
BaLi94
 
BeSa93
Beardslee, M. and A. Sangiovanni-Vincentelli, "Heuristic Methods for Communication-Based Logic Partitioning," 4th ACM/SIGDA Physical Design Workshop, pp. 199-210, April 1993.
 
Bo87
Boppana, R., "Eigenvalues and Graph Bisection: An Average-Case Analysis," IEEE Symp. on Foundations of Computer Science, pp. 280-285, 1987.
ChSZ93
CoDi93
 
CoHK91
Cong, J., L. Hagen, and A. Kahng, "Random Walks for Circuit Clustering," IEEE 4th Int'l ASIC Conf., pp. P14-2.1, Sept. 1991.
 
CoHK92
CoSm93
 
FiMa82
 
HaKa91
Hagen, L. and A. B. Kahng, "Fast spectral methods for ratio cut partitioning and clustering," Proc. ICCAD-91, pp. 10--13, 1991.
 
HaKa92
 
HaKa92b
Hagen, L. and A. B. Kahng, "New Spectral Methods for Ratio Cut Partitioning and Clustering," IEEE Trans. on CAD, pp. 1074-1085, Sept. 1992.
 
HwGa92
 
ImPF93
Iman, S., M. Pedram, C. Fabian, and J. Cong, "Finding Uni-Directional Cuts Based on Physical Partitioning and Logic Restructuring," 4th ACM/SIGDA Physical Design Workshop, pp. 187- 198, April 1993.
 
KeLi70
Kernighan, B. and S. Lin, "An Efficient Heuristic Procedure for Partitioning of Electrical Circuits," Bell System Technical J., Feb. 1970.
 
KiGV83
Kirkpatrick, S., C. D. Gelat, and M. P. Vecchi, Jr., "Optimization by Simulated Annealing," Science, Vol. 220, pp. 671-680, May, 1983.
 
Kr84
Krishnamurthy, B., "An Improved Min-Cut Algorithm for Partitioning VLSI Networks," IEEE Trans. on Computers, Vol. 33, pp. 438-446, 1984.
 
KrNe91
Kring, C. and A. R. Newton, "A Cell-Replicating Approach to Mincu-Based Circuit Partitioning," IEEE Int'l Conf. on Computer-Aided Design, pp. 2-5, Nov. 1991.
 
Sa89
 
WeCh89
Wei, Y. and C. Cheng, "Towards Efficient Hierarchical Designs by Ratio Cut Partitioning," IEEE Intl. Conf. on Computer-Aided Design, pp. 298-301, Nov. 1989.
 
YeCL92

CITED BY  19

Collaborative Colleagues:
Jason Cong: colleagues
Zheng Li: colleagues
Rajive Bagrodia: colleagues