Talks by Dominik Scheder2005
September
- September 01, 2005, Dominik Scheder (Univ. of Colorado at Boulder): Finding highly connected subgraphs of low weight [details]
2006
April
- April 20, 2006, Dominik Scheder: Fourier Analysis in Computer Science and Combinatorics (Part II) [details]
October
- October 31, 2006, Dominik Scheder: Fast deterministic algorithms for 3-SAT [details]
2007
March
- March 08, 2007, Dominik Scheder: Partial Satisfaction [details]
April
- April 24, 2007, Dominik Scheder: Unsatisfiable Linear k-CNF Formulas [details]
October
- October 16, 2007, Dominik Scheder: Saving Space -- Two Classical Results from Complexity Theory [details]
2008
January
- January 29, 2008, Dominik Scheder: Hardness, Pseudo-Randomness and Derandomization (Part I) [details]
- January 31, 2008, Dominik Scheder: Hardness, Pseudo-Randomness and Derandomization (Part II) [details]
March
- March 13, 2008, Dominik Scheder: How many conflicts does it need to be unsatisfiable? [details]
September
- September 25, 2008, Dominik Scheder: Almost Disjoint Formulas and Almost Tight Bounds [details]
November
- November 13, 2008, Dominik Scheder: Bollobás' and Riordan's Proof of the Harris-Kesten Theorem [details]
2009
September
- September 10, 2009, Dominik Scheder: Two-Coloring the Odd Cycle - A Short Introduction To Parallel Repetition [details]
2010
January
- January 19, 2010, Dominik Scheder: Constraint Satisfaction - Speeding Up Deterministic Local Search By Defining a Graph on the Set of Colors [details]
October
- October 19, 2010, Dominik Scheder: Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses. [details]
2011
February
- February 24, 2011, Dominik Scheder: Mahaney's Theorem: A Complexity Theory Classic [details]
July
- July 28, 2011, in ML J37.1, Dominik Scheder: A very different algorithm for k-SAT [details]
September
- September 20, 2011, Dominik Scheder (Aarhus University): Truthful Mechanisms for Facility Location [details]
2012
March
- March 15, 2012, Dominik Scheder (Aarhus University): A 29 Minutes Intro to Communication Complexity (Plus 1 Minute of Questions) [details]
November
- Friday, November 16, 2012, in HG D3.2, Dominik Scheder (Aarhus University): Exponential Lower Bounds for the PPSZ k-SAT Algorithm [details]
2013
March
- Wednesday, March 27, 2013, Dominik Scheder (Aarhus University): After Traxler and Amano: The relationship between average sensitivity, clause size, and solution density [details]
Upcoming talks | All previous talks | Talks by speaker |  Upcoming talks in iCal format (beta version!) Previous talks by year: 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.3392 | admin login
|
