Browse by Academic Unit (A-Z)

B

Beyersdorff, O, Galesi, N, Lauria, M and Razborov, AA (2012) Parameterized Bounded-Depth Frege Is not Optimal. ACM Transactions on Computation Theory, 4 (3). 7.1 - 7.16 . ISSN 1942-3454

Beyersdorff, O (2006) Disjoint NP-pairs from propositional proof systems. In: Cai, J, Cooper, SB and Li, A, (eds.) Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Proceedings. Third International Conference, TAMC, 15-20 May 2006, Bejing, China. Lecture Notes in Computer Science, 3959 . Springer Verlag , 236 - 247 . ISBN 3-540-34021-1

Beyersdorff, O (2008) Logical closure properties of propositional proof systems - (Extended abstract). In: Agrawal, M, Du, D, Duan, Z and Li, A, (eds.) Theory and Applications of Models of Computation. 5th International Conference on Theory and Applications of Models of Computation, 25-28 April 2009, Xi'an, China. Lecture Notes in Computer Science, 4978 (Lectur). Springer Verlag , Germany , 318 - 329 . ISBN 978-3-540-79227-7

Beyersdorff, O (2009) On the existence of complete disjoint NP-pairs. In: SYNASC 2009 - 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. 11th International Symposium on Symbolic & Numeric Algorithms for Scientific Computing, 26-29 September 2009, Timisoara, Romania. IEEE , 282 - 289 . ISBN 978-1-4244-5910-0

Beyersdorff, O (2010) Proof Complexity of Non-classical Logics. In: Kratochvíl, J, Li, A, Fiala, J and Kolman, P, (eds.) Theory and Applications of Models of Computation7th Annual Conference, TAMC 2010, Proceedings. Theory and Applications of Models of Computation, 7th Conference, 7 - 11 June, 2010, Prague, Czech Republic. Lecture Notes in Computer Science, 108 (6). Springer , 15 - 27 . ISBN 978-3-642-13561-3

Beyersdorff, O (2004) Representable Disjoint NP-Pairs. In: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science. FSTITCS 2004, 16 - 18 December 2004, Chennai, India. Springer Verlag , 122 - 134 . ISBN 3-540-24058-6

Beyersdorff, O (2006) Tuples of disjoint NP-sets. In: Grigoriev, D, Harrison, J and Hirsch, EA, (eds.) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). First International Computer Science Symposium in Russia, 8-12 June 2006, St Petersburg, Russia. Lecture Notes in Computer Science, Lectur (3967). Springer Verlag , 80 - 91 .

Beyersdorff, O (2007) The deduction theorem for strong propositional proof systems. In: Arvind, V and Prasad, S, (eds.) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Foundations of software technology and theoretical computer science, 12-14 December 2007, New Delhi, India. Lecture Notes in Computer Science, 4855 . Springer Verlag , 241 - 252 .

Beyersdorff, O, Galesi, N and Lauria, M (2011) Parameterized complexity of DPLL search procedures. In: Sakallah, KA and Simon, L, (eds.) Theory and Applications of Satisfiability Testing - SAT 2011. SAT 2011, 19 - 22 June 2011, Ann Arbor, MI, USA. Springer Verlag , 5 - 18 . ISBN 978-3-642-21580-3

Beyersdorff, O, Galesi, N, Lauria, M and Razborov, A (2011) Parameterized bounded-depth Frege is not optimal. In: Aceto, L, Henzinger, M and Sgall, J, (eds.) Automata, languages and programmes, proceedings ICALP. ICALP 2011, 4-8 July 2011, Zurich, Switzerland. Lecture Notes in Computer Science, 6755 (Part 1). Springer Verlag , 630 - 641 . ISBN 978-3-642-22005-0

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, 2-8 April 2009, Tarragona, Spain. Lecture Notes in Computer Science, 5457 . Springer Verlag , 164 - 175 . ISBN 978-3-642-00981-5

Beyersdorff, O and Kutz, O (2012) Proof complexity of non-classical logics. In: Lectures on Logic and Computation ESSLLI 2010 Copenhagen, Denmark, August 2010, ESSLLI 2011, Ljubljana, Slovenia, August 2011, Selected Lecture Notes. Lecture Notes in Computer Science, 7388 . Springer Verlag , 1 - 54 . ISBN 978-3-642-31484-1

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

Beyersdorff, O, Meier, A, Mundhenk, M, Schneider, T, Thomas, M and Vollmer, H (2011) Model Checking CTL is Amost Always Inherently Sequential. Logical Methods in Computer Science, 7 (2). ISSN 1860-5974

Beyersdorff, O, Meier, A, Thomas, M and Vollmer, H (2009) The Complexity of Reasoning for Fragments of Default Logic. In: Theory and Applications of Satisfiability Testing 2009. 12th International Conference, SAT 2009, 30 June - 03 July 2009, Swansea. Lecture Notes in Computer Science, 5584 (Lectur). Springer Verlag , 51 - 64 . ISBN 978-3-642-02776-5

Beyersdorff, O, Meier, A, Thomas, M, Vollmer, H, Mundhenk, M and Schneider, T (2009) Model Checking CTL is Almost Always Inherently Sequential. In: Lutz, C and Raskin, J-F, (eds.) 16th International Symposium on Temporal Representation and Reasoning 2009. International Symposium on Temporal Representation and Reasoning, 23 - 25 July 2009, Bressanone, Brixen, Italy. IEEE , 21 - 28 . ISBN 978-0-7695-3727-6

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, 7 - 11 June 2010, Prague, Czech Republic. Springer Verlag , 50 - 59 . ISBN 978-3-642-13561-3

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 June - 3 July 2009, Swansea, UK. Lecture Notes in Computer Science, 5584 (Lectur). Springer Verlag , 65 - 72 . ISBN 978-3-642-02776-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 September 2008, Bertinoro, Italy. Lecture Notes in Computer Science, 5213 . Springer Verlag , 199 - 214 . ISBN 978-3-540-87530-7

Beyersdorff, O and Nebesov, Y (2009) Edges as Nodes - a New Approach to Timetable Information. In: ATMOS 2009. Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS), 10 September 2009, University of Cophenhagen, Denmark. Dagstuhl Research Online Publication Server (DROPS) . ISBN 978-3-939897-11-8

Beyersdorff, O and Sadowski, Z (2009) Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes. In: Frid, AE, Morozov, A, Rybalchenko, A and Wagner, KW, (eds.) CSR. UNSPECIFIED. Springer , 47 - 58 . ISBN 978-3-642-03350-6

Beyersdorff, O, Vollmer, H, Datta, S, Mahajan, M, Sreenivasaiah, K, Scharfenberger-Fabian, G and Thomas, M (2011) Verifying proofs in constant depth. In: Proceedings MFCS 2011. Mathematical Foundations of Computer Science 2011, 22 - 26 August 2011, Warsaw, Poland. Springer Verlag , 84 - 95 . ISBN 978-3-642-22992-3

S

Sridhar, M, Cohn, AG and Hogg, DC (2010) Discovering an Event Taxonomy from Video using Qualitative Spatio-temporal Graphs. In: Coelho, H, Suder, R and Wooldridge, M, (eds.) ECAI 2010 - 19th European Conference on Artificial Intelligence,Proceedings. 19th European Conference on Artificial Intelligence, 16-20 August 2010, Lisbon, Portugal. IOS Press , 1103 - 1104 . ISBN 160750605X

Sridhar, M, Cohn, AG and Hogg, DC (2008) Learning functional object categories from a relational spatio-temporal representation. In: Ghallab, M, Spyropoulos, CD, Fakotakis, N and Avouris, NM, (eds.) ECAI 2008: 18th European Conference on Artificial Intelligence (Frontiers in Artificial Intelligence and Applications). ECAI 2008 18th European Conference on Artificial Intelligence, 21-25 July 2008, Patras, Greece. IOS Press , 606 - 610 . ISBN 978-1-58603-891-5

Sridhar, M, Cohn, AG and Hogg, DC (2010) Unsupervised Learning of Event Classes from Video. In: Fox, M and Poole, D, (eds.) Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence. AAAI Conference on Artificial Intelligence, 11-15 July 2010, Atlanta, Georgia, USA. AAAI Press , North America , 1631 - 1638 . ISBN 157735463X