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