Reading for CS137a

@Book{gerez_vlsida99,
  author = 	 {Sabih H. Gerez},
  title = 	 {Alagorithms for VLSI Design Automation},
  publisher = 	 {John Wiley \& Son Ltd},
  year = 	 {1999},
  note = {Optional text: general reference and background material,
          Day 14 required p. 133-166}
}

@BOOK{devadas_logic_synth94,
	AUTHOR = {Srinivas Devadas and Abhijit Ghosh and Kurt Keutzer},
	TITLE = {Logic Synthesis},
	PUBLISHER = {McGraw-Hill},
	YEAR = {1994},
	ADDRESS = {New York},
        note={Day  2 required p. 190--198 (section 7.8),
              Day 16 required p. 59--91 (chapter 4), 
              Day 17 required p. 151--184 (7-7.7),
              Day 17 supplemntal (chapter 6--8),
              canonical reference text for logic synthesis}         
}

@InProceedings{dagon_dac87,
  author={Kurt Keutzer},
  title={DAGON: Technology Binding and Local Optimization by DAG Matching},
  booktitle={Proceedings of the 24th ACM/IEEE Design Automation Conference (DAC)},
  year=1987,
  pages={341--347},
  note={Day 2 supplemental -- this is the canonical paper, but not the best tutorial}
}

ACM Twig link

@Article{flowmap_trcad94,
  author = 	 {Jason Cong and Yuzheng Ding},
  title = 	 {FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimization in Lookup-Table Based FPGA Designs},
  journal = 	 {IEEE Transactions on Computer-Aided Design},
  year = 	 1994,
  volume =	 13,
  number =	 1,
  month =	 {January},
  pages =	 {1-12},
  note = {Day 4 required}
}

@Article{lut_area_depth_tr_on_vlsi_systems94,
  author = 	 {Jason Cong and Yuzheng Ding},
  title = 	 {On Area/Depth Trade-Off in LUT-Based FPGA Technology Mapping},
  journal = 	 {IEEE Transactions on VLSI Design},
  year = 	 1994,
  volume =	 2,
  number =	 2,
  month =	 {June},
  pages =	 {137-148},
  note = {Day 4 optional/supplemental}
}

@INPROCEEDINGS{fmpart_dac92,
	AUTHOR = {C. M. Fiduccia and R. M. Mattheyses},
	TITLE = {A Linear Time Heuristic for Improving Network Partitions},
	BOOKTITLE = {Proceedings of the 19th Design Automation Conference},
	YEAR = {1982},
	PAGES = {175-181},
        note = {Day 6 required}      
}

@Article{alpert_bipartioning_survey,
  author = 	 {Charles Alpert and A. B. Kahng},
  title = 	 {Recent Directions in Netlist Partitioning:  A Survey},
  journal = 	 {Integration:  the VLSI Journal},
  year = 	 1995,
  volume =	 19,
  number =	 {1--2},
  pages =	 {1--81},
  FTP =  {\urllink{http://vlsicad.cs.ucsd.edu/papers/journal/j20.pdf}},
  note = {Day 6 supplemental}
}

[PDF link]

@Article{hauck_bipartitioning_survey,
  author = 	 {Scott Hauck and Gaetano Borriello},
  title = 	 {An Evaluation of Bipartitioning Techniques},
  journal = 	 {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
  year = 	 1997,
  volume =	 16,
  number =	 8,
  pages =	 {849--866},
  month =	 {August},
  FTP = {\urllink{http://www.ee.washington.edu/people/faculty/hauck/publications/PartitionJ.pdf}}
}

[PDF link]

@Misc{metis_pubs_online,
  title = 	 {METIS Publication List},
  howpublished = {\urllink{http://www-users.cs.umn.edu/~karypis/metis/publications/main.html}}
}

[Link]

@InProceedings{hauck_replicate_part_iccad97,
  author = 	 {Morgan Enos and Scott Hauck and Majid Sarrafzadeh},
  title = 	 {Replication for Logic Bipartitioning},
  booktitle ={Proceedings of the International Conference on Computer-Aided Design},
  pages = {342--349},
  FTP =  {\urllink{http://www.ece.nwu.edu/~hauck/publications/ICCADreplicate.pdf} },
  year = 1997,
  note={Day 6 supplemental}
}

[PDF link]

@Article{hall_quadratic_placement_ms70,
  author = 	 {Kenneth M. Hall},
  title = 	 {An $r$-dimensional Quadratic Placement Algorithm},
  journal = 	 {Managment Science},
  year = 	 1970,
  volume =	 17,
  number =	 3,
  month =	 {November},
  pages =	 {219--229},
  note = {Day 7 required}      
}

@book{clr_algorithms90,
  author={Thomas Cormen and Charles Leiserson and Ronald Rivest},
  title={Introduction to Algorithms},
  year=1990,
  publisher={MIT Press},
  note={Day 7 required p579--599, general reference for algorithms}

@InProceedings{fbb_iccad94,
  author = 	 {Honghua Yang and D. F. Wong},
  title = 	 {Efficient Network Flow Based Min-Cut Balanced Partitioning},
  booktitle = 	 {Proceedings of the IEEE International Conference on Computer-Aided Design},
  year = 	 1994,
  notes={Day 7 supplemental}
}

@InProceedings{boppana_focs87,
  author = 	 {Ravi Boppana},
  title = 	 {Eigenvalues and Graph Bisection:  An Average-case Analysis},
  booktitle = 	 {Proceedings of the 28th Annual Symposium on the Foundations of Computer Science},
  pages =	 {280--285},
  year =	 1987,
  note = {Day 7 supplemental}
}

@Book{hochbaum97,
  editor =	 {Dorit S. Hochbaum},
  title = 	 {Approximation Algorithms for NP-Hard Problems},
  publisher = 	 {PWS Publishing Company},
  year = 	 1997,
  note = {Day 7 supplemental, chapter 5 by Shmoys}
}

@Article{twoway_replcut_trcad95,
  author = 	 {Lung-Tien iu and Ming-Ter Kuo and Chung-Kuan Cheng and T. C. Hu},
  title = 	 {A Replication Cut for Two-Way Partitioning},
  journal = 	 {IEEE Transactions on Computer-Aided Design of Integerated Circuits and Systems},
  year = 	 1995,
  volume =	 14,
  number =	 5,
  pages =	 {623--630},
  month =	 {May},
  note = {Day 7 supplemental}
}

@Article{wong_replcut_trcad97,
  author = 	 {Wai-Kei and D. F. Wong},
  title = 	 {Minimum Replication Min-Cut Partitioning},
  journal = 	 {IEEE Transactions on Computer-Aided Design of Integerated Circuits and Systems},
  year = 	 1997,
  volume =	 16,
  number =	 10,
  pages =	 {1221--1227},
  month =	 {October},
  note = {Day 7 supplemental}
}

@Article{placement_acm_survey91,
  author = 	 {K. Shahookar and P. Mazumder},
  title = 	 {VLSI Cell Placement Techniques},
  journal = 	 {ACM Computing Surveys},
  year = 	 1991,
  volume =	 28,
  number =	 2,
  pages =	 {143--220},
  month =	 {June},
  note = {Day 8--10 supplemental}
}


@InProceedings{part_place_ispd97,
  author = 	 {D. J. Huang and A. B. Kahng},
  title = 	 {Partitioning-Based Standard-Cell Global Placement with an Exact
     Objective},
  booktitle = 	 {Proceedings of the ACM/IEEE International Symposium on Physical Design},
  pages =	 {18-25},
  year =	 1997,
  month =	 {April},
  FTP = \urllink{http://vlsicad.ucsd.edu/papers/conference/c66.pdf},
  note = {Day 8 required}
}

[PDF link]

@Book{sait_vlsipda97,
  author =	 {Sadiq Sait and Habib Youssef},
  title = 	 {VLSI Physical Design Automation: Theory and Pracice},
  publisher = 	 {McGraw Hill},
  year = 	 1997,
  note ={Day 8 supplemental p. 155-166, background reference for physical CAD}
}

@MISC{painless_cg94,
   AUTHOR = {Jonathan Richard Shewchuk},
   TITLE = {An Introduction to the Conjugate Gradient Method Without the
   Agonizing Pain},
   EDITION = {1.25},
   YEAR = {1994},
   FTP = \urllink{http://www.cs.utah.edu/~cs6220/Resources/painless-conjugate-gradient.pdf},
  note = {Day 9 required -- this is long, please, at least scan.}

[PDF Link]

@ARTICLE{kirkpatrick_science83,
	AUTHOR = {S. Kirkpatrik and C. D. {Gellatt, Jr.} and M. P. Vecchi},
	TITLE = {Optimization by Simulated Annealing},
	JOURNAL = {Science},
	YEAR = {1983},
	VOLUME = {220},
	NUMBER = {4598},
	PAGES = {671-680},
	MONTH = {May},
        note = {Day 9 required}
}

@Article{opt_pplace_trcad2000,
  author = 	 {A. E. Caldwell and Andrew B. Kahng and I. L. Markov},
  title = 	 {Optimal Partitioners and End-case Placers for Standard-cell Layout},
  journal = 	 {IEEE Transactions on Computer-Aided Design},
  year = 	 {2000},
  volume = 	 {19},
  number = 	 {11},
  pages = 	 {1304--1313},
  month = 	 {November},
  URL = \urllink{http://vlsicad.ucsd.edu/papers/journal/j46.pdf},
  note = {Day 10 required}
}

[PDF link]

@InProceedings{map_linplace_iccad97,
  author={Jinan Lou and Amir H. Salek and Massoud Pedram},
  title= {An Exact Solution to Simultaneous Technology Mapping and Linear Placement Problem for Trees},
   booktitle={Proceedings of the 1997 International Conference on
       Computer Aided Design (ICCAD'97)},
   month={November},
   year=1997,
   note={Day 10 maybe?}
}

@Article{intro_schd_dt95,
  author = 	 {Robert Walker and Samit Chaudhuri},
  title = 	 {Introduction to the Scheduling Problem},
  journal = 	 {IEEE Design and Test of Computers},
  year = 	 1995,
  volume =	 12,
  number =	 2,
  pages =	 {60--69},
  month =	 {Summer},
  note  = {Day 11+12 required}
}

@Article{mrcsbb_aiietr78,
  author = 	 {Joel Stinson and Edward Davis and Basheer Khumawala},
  title = 	 {Multiple Resource--Constrained Scheduling Using Branch and Bound},
  journal = 	 {AIIE Transactions},
  year = 	 1978,
  volume =	 10,
  number =	 3,
  pages =	 {252--259},
  month =	 {September},
  note  = {Day 11+12 required}

}

@InProceedings{left_edge_daw71,
  author={A. Hashimoto and J. Stevens},
  title={Wire Routing by Optimizing Channel Assignment with Large Apertures},
  booktitle={Proceedings of the 8th Design Automation Workshop},
  pages={155--169},
  year=1971,
  note={Day 13 supplemental}
  
}

@INPROCEEDINGS{pathfinder_fpga95,
	AUTHOR = {Larry McMurchie and Carl Ebling},
	TITLE = {PathFinder:  A Negotiation-Based Performance-Driven
                  Router for FPGAs},
	YEAR = {1995},
	BOOKTITLE = {Proceedings of the ACM/SIGDA International Symposium on  Field-Programmable Gate Arrays}, 
	ORGANIZATION = {ACM},
	MONTH = {February},
	PAGES = {111--117},
        URL = {\urllink{http://www.cs.washington.edu/research/projects/lis/www/papers/postscript/mcmurchie-FPGA95.ps}},
        note = {Day 14 required}

}

[PS Link]

@Article{twolevel_overview_intergration94,
  author={Olivier Coudert},
  title={Two-level Logic Minimization:  An Overview},
  journal={Integration, The VLSI Journal},
  volume=17,
  pages={97--140},
  year=1994,
  note={Day 16 optional}
  }

@Article{multilevel_synth_procieee90,
  author={Robert Brayton and G. D. Hachtel and Alberto Sangiovanni-Vincentelli},
  title={Multilevel Logic Synthesis},
  journal={Proceedings of the IEEE},
  volume=78,
  number=2,
  pages={264--300},
  month={February},
  year=1990,
  note={Day 17 supplemental}
  }

@ARTICLE{exact_state_assign_tcad91,
	AUTHOR = {Srinivas Devadas and A. Richard Newton},
	TITLE = {Exact Algorithms for Output Encoding, State Assignment,
	and Four-Level Boolean Minimization},
	JOURNAL = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
	YEAR = {1991},
	VOLUME = {10},
	NUMBER = {1},
	PAGES = {13--27},
	MONTH = {January},
        note={Day 18 required}

@ARTICLE{mustang_tcad,
	AUTHOR = {Srinivas Devadas and Hi-Keung Ma and A.R. Newton and Alberto Sangiovanni-Vincentelli},
	TITLE = {MUSTANG:  State Assignment of Finite State Machines Targeting Multilevel Logic Implementations},
	JOURNAL = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
	YEAR = {1988},
	VOLUME = {7},
	NUMBER = {12},
	PAGES = {1290-1300},
	MONTH = {December},
        note={Day 18 optional}
    
}

@INPROCEEDINGS{leiserson_retime83,
	AUTHOR = {Charles Leiserson and Flavio Rose and James Saxe},
	TITLE = {Optimizing Synchronous Circuitry by Retiming}, 
	BOOKTITLE = {Third Caltech Conference On VLSI},
	YEAR = {1993},
	MONTH = {March},
        note - {Day 19 required}
}

@InProceedings{pan_retime_lut_dac96,
  author = 	 {Peichen Pan and Chih-Chang Lin},
  title = 	 {Optimal Clock Period FPGA Technology Mapping for Sequential Circuits},
  booktitle = 	 {Proceedings of the 33rd Design Automation Conference (DAC)},
  pages =	 {720--725},
  year =	 1996,
  month =	 {June},
  note  = {probably required cs137b},
}

@InProceedings{pan_retime_lut_fpga98,
  author={Peichen Pan and Chih-Chang Lin},
  title={A New Retiming-based Technology Mapping Algorithm for LUT-based FPGAs},
  booktitle={Proceedings of the 1998 International Symposium on Field-Programmable Gate Arrays (FPGA'98)},
  year=1998
  pages={35--42},
  note  = {probably supplemental cs137b},
}

Delay-Optimal Technology Mapping by DAG Covering (1998)
Logic Decomposition during Technology Mapping (1995)
Simultaneous Logic Decomposition with Technology Mapping in FPGA Designs