|
|
|
|
|
Courses and Seminars \ Dana MoshkovitzCS331: Algorithms and Complexity, UT Austin, Fall 2024. CS388T: Theory of Computation, UT Austin, Spring 2024. CS331: Algorithms and Complexity, UT Austin, Fall 2023. CS331: Algorithms and Complexity, UT Austin, Spring 2023. CS388T: Theory of Computation, UT Austin, Fall 2022. CS331: Algorithms and Complexity, UT Austin, Spring 2022. CS378/395T: Approximation Algorithms and Complexity, UT Austin, Fall 2021. CS331: Algorithms and Complexity, UT Austin, Spring 2021. CS395T: Approximability, UT Austin, Fall 2020. CS388T: Theory of Computation (graduate class), UT Austin, Spring 2020. CS331: Algorithms and Complexity, UT Austin, Fall 2019. CS331: Algorithms and Complexity, UT Austin, Spring 2018. CS395T: Approximability, UT Austin, Fall 2018. CS331: Algorithms and Complexity, UT Austin, Spring 2017. CS395T: Approximability, UT Austin, Fall 2016. 6.841 Advanced Complexity Theory, MIT, Spring 2016. 6.046 Design and Analysis of Algorithms, MIT, Fall 2015. 6.841 Advanced Complexity Theory, MIT, Spring 2015. 6.046 Design and Analysis of Algorithms, MIT, Fall 2014. 6.UAT, Undergraduate communication, MIT, Fall 2013. 6.841 Advanced Complexity Theory, MIT, Fall 2012. 6.046 Design and Analysis of Algorithms, MIT, Spring 2012. Teaching award! 6.440 Essential Coding Theory, MIT, Fall 2011. 6.046 Design and Analysis of Algorithms, MIT, Spring 2011. 6.895 PCP and Hardness of Approximation, MIT, Fall 2010. Mini-course on Projection PCPs, Princeton, Spring 2009. Probabilistically Checkable Proofs, Weizmann, Spring 2008. Students’ Theory seminar, Weizmann, 2005-2008. |