Reading Group Algorithms
|Given by:||Kurt Mehlhorn, Ruben Becker, and Emanuele Natale|
|Time:||Wednesday, 4:15 PM|
|Room:||024 in E1.4 (MPII-Building)|
|First Meeting:||April, 19|
|Credits:||7 credit points|
|Prerequisites:||You should bring a solid background in algorithms and data structures. This is an advanced seminar. The papers are challenging and a proper preparation of your talk will require some effort. Thus, you should bring a great passion for theoretical computer science. The target audience of this reading group are master students, PhD students, as well as postdocs.|
We will read (more or less) recent papers in theoretical computer science. The paper may be less recent if there is interesting follow-up work. In each session we have a regular presentation (40-60 minutes + discussion) of one paper. The reading group is open for all interested students and postdocs. Students aiming to get credits give a regular talk and write a short summary about the paper.
You earn the usual 7 credit points for a seminar if you (i) give a regular presentation of the paper given to you, and (ii) write a short summary (about 5 pages). The summary should be handed in within the first two weeks after the end of the semester, more precisely until August, 15th. You will receive comments and can improve your summary based on our comments. The presentation needs to be discussed with us at least one week before your scheduled talk in the reading group (you are supposed to give a practice talk to your supervisor).
The reading group counts as a seminar in your study program. You can register by sending an e-mail to Ruben. Please make sure that you read the section on prerequisites above before you register.
- There will be no meeting on Jun, 14th.
- The meeting on Jun, 7th will start at 5:15 PM.
- The first meeting will be on April, 19th.
|Apr, 19||Ruben||Introduction to the Reading Group|
|Guy||A Distributed (2+ε)-Approximation for Vertex Cover in O(logΔ/εloglogΔ) Rounds||[Apr19]|
|Apr, 26||Bojana||Learning and Efficiency in Games with Dynamic Population||[Apr26]|
|May, 3||Gorav||Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds||[May3]|
|May, 10||Karl||Streaming algorithms for embedding and computing edit distance in thelow distance regime||[May10]|
|May, 17||Kavitha||A Size-Popularity Tradeoff in the Stable Marriage Problem||[May17]|
|May, 24||Pavel||Faster spectral sparsification and numerical algorithms for SDD matrices||[May24]|
|May, 31||Daniel||Interchanging distance and capacity in probabilistic mappings||[May31]|
|Jun, 7||Marvin||Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation||[Jun7]|
|Jun, 14||No Reading Group|
|Jun, 21||Reading Group canceled|
|Jun, 28||Davis||The Gyori-Lovasz theorem and Spanning Tree Congestion||[Jun28]|
|Jul, 5||Julian||The Weighted Matching Approach to Maximum Cardinality Matching||[Jul5]|
|Jul, 12||Anurag||Boundaries of VP and VNP||[Jul12]|
|Jul, 19||Bhaskar||Improved Combinatorial Polynomial Algorithms for Linear Arrow Debreau Markets||[Jul19]|
|Jul, 26||Attila||The Ziggurat Method for Generating Random Variables||[Jul26]|
This list is complete.