Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm
暂无分享,去创建一个
Roberto Battiti | Sergei L. Bezrukov | R. Battiti | S. Bezrukov | A. Ertu¨rk | H. N. O ¨ Zgu¨ven | E. Budak
[1] Shantanu Dutt,et al. VLSI circuit partitioning by cluster-removal using iterative improvement techniques , 1996, Proceedings of International Conference on Computer Aided Design.
[2] Roberto Battiti,et al. Differential greedy for the 0-1 equicut problem , 1997, Network Design: Connectivity and Facilities Location.
[3] Roberto Battiti,et al. Randomized greedy algorithms for the hypergraph partitioning problem , 1997, Randomization Methods in Algorithm Design.
[4] Sergei L. Bezrukov,et al. A new approach to Macaulay posets , 2004, J. Comb. Theory, Ser. A.
[5] Baldomir Zajc,et al. Multi-way Netlist Partitioning into Heterogeneous FPGAs and Minimization of Total Device Cost and Interconnect , 1994, 31st Design Automation Conference.
[6] Shashi Shekhar,et al. Partitioning Similarity Graphs: A Framework for Declustering Problems , 1996, Inf. Syst..
[7] Shashi Shekhar,et al. Multilevel hypergraph partitioning: applications in VLSI domain , 1999, IEEE Trans. Very Large Scale Integr. Syst..
[8] Robert Elsässer,et al. The Spider Poset Is Macaulay , 2000, J. Comb. Theory, Ser. A.
[9] Sergei L. Bezrukov. On an equivalence in discrete extremal problems , 1999, Discret. Math..
[10] Dennis W. Shaklee,et al. Proceedings of the 25th ACM/IEEE Design Automation Conference , 1988, DAC 1988.
[11] Jaideep Srivastava,et al. Web Mining: Pattern Discovery from World Wide Web Transactions , 1996 .
[12] S. Bezrukov. Edge Isoperimetric Problems on Graphs , 2007 .
[13] Uwe Leck. Optimal shadows and ideals in submatrix orders , 2001, Discret. Math..
[14] Thomas Lengauer,et al. Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.
[15] Jaeseok Kim,et al. An Efficient Method of Partitioning Circuits for Multiple-FPGA Implementation. , 1993, 30th ACM/IEEE Design Automation Conference.
[16] Andrew B. Kahng,et al. Recent directions in netlist partitioning: a survey , 1995, Integr..
[17] Fillia Makedon,et al. Circuit partitioning into small sets: a tool to support testing with further applications , 1991, Proceedings of the European Conference on Design Automation..
[18] Chung-Kuan Cheng,et al. Circuit Partitioning for Huge Logic Emulation Systems , 1994, 31st Design Automation Conference.
[19] Krzysztof Kozminski,et al. Cost Minimization of Partitions into Multiple Devices , 1993, 30th ACM/IEEE Design Automation Conference.
[20] Baldomir Zajc,et al. A unified cost model for min-cut partitioning with replication applied to optimization of large heterogeneous FPGA partitions , 1994, EURO-DAC '94.
[21] S. Dutt,et al. A probability-based approach to VLSI circuit partitioning , 1996, 33rd Design Automation Conference Proceedings, 1996.
[22] Roberto Battiti,et al. Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning , 1999, IEEE Trans. Computers.
[23] Thomas A. Carlson. The edge-isoperimetric problem for discrete tori , 2002, Discret. Math..