Mikolaj Bojanczyk

ORCID

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 92

Top Venues

Publications

Mikolaj Bojanczyk, Pierre Ohlmann
Rank-decreasing transductions. CoRR (2024)
Mikolaj Bojanczyk, Lê Thành Dung Nguyên, Rafal Stefanski
Function Spaces for Orbit-Finite Sets. ICALP (2024)
Mikolaj Bojanczyk, Lê Thành Dung Nguyên, Rafal Stefanski
Function spaces for orbit-finite sets. CoRR (2024)
Mikolaj Bojanczyk, Pierre Ohlmann
Rank-decreasing transductions. LICS (2024)
Mikolaj Bojanczyk, Bartek Klin
Polyregular Functions on Unordered Trees of Bounded Height. Proc. ACM Program. Lang. 8 (POPL) (2024)
Mikolaj Bojanczyk, Lê Thành Dung Nguyên
Algebraic Recognition of Regular Functions. ICALP (2023)
Mikolaj Bojanczyk
Folding interpretations. LICS (2023)
Mikolaj Bojanczyk
On the Growth Rates of Polyregular Functions. LICS (2023)
Mikolaj Bojanczyk, Bartek Klin
Polyregular functions on unordered trees of bounded height. CoRR (2023)
Mikolaj Bojanczyk
The category of MSO transductions. CoRR (2023)
Rajeev Alur, Mikolaj Bojanczyk, Emmanuel Filiot, Anca Muscholl, Sarah Winter
Regular Transformations (Dagstuhl Seminar 23202). Dagstuhl Reports 13 (5) (2023)
Mikolaj Bojanczyk
Presburger Award 2023 - Laudatio. Bull. EATCS 140 (2023)
Mikolaj Bojanczyk
Folding interpretations. CoRR (2023)
Mikolaj Bojanczyk
The Presburger Award for Young Scientists 2023 - Call for Nominations. Bull. EATCS 138 (2022)
Mikolaj Bojanczyk, Michal Pilipczuk
Optimizing tree decompositions in MSO. Log. Methods Comput. Sci. 18 (1) (2022)
Mikolaj Bojanczyk
On the growth rate of polyregular functions. CoRR (2022)
Mikolaj Bojanczyk
Transducers of polynomial growth. LICS (2022)
Mikolaj Bojanczyk, Bartek Klin, Julian Salamanca
Monadic Monadic Second Order Logic. CoRR (2022)
Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk
Definable decompositions for graphs of bounded linear cliquewidth. Log. Methods Comput. Sci. 17 (1) (2021)
Mikolaj Bojanczyk, Bartek Klin, Joshua Moerman
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata. CoRR (2021)
David P. Woodruff, Mikolaj Bojanczyk
ICALP 2022 - 49th EATCS International Colloquium on Automata, Languages and Programming. Bull. EATCS 135 (2021)
Mikolaj Bojanczyk
EATCS-Fellows 2021. Bull. EATCS 134 (2021)
Mikolaj Bojanczyk
Separator logic and star-free expressions for graphs. CoRR (2021)
Mikolaj Bojanczyk, Thomas Brihaye, Christoph Haase, Slawomir Lasota, Joël Ouaknine, Igor Potapov
Preface. Inf. Comput. 277 (2021)
Mikolaj Bojanczyk, Bartek Klin, Joshua Moerman
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata. LICS (2021)
Christel Baier, Mikolaj Bojanczyk, Mariangiola Dezani, Josep Díaz, Giuseppe F. Italiano
EATCS Fellows 2021 - Call for Nominations. Bull. EATCS 132 (2020)
Thore Husfeldt, Meena Mahajan, Mikolaj Bojanczyk
The Presburger Award for Young Scientists 2021 - Call for Nominations. Bull. EATCS 132 (2020)
Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche
Extensions of ω-Regular Languages. CoRR (2020)
Mikolaj Bojanczyk, Amina Doumane
First-order tree-to-tree functions. LICS (2020)
Mikolaj Bojanczyk
Languages recognised by finite semigroups, and their generalisations to objects such as trees and graphs, with an emphasis on definability in monadic second-order logic. CoRR (2020)
Mikolaj Bojanczyk, Amina Doumane
First-order tree-to-tree functions. CoRR (2020)
Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche
Extensions of ω-Regular Languages. LICS (2020)
Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith
Undecidability of a weak version of MSO+U. Log. Methods Comput. Sci. 16 (1) (2020)
Mikolaj Bojanczyk, Janusz Schmude
Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers. MFCS (2020)
Mikolaj Bojanczyk, Rafal Stefanski
Single-Use Automata and Transducers for Infinite Alphabets. ICALP (2020)
Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak
MSO+∇ is undecidable. LICS (2019)
Mikolaj Bojanczyk
The Hilbert method for transducer equivalence. ACM SIGLOG News 6 (1) (2019)
Mikolaj Bojanczyk, Filippo Cavallari, Thomas Place, Michal Skrzypczak
Regular tree languages in low levels of the Wadge Hierarchy. Log. Methods Comput. Sci. 15 (3) (2019)
Mikolaj Bojanczyk, Bartek Klin
A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra. Log. Methods Comput. Sci. 15 (4) (2019)
Mikolaj Bojanczyk
Automata Column. ACM SIGLOG News 6 (1) (2019)
Mikolaj Bojanczyk, Rafal Stefanski
Single use register automata for data words. CoRR (2019)
Mikolaj Bojanczyk, Sandra Kiefer, Nathan Lhote
String-to-String Interpretations with Polynomial-Size Output. CoRR (2019)
Mikolaj Bojanczyk, Sandra Kiefer, Nathan Lhote
String-to-String Interpretations With Polynomial-Size Output. ICALP (2019)
Christel Baier, Mikolaj Bojanczyk, Mariangiola Dezani, Josep Díaz, Giuseppe F. Italiano
EATCS Fellows 2020 - Call for Nominations. Bull. EATCS 129 (2019)
Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak
MSO+nabla is undecidable. CoRR (2019)
Mikolaj Bojanczyk, Laure Daviaud, Shankara Narayanan Krishna
Regular and First-Order List Functions. LICS (2018)
Mikolaj Bojanczyk, Laure Daviaud, Krishna Shankara Narayanan
Regular and First Order List Functions. CoRR (2018)
Mikolaj Bojanczyk
Two monads for graphs. CoRR (2018)
Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith
Undecidability of MSO+"ultimately periodic". CoRR (2018)
Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk
Definable decompositions for graphs of bounded linear cliquewidth. LICS (2018)
Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk
Definable decompositions for graphs of bounded linear cliquewidth. CoRR (2018)
Mikolaj Bojanczyk, Szymon Torunczyk
On computability and tractability for infinite sets. LICS (2018)
Mikolaj Bojanczyk
Automata column. ACM SIGLOG News 5 (2) (2018)
Mikolaj Bojanczyk
Polyregular Functions. CoRR (2018)
Mikolaj Bojanczyk
Automata column. ACM SIGLOG News 5 (1) (2018)
Mikolaj Bojanczyk, Filippo Cavallari, Thomas Place, Michal Skrzypczak
Regular tree languages in low levels of Wadge Hierarchy. CoRR (2018)
Mikolaj Bojanczyk, Bartek Klin
A non-regular language of infinite trees that is recognizable by a finite algebra. CoRR (2018)
Mikolaj Bojanczyk
Automata column. ACM SIGLOG News 5 (3) (2018)
Mikolaj Bojanczyk
Automata column. ACM SIGLOG News 4 (2) (2017)
Mikolaj Bojanczyk, Hugo Gimbert, Edon Kelmendi
Emptiness of Zero Automata Is Decidable. ICALP (2017)
Mikolaj Bojanczyk, Henryk Michalewski
Some connections between universal algebra and logics for trees. CoRR (2017)
Mikolaj Bojanczyk
It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton. Fundam. Informaticae 154 (1-4) (2017)
Mikolaj Bojanczyk, Michal Pilipczuk
Optimizing Tree Decompositions in MSO. STACS (2017)
Mikolaj Bojanczyk
Automata column. ACM SIGLOG News 4 (3) (2017)
Mikolaj Bojanczyk
It is undecidable if two regular tree languages can be separated by a deterministic tree-walking automaton. CoRR (2017)
Mikolaj Bojanczyk, Michal Pilipczuk
Optimizing tree decompositions in MSO. CoRR (2017)
Mikolaj Bojanczyk, Thomas Colcombet
Boundedness in languages of infinite words. Log. Methods Comput. Sci. 13 (4) (2017)
Mikolaj Bojanczyk
Star Height via Games. CoRR (2017)
Mikolaj Bojanczyk
Automata column. ACM SIGLOG News 4 (4) (2017)
Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle
Which Classes of Origin Graphs Are Generated by Transducers. ICALP (2017)
Mikolaj Bojanczyk, Thomas Colcombet
Boundedness in languages of infinite words. CoRR (2017)
Mikolaj Bojanczyk
Orbit-Finite Sets and Their Algorithms (Invited Talk). ICALP (2017)
Mikolaj Bojanczyk, Hugo Gimbert, Edon Kelmendi
Emptiness of zero automata is decidable. CoRR (2017)
Mikolaj Bojanczyk
Thin MSO with a Probabilistic Path Quantifier. ICALP (2016)
Mikolaj Bojanczyk
Automata column. ACM SIGLOG News 3 (4) (2016)
Tomasz Idziaszek, Michal Skrzypczak, Mikolaj Bojanczyk
Regular Languages of Thin Trees. Theory Comput. Syst. 58 (4) (2016)
Henryk Michalewski, Matteo Mio, Mikolaj Bojanczyk
On the Regular Emptiness Problem of Subzero Automata. ICE (2016)
Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk
The MSO+U Theory of (N, <) Is Undecidable. STACS (2016)
Mikolaj Bojanczyk
Automata column. ACM SIGLOG News 3 (1) (2016)
Mikolaj Bojanczyk
Decidable Extensions of MSO. MFCS (2016)
Mikolaj Bojanczyk
Automata column. ACM SIGLOG News 3 (3) (2016)
Mikolaj Bojanczyk, Michal Pilipczuk
Definability equals recognizability for graphs of bounded treewidth. LICS (2016)
Mikolaj Bojanczyk, Michal Pilipczuk
Definability equals recognizability for graphs of bounded treewidth. CoRR (2016)
Mikolaj Bojanczyk, Meena Mahajan, Thomas Schwentick, Heribert Vollmer
Circuits, Logic and Games (Dagstuhl Seminar 15401). Dagstuhl Reports 5 (9) (2015)
Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk
The MSO+U theory of (N, <) is undecidable. CoRR (2015)
Mikolaj Bojanczyk
Automata column. ACM SIGLOG News 2 (2) (2015)
Mikolaj Bojanczyk, Filip Murlak, Adam Witkowski
Containment of Monadic Datalog Programs via Bounded Clique-Width. ICALP (2) (2015)
Mikolaj Bojanczyk
Recognisable Languages over Monads. DLT (2015)
Mikolaj Bojanczyk
Star Height via Games. LICS (2015)
Mikolaj Bojanczyk
McNaughton's theorem. ACM SIGLOG News 2 (1) (2015)
Mikolaj Bojanczyk
Automata column. ACM SIGLOG News 2 (4) (2015)
Mikolaj Bojanczyk
Recognisable languages over monads. CoRR (2015)
Mikolaj Bojanczyk
Transducers with Origin Information. ICALP (2) (2014)
Mikolaj Bojanczyk, Tomasz Gogacz, Henryk Michalewski, Michal Skrzypczak
On the Decidability of MSO+U on Infinite Trees. ICALP (2) (2014)
Mikolaj Bojanczyk
Weak MSO+U with Path Quantifiers over Infinite Trees. ICALP (2) (2014)
Mikolaj Bojanczyk
Automata column. ACM SIGLOG News 1 (2) (2014)
Mikolaj Bojanczyk, Christoph Dittmann, Stephan Kreutzer
Decomposition Theorems and Model-Checking for the Modal $μ$-Calculus. CoRR (2014)
Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota
Automata theory in nominal sets. Log. Methods Comput. Sci. 10 (3) (2014)
Mikolaj Bojanczyk, Stanislaw Szawiel, Marek W. Zawadowski
Rigidity is undecidable. Math. Struct. Comput. Sci. 24 (6) (2014)
Mikolaj Bojanczyk
Weak MSO+U with Path Quantifiers over Infinite Trees. CoRR (2014)

Mikolaj Bojanczyk.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mikolaj Bojanczyk