Fall 2003
| Handouts |
| Teaching Staff |
| Assignments |
| Announcement from FAS Computer Services: The Instructor's Toolkit and all course Web pages will be unavailable from 4am to 8am, Tuesday, February 3, for a systems upgrade. We apologize for the inconvenience. |
Computer Science 224r
Randomness in Computation
Michael Rabin
| Location: Maxwell Dworkin G-115 |
| Meeting time: TTh 11:30-1:00 |
| Exam group: 13, 14 |
| Catalog number: 3380 |
| The surprising efficacy of randomization in the solution of algorithmic and computer science problems. Applications include number theory, cryptography, finite fields, computational geometry, routing, parallel algorithms, pattern matching, distributed systems, self-checking programs, probabilistically checkable proofs. |
| The FIRST SECTION (on abstract algebra) will take place from 6-8pm on Wednesday, September 24th, in Maxwell-Dworkin room 221.
Basic course information (including a tentative syllabus): PS, PDF Hear Donald Knuth's thoughts on randomized algorithms: MP3 |
URL: http://www.courses.fas.harvard.edu/~cs224r/
Last modified: 09/23/2003 Instructor's Toolkit
Copyright ©The President and Fellows of Harvard College