Design and Analysis of Algorithms: Course Notes
| dc.contributor.author | Khuller, Samir | en_US |
| dc.date.accessioned | 2004-05-31T22:23:42Z | |
| dc.date.available | 2004-05-31T22:23:42Z | |
| dc.date.created | 1993-08 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | These are my lecture notes from CMSC 651: Design and Analysis of Algorithms}, a one semester course that I taught at University of Maryland in the Spring of 1993. The course covers core material in algorithm design, and also helps students prepare for research in the field of algorithms. The reader will find an unusual emphasis on graph theoretic algorithms, and for that I am to blame. The choice of topics was mine, and is biased by my personal taste. The material for the first few weeks was taken primarily from the (now not so new) textbook on Algorithms by Cormen, Leiserson and Rivest. A few papers were also covered, that I personally feel give some very important and useful techniques that should be in the toolbox of every algorithms researcher. (Also cross-referenced as UMIACS-TR-93-72) | en_US |
| dc.format.extent | 675408 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/592 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3113 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-93-72 | en_US |
| dc.title | Design and Analysis of Algorithms: Course Notes | en_US |
| dc.type | Technical Report | en_US |