Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publications
Mikołaj Bojańczyk
2018
- Mikołaj Bojańczyk, Martin Grohe and Michał Pilipczuk, Definable decompositions for graphs of bounded linear cliquewidth, in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, 2018, p. 135–144.see in PBN
- Mikołaj Bojańczyk and Szymon Toruńczyk, On computability and tractability for infinite sets, in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, 2018, p. 145–154.see in PBN
2017
- Mikołaj Bojańczyk, It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton, Fundamenta Informaticae 154 (1-4) 2017, p. 37–46.see in PBN
- Hugo Gimbert, Edon Kelmendi and Mikołaj Bojańczyk, Emptiness of Zero Automata Is Decidable, in: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, p. 106:1–106:13.see in PBN
- Laure Daviaud, Bruno Guillon, Vincent Penelle and Mikołaj Bojańczyk, Which Classes of Origin Graphs Are Generated by Transducers, in: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, p. 114:1–114:13.see in PBN
- Mikołaj Bojańczyk and Michał Pilipczuk, Optimizing Tree Decompositions in MSO, in: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, 2017, p. 15:1–15:13.see in PBN
- Mikołaj Bojańczyk, Wojciech Czerwiński, Piotr Hofman, Szczepan Hummel, Bartosz Klin, Eryk Kopczyński, Sławomir Lasota, Filip Aleksander Mazowiecki, Henryk Michalewski, Damian Niwiński, Joanna Ochremiak, Paweł Parys, Michał Pilipczuk, Wojciech Rytter, Michał Paweł Skrzypczak, Szymon Toruńczyk, Igor Walukiewicz, Joost Winter and Lorenzo ClementeFilip Murlak (ed.), 200 Problems in Formal Languages and Automata Theory, Uniwersytet Warszawski, Warszawa 2017.see in PBN
2016
- Mikołaj Bojańczyk, Paweł Parys and Szymon Toruńczyk, The MSO+U Theory of (N,<) Is Undecidable, in: 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Schloss Dagstuhl, 2016, r. 21, p. 21:1–21:8.see in PBN
- Mikołaj Bojańczyk, Thin MSO with a Probabilistic Path Quantifier, in: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, 2016, p. 96:1–96:13.see in PBN
- Mikołaj Bojańczyk and Michał Pilipczuk, Definability equals recognizability for graphs of bounded treewidth, in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016, 2016, p. 407–416.see in PBN
- Henryk Michalewski, Matteo Mio and Mikołaj Bojańczyk, On the Regular Emptiness Problem of Subzero Automata, in: Proceedings 9th Interaction and Concurrency Experience, ICE 2016, Heraklion, Greece, 8-9 June 2016., 2016, p. 1–23.see in PBN
2015
- Mikołaj Bojańczyk, Filip Murlak and Adam Wojciech Witkowski, Containment of Monadic Datalog Programs via Bounded Clique-Width, in: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, Springer, 2015, p. 427–439.see in PBN
- Mikołaj Bojańczyk, Sławomir Lasota and Igor Potapov (eds.), Reachability Problems - 9th International Workshop, {RP} 2015, Warsaw, Poland, September 21-23, 2015, Proceedings, Springer, Warsaw 2015.see in PBN
- Tomasz Idziaszek, Michał Paweł Skrzypczak and Mikołaj Bojańczyk, Regular languages of thin trees, Theory Of Computing Systems 2015, p. 1–50.see in PBN
2014
- Mikołaj Bojańczyk, Stanisław Konrad Szawiel and Marek Witold Zawadowski, Rigidity is undecidable, Mathematical Structures In Computer Science 2014.see in PBN
- Mikołaj Bojańczyk, Bartosz Klin and Sławomir Lasota, Automata theory in nominal sets, Logical Methods In Computer Science 10 (3:4) 2014.see in PBN
- Mikołaj Bojańczyk, Tomasz Gogacz, Henryk Michalewski and Michał Paweł Skrzypczak, On the Decidability of MSO+U on Infinite Trees, in: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, 2014, p. 50–61.see in PBN
- Mikołaj Bojańczyk, Christoph Dittmann and Stephan Kreutzer, Decomposition theorems and model-checking for the modal \emph\(\mu\)-calculus, in: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014, 2014, p. 17.see in PBN
- Mikołaj Bojańczyk, Transducers with Origin Information, in: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, 2014, p. 26–37.see in PBN
- Mikołaj Bojańczyk, Weak MSO+U with Path Quantifiers over Infinite Trees, in: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, 2014, p. 38–49.see in PBN
2013
- Mikołaj Bojańczyk, Luc Segoufin and Szymon Toruńczyk, Verification of database-driven systems via amalgamation, in: Proceedings of PODS 2013, 2013.see in PBN
- Mikołaj Bojańczyk, Tomasz Idziaszek and Michał Paweł Skrzypczak, Regular languages of thin trees, in: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany 2013, p. 562–573.see in PBN
- Mikołaj Bojańczyk, Leszek Aleksander Kołodziejczyk and Filip Murlak, Solutions in XML data exchange, Journal Of Computer And System Sciences 79 (6) 2013, p. 785–815.see in PBN
- Mikołaj Bojańczyk, Nominal Monoids, Theory Of Computing Systems 53 (2) 2013, p. 194–222.see in PBN
- Mikołaj Bojańczyk, Bartosz Klin, Sławomir Lasota and Szymon Toruńczyk, Turing machines with atoms, in: Proceedings of LICS 2013, 2013, p. 183–192.see in PBN
2012
- Vince Bárány, Mikołaj Bojańczyk, Diego Figueira and Paweł Parys, Decidable Classes of Documents for XPath, in: FSTTCS, LIPICS, Dagstuhl 2012.see in PBN
- Vince Bárány and Mikołaj Bojańczyk, Finite satisfiability for guarded fixpoint logic, Information Processing Letters 112 (10) 2012, p. 371–375.see in PBN
- Mikołaj Bojańczyk and Sławomir Lasota, Fraenkel-Mostowski Sets with Non-homogeneous Atoms, in: RP, 2012.see in PBN
- Mikołaj Bojańczyk and Szymon Toruńczyk, Imperative Programming in Sets with Atoms, in: FSTTCS, LIPICS, Dagstuhl 2012.see in PBN
- Mikołaj Bojańczyk and Sławomir Lasota, A Machine-Independent Characterization of Timed Languages, in: ICALP (2), 2012.see in PBN
- Mikołaj Bojańczyk and Thomas Place, Toward Model Theory with Data Values, in: ICALP (2), 2012.see in PBN
- Mikołaj Bojańczyk, Laurent Braud, Bartosz Klin and Sławomir Lasota, Towards nominal computation, in: POPL, 2012.see in PBN
- Mikołaj Bojańczyk and Szymon Toruńczyk, Weak MSO+U over infinite trees, in: STACS, 2012.see in PBN
- Mikołaj Bojańczyk, Howard Straubing and Igor Walukiewicz, Wreath Products of Forest Algebras, with Applications to Tree Logics, Logical Methods In Computer Science 8 (3) 2012, p. 1–39.see in PBN
- Mikołaj Bojańczyk, Luc Segoufin and Howard Straubing, Piecewise testable tree languages, Logical Methods In Computer Science 8 (3) 2012.see in PBN
- Mikołaj Bojańczyk and Thomas Place, Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets, in: ICALP (2), 2012.see in PBN
- Mikołaj Bojańczyk, Eryk Kopczyński and Szymon Toruńczyk, Ramsey’s theorem for colors from a metric space, Semigroup Forum 85 (1) 2012, p. 182–184.see in PBN
- Mikołaj Bojańczyk, Algorithms for regular languages that use algebra, Siam Journal On Computing 41 (2) 2012, p. 5–14.see in PBN
- Mikołaj Bojańczyk and Sławomir Lasota, An extension of data automata that captures XPath, Logical Methods In Computer Science 8 (1) 2012.see in PBN
2011
- Paweł Parys and Mikołaj Bojańczyk, XPath Evaluation in Linear Time, Journal Of The Acm 58 (4) 2011, p. 17.see in PBN
- Mikołaj Bojańczyk, Bartosz Klin and Sławomir Lasota, Automata with group actions, in: Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011), IEEE Computer Society, Toronto 2011.see in PBN
- Mikołaj Bojańczyk, Data Monoids, in: STACS, Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2011.see in PBN
- Mikołaj Bojańczyk and Diego Figueira, Efficient evaluation for a temporal logic on changing XML documents, in: PODS, ACM, Athens 2011.see in PBN
- Albert Atserias, Mikołaj Bojańczyk, Balder ten Cate, Ronald Fagin, Floris Geerts and Kenneth Ross, Foreword, Theory Of Computing Systems 49 (2) 2011, p. 365–366.see in PBN
- Mikołaj Bojańczyk, Claire David, Anca Muscholl, Thomas Schwentick and Luc Segoufin, Two-variable logic on data words, Acm Transactions On Computational Logic 12 (4) 2011.see in PBN
- Mikołaj Bojańczyk, Weak MSO with the Unbounding Quantifier, Theory Of Computing Systems 48 (3) 2011, p. 554–576.see in PBN
- Mikołaj Bojańczyk, Leszek Aleksander Kołodziejczyk and Filip Murlak, Solutions in XML data exchange, in: Proceedings of the 14th International Conference on Database Theory. ICDT'11, ACM, Uppsala, Sweden 2011.see in PBN
2010
- Mikołaj Bojańczyk and Paweł Parys, Efficient Evaluation of Nondeterministic Automata Using Factorization Forests, Lecture Notes In Computer Science 6198 2010, p. 515–526.see in PBN
- Mikołaj Bojańczyk and Luc Segoufin, Tree Languages Defined in First-Order Logic with One Quantifier Alternation, Logical Methods In Computer Science 6 (4) 2010, p. 1–26.see in PBN
- Mikołaj Bojańczyk and Sławomir Lasota, An Extension of Data Automata that Captures XPath, in: LICS, 2010.see in PBN
- Mikołaj Bojańczyk, Automata for Data Words and Data Trees, in: RTA, 2010.see in PBN
- Mikołaj Bojańczyk, Beyond omega-Regular Languages, in: STACS, 2010.see in PBN
- Mikołaj Bojańczyk, Damian Niwiński, Alexander Rabinovich, Adam Radziwonczyk-Syta and Michał Skrzypczak, On the Borel Complexity of MSO Definable Sets of Branches, Fundamenta Informaticae 98 (4) 2010, p. 337–349.see in PBN
2009
- Mikołaj Bojańczyk and Tomasz Idziaszek, Algebra for Infinite Forests with an Application to the Temporal Logic EF, Lecture Notes In Computer Science 5710 2009, p. 131–145.see in PBN
- Mikołaj Bojańczyk, Algebra for Tree Languages, Lecture Notes In Computer Science 5771 2009, p. 1.see in PBN
- Mikołaj Bojańczyk, Howard Straubing and Igor Walukiewicz, Wreath Products of Forest Algebras, with Applications to Tree Logics, in: LICS, IEEE Computer Society, Los Angeles 2009.see in PBN
- Mikołaj Bojańczyk, Weak MSO with the Unbounding Quantifier, in: STACS, 2009.see in PBN
- Mikołaj Bojańczyk, Anca Muscholl, Thomas Schwentick and Luc Segoufin, Two-variable logic on data trees and XML reasoning, Journal Of The Acm 56 (3) 2009.see in PBN
- Mikołaj Bojańczyk, Two-Way Unary Temporal Logic over Trees, Logical Methods In Computer Science 5 (3) 2009, p. 1–29.see in PBN
- Mikołaj Bojańczyk and Szymon Toruńczyk, Deterministic Automata and Extensions of Weak MSO, in: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, Leibniz-Zentrum fuer Informatik, Dagstuhl 2009.see in PBN
- Mikołaj Bojańczyk, Factorization Forests, Lecture Notes In Computer Science 5583 2009, p. 1–17.see in PBN
2008
- Mikołaj Bojańczyk, The Common Fragment of ACTL and LTL, Lecture Notes In Computer Science 4962 2008, p. 172–185.see in PBN
- Mikołaj Bojańczyk and Luc Segoufin, Tree Languages Defined in First-Order Logic with One Quantifier Alternation, Lecture Notes In Computer Science 5126 2008, p. 233–245.see in PBN
- Mikołaj Bojańczyk, Luc Segoufin and Howard Straubing, Piecewise Testable Tree Languages, in: LICS, 2008.see in PBN
- Mikołaj Bojańczyk and Paweł Parys, XPath Evaluation in Linear Time, in: PODS, 2008.see in PBN
- Mikołaj Bojańczyk, Tree-Walking Automata, Lecture Notes In Computer Science 5196 2008, p. 1–2.see in PBN
- Mikołaj Bojańczyk and Thomas Colcombet, Tree-Walking Automata Do Not Recognize All Regular Languages, Siam Journal On Computing 38 (2) 2008, p. 658–701.see in PBN
2007
- Mikołaj Bojańczyk, Forest Expressions, Lecture Notes In Computer Science 4646 2007, p. 146–160.see in PBN
- Mikołaj Bojańczyk, Two-way unary temporal logic over trees, in: 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), Los Alamitos, California 2007.see in PBN
- Mikołaj Bojańczyk, A new algorithm for testing if a regular language is locally threshold testable, Information Processing Letters 104 (3) 2007, p. 91–94.see in PBN
- Henrik Bjorklund and Mikołaj Bojańczyk, Bounded Depth Data Trees, Lecture Notes In Computer Science 4596 2007, p. 862–874.see in PBN
- Henrik Bjorklund and Mikołaj Bojańczyk, Shuffle Expressions and Words with Nested Data, Lecture Notes In Computer Science 4708 2007, p. 750–761.see in PBN
- Piotr Hoffman and Mikołaj Bojańczyk, Reachability in Unions of Commutative Rewriting Systems Is Decidable, Lecture Notes In Computer Science 4393 2007, p. 622–633.see in PBN
2006
- Mikołaj Bojańczyk and Thomas Colcombet, Tree-walking automata cannot be determinized, Theoretical Computer Science 350 (3) 2006, p. 164–173.see in PBN
- Mikołaj Bojańczyk, Mathias Samuelides, Thomas Schwentick and Luc Segoufin, Expressive Power of Pebble Automata, Lecture Notes In Computer Science 4052 2006, p. 7–16.see in PBN
- Mikołaj Bojańczyk and Thomas Colcombet, Bounds in w-Regularity, in: Annual IEEE Symposium on Logic in Computer Science, Seattle 2006.see in PBN
- Mikołaj Bojańczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin and Claire David, Two-Variable Logic on Words with Data, in: Annual IEEE Symposium on Logic in Computer Science, IEEE, Seattle 2006.see in PBN
- Mikołaj Bojańczyk, Claire David, Anca Muscholl, Thomas Schwentick and Luc Segoufin, Two-variable logic on data trees and XML reasoning, in: ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, ACM, Chicago 2006.see in PBN
You are not logged in | log in
