Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastian Müller 0003
Person information
- affiliation: National Institute of Informatics (NII), Tokyo
- affiliation: Charles University, Prague, Faculty of Mathematics and Physics, Czech Republic
- affiliation: Humboldt University Berlin, Institute of Computer Science, Germany
Other persons with the same name
- Sebastian Müller — disambiguation page
- Sebastian Müller 0001 — FU Berlin, Institute of Computer Science, Germany
- Sebastian Müller 0002 — Bundeswehr University Munich, Institute for Software Technology, Germany
- Sebastian Müller 0004
![[0000-0001-8071-8853]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-8071-8853")
— ETH Zürich, Institute of Molecular Systems Biology, Switzerland - Sebastian Müller 0005 — Brandenburg University of Technology, Cottbus, Germany
- Sebastian Müller 0006 — Aix Marseille Université, France
- Sebastian Müller 0007 — Humboldt-Universität zu Berlin, Germany
- Sebastian Müller 0008 — Technische Universität Kaiserslautern, Germany
- Sebastian Müller 0009 — Eastern Switzerland University of Applied Sciences, St. Gallen, Switzerland
- Sebastian Müller 0010 — Helmholtz Centre for Environmental Research, Leipzig, Germany
- Sebastian Müller 0011 — Bosch Rexroth AG, Erbach, Germany
- Sebastian Müller 0012 — Technische Hochschule Brandenburg, HCI Group, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2014
[j5]Sebastian Müller, Iddo Tzameret:
Short propositional refutations for dense random 3CNF formulas. Ann. Pure Appl. Log. 165(12): 1864-1918 (2014)- 2013
- [j4]Sebastian Müller:
Polylogarithmic Cuts in Models of V^0. Log. Methods Comput. Sci. 9(1) (2013) - 2011
- [j3]Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof complexity of propositional default logic. Arch. Math. Log. 50(7-8): 727-742 (2011) - [j2]Olaf Beyersdorff, Johannes Köbler, Sebastian Müller:
Proof systems that take advice. Inf. Comput. 209(3): 320-332 (2011) - 2010
- [j1]Olaf Beyersdorff, Sebastian Müller:
A tight Karp-Lipton collapse result in bounded arithmetic. ACM Trans. Comput. Log. 11(4): 22:1-22:23 (2010)
Conference and Workshop Papers
- 2012
- [c7]Sebastian Müller, Iddo Tzameret:
Short Propositional Refutations for Dense Random 3CNF Formulas. LICS 2012: 501-510 - 2010
- [c6]Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof Complexity of Propositional Default Logic. SAT 2010: 30-43 - [c5]Olaf Beyersdorff, Sebastian Müller:
Different Approaches to Proof Systems. TAMC 2010: 50-59 - 2009
- [c4]Olaf Beyersdorff, Johannes Köbler, Sebastian Müller:
Nondeterministic Instance Complexity and Proof Systems with Advice. LATA 2009: 164-175 - [c3]Olaf Beyersdorff, Sebastian Müller:
Does Advice Help to Prove Propositional Tautologies? SAT 2009: 65-72 - 2008
- [c2]Olaf Beyersdorff, Sebastian Müller:
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic. CSL 2008: 199-214 - 2005
- [c1]Sebastian Müller, Arno Schödl:
A Smart Algorithm for Column Chart Labeling. Smart Graphics 2005: 127-137
Informal and Other Publications
- 2014
- [i6]Sebastian Müller:
Graph Structure and Parity Games. Electron. Colloquium Comput. Complex. TR14 (2014) - 2011
- [i5]Sebastian Müller, Iddo Tzameret:
Average-Case Separation in Proof Complexity: Short Propositional Refutations for Random 3CNF Formulas. CoRR abs/1101.3970 (2011) - [i4]Sebastian Müller, Iddo Tzameret:
Average-Case Separation in Proof Complexity: Short Propositional Refutations for Random 3CNF Formulas. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [i3]Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof Complexity of Propositional Default Logic. Circuits, Logic, and Games 2010 - 2009
- [i2]Olaf Beyersdorff, Johannes Köbler, Sebastian Müller:
Proof Systems that Take Advice. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [i1]Olaf Beyersdorff, Johannes Köbler, Sebastian Müller:
Nondeterministic Instance Complexity and Proof Systems with Advice. Electron. Colloquium Comput. Complex. TR08 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-09 03:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
