Use this page to maintain syllabus information, learning objectives, required materials, and technical requirements for the course. |

CS 58800 - Randomized Algorithms |
---|

Associated Term:
Spring 2024
Learning Outcomes: 1. Describe the main principles underlying the design and analysis of a randomized algorithm. 2. Explain concepts of randomized algorithms used in specific domains; e.g., graph-theory, number theory, and linear algebra problems. 3. Apply measure concentration results from probability theory to analyze a given randomized algorithm. 4. Determine the running times, failure probabilities, and accuracy guarantees of a randomized algorithm. 5. Apply learned design techniques and analysis tools to design and analyze new randomized algorithms. 6. Explain material from published research in the area of randomized algorithms using field-specific language. Required Materials: Technical Requirements: |

Return to Previous | New Search |