Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
Last revisionBoth sides next revision
lectures [2017-11-10] – external edit 127.0.0.1lectures [2023-07-28] – Fall 2023 Martin Ziegler
Line 1: Line 1:
-====== Selected Lectures evolving around the Theory of (Real) Computation======+====== List of Recent Lectures ======
  
-  * Spring 2017: [[https://complexity.kaist.ac.kr/17CS500|Design and Analysis of Algorithms]] (lecture) +  * Fall 2023: [[https://kaist.theoryofcomputation.asia/23cs422|Theory of Computing]], [[https://theoryofcomputation.asia/23cs492|세상의 미래]] 
-  * Fall 2016: [[https://complexity.kaist.ac.kr/16CS700|Algorithmic Foundations of Numerics]] (lecture) +  * Spring 2023: [[https://kaist.theoryofcomputation.asia/23cs500|Design and Analysis of Algorithms]]  
-  * Spring 2016: [[https://complexity.kaist.ac.kr/16CS500|Design and Analysis of Algorithms]] (lecture) +  * Fall 2022: [[https://kaist.theoryofcomputation.asia/22cs300|Introduction  to Algorithms]]  
-  * Fall 2015: [[https://complexity.kaist.ac.kr/15b_CS422|Theory of Computation]] (lecture)+  * Fall 2022: [[https://kaist.theoryofcomputation.asia/22cs492|Foundations of VR/AI/MMORPGs]]  
 +  * Fall 2021: [[https://kaist.theoryofcomputation.asia/21cs300|Introduction  to Algorithms]] (online lecture)  
 +  * Fall 2021: [[https://kaist.theoryofcomputation.asia/21cs422|Theory of Computing]] (online lecture) 
 +  * Spring 2021: [[https://kaist.theoryofcomputation.asia/21cs300a|Introduction  to Algorithms]] (online lecture) 
 +  * Fall 2020: [[https://kaist.theoryofcomputation.asia/20cs700|Computer Science of Continuous Data:Algorithmic Foundation of Numerics]] (online lecture) 
 +  * Spring 2020: [[https://kaist.theoryofcomputation.asia/20cs500|Design and Analysis of Algorithms]] (online lecture) 
 +  * Spring 2019: [[https://kaist.theoryofcomputation.asia/19cs422|Theory of Computation]] (lecture) 
 +  * Fall 2018: [[https://kaist.theoryofcomputation.asia/18CS204b|Discrete Mathematics for Computer Science]] (lecture) 
 +  * Fall 2018: [[https://kaist.theoryofcomputation.asia/18CS300|Introduction to Algorithms]] (lecture) 
 +  * Summer 2018: [[https://kaist.theoryofcomputation.asia/18CS493|Algorithmic Foundations of Numerics]] (summer school) 
 +  * Spring 2018: [[https://kaist.theoryofcomputation.asia/18CS500|Design and Analysis of Algorithms]] (lecture) 
 +  * Spring 2018: [[https://kaist.theoryofcomputation.asia/18CS204c|Discrete Mathematics for Computer Science]] (lecture) 
 +  * Spring 2018: [[http://realcomplexity.de/18CS408/|Tensor Calculus in Exact Real Computation]] (capstone programming) 
 +  * Fall 2017: [[lectures:2017:CS204|Discrete Mathematics]] (lecture) 
 +  * Fall 2017: [[https://theoryofcomputation.asia/17CS422|Theory of Computation]] (lecture) 
 +  * Spring 2017: [[https://kaist.theoryofcomputation.asia/17CS500|Design and Analysis of Algorithms]] (lecture) 
 +  * Fall 2016: [[https://theoryofcomputation.asia/16CS700|Algorithmic Foundations of Numerics]] (lecture) 
 +  * Spring 2016: [[https://kaist.theoryofcomputation.asia/16CS500|Design and Analysis of Algorithms]] (lecture) 
 +  * Fall 2015: [[https://theoryofcomputation.asia/15CS422/|Theory of Computation]] (lecture)
   * Spring 2015: [[https://www.tucan.tu-darmstadt.de/scripts/mgrqcgi?APPNAME=CampusNet&PRGNAME=COURSEDETAILS&ARGUMENTS=-N000000000000001,-N000334,-N0,-N356546217153706,-N356546217143707,-N0,-N0,-N0|Computability in Analysis]] (lecture+tutorial, 2+1h/week, held by [[http://www.mathematik.tu-darmstadt.de/~mschroeder|Dr. Matthias Schröder]])   * Spring 2015: [[https://www.tucan.tu-darmstadt.de/scripts/mgrqcgi?APPNAME=CampusNet&PRGNAME=COURSEDETAILS&ARGUMENTS=-N000000000000001,-N000334,-N0,-N356546217153706,-N356546217143707,-N0,-N0,-N0|Computability in Analysis]] (lecture+tutorial, 2+1h/week, held by [[http://www.mathematik.tu-darmstadt.de/~mschroeder|Dr. Matthias Schröder]])
-  * Spring 2015: [[https://complexity.kaist.ac.kr/15a_ComplexityInAnalysis|Computational Complexity in Analysis]] (lecture+tutorial, 2+1h/week)+  * Spring 2015: [[https://kaist.theoryofcomputation.asia/15a_ComplexityInAnalysis|Computational Complexity in Analysis]] (lecture+tutorial, 2+1h/week)
   * Fall 2014: [[http://www3.mathematik.tu-darmstadt.de/evs/1037|Nonuniform Complexity Theory]] (seminar, 2h/week)   * Fall 2014: [[http://www3.mathematik.tu-darmstadt.de/evs/1037|Nonuniform Complexity Theory]] (seminar, 2h/week)
   * Spring 2014: [[http://www3.mathematik.tu-darmstadt.de/evs/1033|Algebraic Complexity Theory]] (lecture+tutorial, 2+1h/week)   * Spring 2014: [[http://www3.mathematik.tu-darmstadt.de/evs/1033|Algebraic Complexity Theory]] (lecture+tutorial, 2+1h/week)
Line 25: Line 43:
   * Spring 2008: [[http://www2.cs.upb.de/cs/ag-madh/WWW/Teaching/2008SS/Komplex/|Complexity Theory]] (lecture+tutorial, 2+1h/week)   * Spring 2008: [[http://www2.cs.upb.de/cs/ag-madh/WWW/Teaching/2008SS/Komplex/|Complexity Theory]] (lecture+tutorial, 2+1h/week)
  
 +See also our [[https://www.youtube.com/channel/UCSehZy20EPRqgV0uiTzJkEA|YouTube-Channel]]...