Sebastian Müller

Affiliations:
  • National Institute of Informatics (NII), Tokyo
  • Charles University, Prague, Faculty of Mathematics and Physics, Czech Republic
  • Humboldt University Berlin, Institute of Computer Science, Germany


According to our database1, Sebastian Müller authored at least 11 papers between 2005 and 2014.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2014
Graph Structure and Parity Games.
Electron. Colloquium Comput. Complex., 2014

Short propositional refutations for dense random 3CNF formulas.
Ann. Pure Appl. Log., 2014

2013
Polylogarithmic Cuts in Models of V^0
Log. Methods Comput. Sci., 2013

2011
Average-Case Separation in Proof Complexity: Short Propositional Refutations for Random 3CNF Formulas.
Electron. Colloquium Comput. Complex., 2011

Proof complexity of propositional default logic.
Arch. Math. Log., 2011

2010
A tight Karp-Lipton collapse result in bounded arithmetic.
ACM Trans. Comput. Log., 2010

Different Approaches to Proof Systems.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

2009
Proof Systems that Take Advice.
Electron. Colloquium Comput. Complex., 2009

Does Advice Help to Prove Propositional Tautologies?
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008
Nondeterministic Instance Complexity and Proof Systems with Advice.
Electron. Colloquium Comput. Complex., 2008

2005
A Smart Algorithm for Column Chart Labeling.
Proceedings of the Smart Graphics, 5th International Symposium, 2005


  Loading...