Items where authors include "Mueller, S"

Article

Bosnjak, M, Fiebach, CJ, Mellor, D et al. (4 more authors) (2022) A Template for Preregistration of Quantitative Research in Psychology: Report of the Joint Psychological Societies Preregistration Task Force. American Psychologist, 77 (4). pp. 602-615. ISSN 0003-066X

Kattge, J, Bönisch, G, Díaz, S et al. (726 more authors) (2020) TRY plant trait database – enhanced coverage and open access. Global Change Biology, 26 (1). pp. 119-188. ISSN 1354-1013

Chatrchyan, S, Khachatryan, V, Sirunyan, AM et al. (2272 more authors) (2012) Study of high-p(T) charged particle suppression in PbPb compared to pp collisions at root s(NN)=2.76 TeV. European Physical Journal C, 72 (3). 1945. ISSN 1434-6044

Beyersdorff, O, Meier, A, Mueller, S et al. (2 more authors) (2011) Proof complexity of propositional default logic. Archive for Mathematical Logic, 50 (7-8). 727 - 742 . ISSN 1432-0665

Beyersdorff, O, Koebler, J and Mueller, S (2011) Proof systems that take advice. Information and Computation, 209 (3). 320 - 332 . ISSN 0890-5401

Beyersdorff, O and Mueller, S (2010) A Tight Karp-Lipton Collapse Result in Bounded Arithmetic. ACM Transactions on Computational Logic, 11 (4). ISSN 1529-3785

Proceedings Paper

Beyersdorff, O and Mueller, S (2010) Different Approaches to Proof Systems. In: Kratochvil, J, Li, A, Fiala, J and Kolman, P, (eds.) Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Proceedings. 7th Annual Conference, TAMC 2010, 07-11 Jun 2010, Prague, Czech Republic. Springer Verlag , 50 - 59 . ISBN 978-3-642-13561-3

Beyersdorff, O, Meier, A, Mueller, S et al. (2 more authors) (2010) Proof Complexity of Propositional Default Logic. In: Strichman, O and Szeider, S, (eds.) Theory and applications of satisfiability testing. SAT 2010, 11-14 Jul 2010, Edinburgh, UK. Lecture notes in computer science, 6175 . Springer Verlag , 30 - 43 . ISBN 978-3-642-14185-0

Beyersdorff, O and Mueller, S (2009) Does Advice Help to Prove Propositional Tautologies? In: Kullmann, O, (ed.) Theory and Applications of Satisfiability Testing SAT 2009. 12th International Conference, SAT 2009, 30 Jun - 03 Jul 2009, Swansea, UK. Lecture Notes in Computer Science, 5584 (Lectur). Springer Verlag , 65 - 72 . ISBN 978-3-642-02776-5

Beyersdorff, O, Koebler, J and Mueller, S (2009) Nondeterministic Instance Complexity and Proof Systems with Advice. In: Dediu, AH, Ionescu, AM and Martin-Vide, C, (eds.) Language and Automata Theory and Applications. Third International Conference, LATA 2009, 02-08 Apr 2009, Tarragona, Spain. Lecture Notes in Computer Science, 5457 . Springer Verlag , 164 - 175 . ISBN 978-3-642-00981-5

Beyersdorff, O and Mueller, S (2008) A Tight Karp-Lipton Collapse Result in Bounded Arithmetic. In: Kaminiski, M and Martini, S, (eds.) Proceedings of Computer Science Logic. 17th Annual Conference of the EACSL, 16-19 Sep 2008, Bertinoro, Italy. Lecture Notes in Computer Science, 5213 . Springer Verlag , 199 - 214 . ISBN 978-3-540-87530-7