A Smart Algorithm for Column Chart Labeling. - Sebastian Müller 003; Arno Schödl (Smart Graphics, 2005)

Nondeterministic Instance Complexity and Proof Systems with Advice. - Olaf Beyersdorff; Johannes Köbler; Sebastian Müller 003 (Electron. Colloquium Comput. Complex., 2008)

Does Advice Help to Prove Propositional Tautologies? - Olaf Beyersdorff; Sebastian Müller 003 (SAT, 2009)

Proof Systems that Take Advice. - Olaf Beyersdorff; Johannes Köbler; Sebastian Müller 003 (Electron. Colloquium Comput. Complex., 2009)

Different Approaches to Proof Systems. - Olaf Beyersdorff; Sebastian Müller 003 (TAMC, 2010)

A tight Karp-Lipton collapse result in bounded arithmetic. - Olaf Beyersdorff; Sebastian Müller 003 (ACM Trans. Comput. Log., 2010)

Proof complexity of propositional default logic. - Olaf Beyersdorff; Arne Meier; Sebastian Müller 003; Michael Thomas 001; Heribert Vollmer (Arch. Math. Log., 2011)

Average-Case Separation in Proof Complexity: Short Propositional Refutations for Random 3CNF Formulas. - Sebastian Müller 003; Iddo Tzameret (Electron. Colloquium Comput. Complex., 2011)

Polylogarithmic Cuts in Models of V^0 - Sebastian Müller 003 (Log. Methods Comput. Sci., 2013)

Short propositional refutations for dense random 3CNF formulas. - Sebastian Müller 003; Iddo Tzameret (Ann. Pure Appl. Log., 2014)

Graph Structure and Parity Games. - Sebastian Müller 003 (Electron. Colloquium Comput. Complex., 2014)