Corelab Seminar
2019-2020
Information
The Corelab Seminar is an informal seminar organized by the Computation and Reasoning Laboratory. Its scope encompasses all areas of Theoretical Computer Science, and it is open to undergraduate students, graduate students, and faculty members alike. Distinguished speakers are often invited to give lectures based on their recent work.
- When: On Mondays, at 17:00 (but check also the talk schedule below).
- Where: Room 1.1.31, School of Electrical & Computer Engineering, National Technical University of Athens.
If you wish to give a talk or be notified of upcoming talks, please send an e-mail either to , or to whoever is currently serving as Seminar manager (see sidebar).
Announcements
- [Sep 9th, 2019] Seminar begins. First talk is on Monday 9/11 at 17:00!
- [May 11th, 2020] The seminar will be held online (with Webex) on Mondays at 18:15, starting today.
Talks
| Date* | Speaker/Title |
|---|---|
| 2020 | |
| Jul 20th | Ioannis Panageas (SUTD) Depth-Width Trade-offs for Neural Networks through the lens of Dynamical Systems (abstract). |
| Jul 13th | Vasilis Kontonis (University of Wisconsin-Madison) Learning halfspaces with Massart noise under structured distributions (abstract). |
| Jul 6th | Loukas Kavouras (NTUA) Reallocating Multiple Facilities on the Line (abstract). |
| Jun 29th | Alkis Kalavasis (NTUA) Efficient Parameter Estimation of Truncated Boolean Product Distributions (abstract). |
| Jun 22nd | Emmanouil-Vasileios Vlatakis-Gkaragkounis (Columbia University) Smoothed complexity of local Max-Cut and binary Max-CSP (abstract). |
| Jun 15th | Stratis Skoulakis (Singapore University of Technology and Design) The Online Min Sum Set Cover (abstract). |
| Jun 8th | Manolis Zampetakis (MIT) PPP-completeness with connections to Cryptography (abstract, video). |
| Jun 1st | Fotis Iliopoulos (Institute for Advanced Study) Girth-reducibility and the algorithmic barrier for coloring (abstract). |
| May 25th | Nikos Mouzakis (NTUA) Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games (abstract). |
| May 18th | Themis Gouleakis (Max-Planck-Institute for informatics) Distribution-Independent PAC Learning of Halfspaces with Massart Noise (abstract). |
| May 11th | Vasileios Nakos (Saarland University and Max Planck Institute in Informatics) Faster Algorithms for Subset Sum (abstract, slides). |
| Feb 26th | Alexander Meduna (Brno University of Technology) Jumping Finite Automata (abstract). |
| Jan 27th | Stathis Zachos (NTUA) 90 Years of Computability and Complexity (abstract). |
| Jan 13th | Manolis Vlatakis (Columbia) Beyond Worst-Case Analysis of Algorithms: Smoothed Analysis Chapter (abstract). |
| 2019 | |
| Dec 30th | Ioannis Kokkinis (AUTh) An Introduction to Dynamic Complexity (abstract). |
| Dec 30th | Antonis Achilleos (Reykjavik University) A guide to monitorability (abstract). |
| Dec 19th | Vasilis Gkatzelis (Drexel University) Truthful Cardinal Mechanisms for One-Sided Matching (abstract). |
| Dec 11th | Stratis Ioannidis (Northeastern University) Learning from Comparisons (abstract). |
| Dec 9th | Giannis Mavrothalassitis (NTUA) Online Learing and Auctions |
| Dec 3rd | Manolis Vlatakis (Columbia) (Hidden) Zero-Sum Games: The Final (Non-Convex Non-Concave) Frontier A story by Poincaré, Bendixson, Hamilton and von Neumann (abstract). |
| Dec 2nd | Artemis Tsikiridis (AUEB) On Core-Selecting and Core-Competitive Mechanisms for Binary Single-Parameter Auctions (abstract). |
| Nov 18th | Eleni Psaroudaki (NTUA) Label Ranking (abstract). |
| Nov 1st | Andreas Göbel (Hasso Plattner Institute) Zeros and approximations of Holant polynomials on the complex plane (abstract). |
| Sep 10th | Stratis Skoulakis (NTUA) Opinion dynamics with Limited Information (abstract). |
| Sep 9th | Giannis Papaioannou (NTUA) Optimal Circle Search Despite the Presence of Faulty Robots (abstract). |
*Unless otherwise noted, the talks take place at the time and place specified under section "Information". For more information, please contact the Seminar manager.