Corelab Seminar
2018-2019

InformationAnnouncementsTalks

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

  • [Oct 1st, 2018] Seminar begins. First talk is on Monday 1/10 at 17:00!

Talks

Date* Speaker/Title
2019  
Mar 18th Vaggelis Chatziafratis (Stanford)
On the Computational Power of Online Gradient Descent (abstract).
Mar 18th Vaggelis Chatziafratis (Stanford)
Hierarchical Clustering as a Tool for Unsupervised Learning: An Optimization Viewpoint (abstract).
Mar 8th Vassilis Zikas (University of Endiburgh)
Security of Blockchains against Incentive-Driven Attacks (abstract).
Feb 25th Theofilos Triommatis (NTUA)
Studying Permanent, #P complete problems and approximate algorithms for them (abstract).
Feb 11th Marios Georgiou
Cryptocurrencies without need for concensus (abstract).
Jan 21st Dimitris Myrisiotis (Imperial College London)
Circuits, Lower Bounds, and Circuit Analysis Algorithms (abstract, slides).
2018  
Dec 10th Antonis Achilleos (Reykjavik University)
Adventures in monitorability (abstract).
Dec 3rd Eleni Bakali (NTUA)
On properties of counting functions with easy decision version: completeness, approximability, Markov chains and phase transitions for TotP-complete problems (abstract).
Nov 26th Giorgos Christodoulou (University of Liverpool)
The price of stability of (weighted) congestion games with polynomial latencies (abstract).
Nov 12th Eleni Bakali (NTUA)
On properties of counting functions with easy decision version: completeness, approximability, Markov chains and phase transitions for TotP-complete problems (abstract).
Nov 5th Eleni Bakali (NTUA)
Markov chains and phase transitions for TotP-complete problems (abstract).
Oct 29th Stavros Tripakis (Aalto University)
Recent Work in the Science of Software and Systems (abstract).
Oct 22nd Eleni Bakali (NTUA)
On properties of counting functions with easy decision version: completeness and approximability (abstract).
Oct 15th Thanasis Lianeas (NTUA)
Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators (abstract).
Oct 8th Konstantinos Mastakas (NTUA)
Uniform 2D-Monotone Minimum Spanning Graphs (abstract).
Oct 1st Elli Anastasiadi (NTUA)
Parameterized Complexity and Model Checking on Bounded Families of Graphs (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.