Here's a list of talks I gave:

April 4, 2006
An Infinite Hierarchy in the Linear Time Mu-Calculus, PCV Research Seminar, University of Wales, Swansea

December 9, 2005
Bounded Model Checking for the Linear Time Mu-Calculus, Münchener Model-Checking-Tag

May 12, 2005
Some Notes on the Linear Time Mu-Calculus, Workshop on Temporal Reasoning, Schloß Münchenwiler

January 13, 2005
Rund um das Aussagenlogische Erfüllbarkeitsproblem - Komplexität und Anwendungen, Informatik-Kolloquium, Universität Dortmund

October 5, 2004
Bounded Model Checking for All Regular Properties, Gemeinsames Jahrestreffen der GI Fachgruppen Logik in der Informatik und Deduktion, Saarbrücken

April 5, 2004
Two Occurrences, Logarithmic Space and Perfect Matching , Springschool "Logic in Computer Science", Venice, Italy

March 26, 2004
Satisfiability Problems Complete for Deterministic Logarithmic Space, STACS 2004, Montpellier, France

February 2, 2004
Vollständige Erfüllbarkeitsprobleme für LogSpace, Informatik-Kolloquium, Technische Universität Chemnitz

November 21, 2003
Die Komplexität von Erfüllbarkeitsproblemen mit zwei Variablenvorkommen, 49. Workshop über Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen (Theorietag), Düsseldorf

October 10, 2003
Vollständige Erfüllbarkeitsprobleme für LogSpace, Gemeinsames Jahrestreffen der GI Fachgruppen Logik in der Informatik und Deduktion, Augsburg

August 18-29, 2003
Bounded Arithmetic and Resolution-Based Proof Systems, course held at the ESSLLI 2003 summer school, Vienna. Slides, Course notes.

November 29, 2002
Algorithmen und untere Schranken für das Erfüllbarkeitsproblem, Tag der Informatik, LMU München

October 3, 2002
An Elementary Fragment of Second-Order Lambda Calculus, Gemeinsames Jahrestreffen der GI Fachgruppen 0.1.6 "Logik in der Informatik" und 1.2.1 "Deduktion", Freiburg

August 29, 2002
An Almost Optimal Lower Bound for Resolution with Conjunctions of Width 2, MFCS 02, Warsaw, Poland

June 28, 2002
An Elementary Fragment of Second-Order Lambda Calculus, Meeting on Bounded Arithmetic and Complexity Classes, Lisbon, Portugal

April 12, 2002
An Optimal Lower Bound for Resolution with Width 2 Conjunctions , Meeting on Mathematical Logic, Mathematisches Forschungsinstitut Oberwolfach

April 10, 2002
An Elementary Fragment of System F, informal presentation at Mathematisches Forschungsinstitut Oberwolfach

February 5, 2002
On the Complexity of Resolution Refinements, Collegium Logicum, Technische Universität Wien

December 17, 2001
The Complexity of Propositional Resolution Proofs, Fachbereich Mathematik, Technische Universität Darmstadt

November 6, 2001
Über die Komplexität von Resolutionsverfeinerungen, Informatik-Kolloquium, Technische Universität Chemnitz

October 9, 2001
Fragments of Gödel's System T Characterizing Fast Parallel Computation, Dagstuhl Seminar Proof Theory in Computer Science, Schloß Dagstuhl

July 20, 2001
The Latest News on Propositional Resolution, Colloquium of the GKLI, München

July 3, 2001
An Exponential Separation between Regular and General Resolution, 44. Workshop über Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen (Theorietag), Würzburg

June 27, 2001
Linear Higher Type Recursion and Parallel Complexity, Workshop Deduktive Aspekte von Beweistheorie und Informatik, Bern

June 6, 2001
Higher Type Recursion and Parallel Complexity, Jahrestreffen der GI Fachgruppe 0.1.6 "Logik in der Informatik", München

April 10, 2001
Higher Type Recursion and Parallel Complexity, Theory Seminar, Dept. of Computer Science, University of Toronto

September 24, 2000
The Relative Complexity of Resolution Refinements, Colloquium Logicum 2000, Dresden

February 11 and 18, 2000
Komplexität monotoner Schaltkreise and Untere Schranken für Beweissysteme durch effektive Interpolation, Tutorial at the Colloquium of the GKLI, München

November 26, 1999
Resolution und der Polynom-Kalkül, Oberseminar Theoretische Informatik, LMU München

June 11, 1999
Bounded Arithmetic and TC0-Frege Systems, Workshop Logical Complexity Theory, LMU München

May 21, 1999
Exponentielle Trennungen zwischen eingeschränkten Resolutions- und Cutting-Planes-Beweissystemen, Oberseminar Theoretische Informatik, LMU München

March 21, 1999
Bounded Arithmetic, Threshold Circuits and Counterexample Computations, Special Session on Proof Theory and Complexity, 1999 Annual Meeting of the ASL, San Diego

August 13, 1998
Bounded Arithmetic for Threshold Circuits and Counting Hierarchies, Special Session on Proof Theory, Logic Colloquium '98, Prag

August 4, 1998
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems, BRICS workshop on Proof Theory and Complexity, Aarhus

February 23, 1998
Depth Lower Bounds for Monotone Real Circuits, Seminar on Security, Theory, Algorithms and Logic (STALL), UCSD

May 16, 1997
Eventually Complete Models of Simple Type Theory, STALL seminar, UCSD

April 18, 1997
Independence Results for Weak Fragments of Bounded Arithmetic, STALL seminar, UCSD

March 12, 1997
Modelltheoretische Unabhängigkeitsbeweise für schwache Fragmente der Beschränkten Arithmetik, Oberseminar Theoretische Informatik, LMU München

July 5, 1996
Fragmente der Arithmetik und ihre Beziehung zur Komplexitätstheorie, Oberseminar Logik und Mathematische Grundlagen der Informatik, Technische Universität Darmstadt

April 22, 1996
A Model-Theoretic Property of Sharply Bounded Formulae, with Some Applications, DIMACS workshop on Feasible Arithmetics and Proof Complexity, Rutgers University

December 5, 1995
Fragmente der Arithmetik und ihre Beziehung zur Komplexitätstheorie, Oberseminar Mathematische Logik, Universität Heidelberg

Contributed Conference Talks

  • Weak Bounded Arithmetic, the Diffie-Hellman-Problem, and Constable's Class K, LICS'99, Trento, Italy

  • On Proofs about Threshold Circuits and Counting Hierarchies, LICS'98, Indianapolis

  • A Bounded Arithmetic Theory for Constant-Depth Threshold Circuits, GÖDEL'96, Brno, Czech Republic

  • On Sharply Bounded Length Induction, CSL'95, Paderborn, Germany

  • On the Weakness of Sharply Bounded Polynomial Induction, Kurt Gödel Colloquium '93, Brno, Czech Republic

  • The Axiom of Infinity in Zermelo Set Theory, Logic Colloquium '92, Veszprem, Hungary

  • Zermelo Set Theory within Type Theory, Logic, Methodology and Philosophy of Science 1991, Uppsala, Sweden

    Back to my home page.