Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikolaj Bojanczyk
Mikołaj Bojańczyk
Person information
- unicode name: Mikołaj Bojańczyk
- affiliation: University of Warsaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c80]Mikolaj Bojanczyk, Lê Thành Dung Nguyên:
Algebraic Recognition of Regular Functions. ICALP 2023: 117:1-117:19- [c79]Mikolaj Bojanczyk:
Folding interpretations. LICS 2023: 1-13 - [c78]Mikolaj Bojanczyk:
On the Growth Rates of Polyregular Functions. LICS 2023: 1-13 - [i37]Mikolaj Bojanczyk:
Folding interpretations. CoRR abs/2301.05101 (2023) - [i36]Mikolaj Bojanczyk:
The category of MSO transductions. CoRR abs/2305.18039 (2023) - 2022
- [j52]Mikolaj Bojanczyk, Michal Pilipczuk:
Optimizing tree decompositions in MSO. Log. Methods Comput. Sci. 18(1) (2022) - [c77]Mikolaj Bojanczyk:
Transducers of polynomial growth. LICS 2022: 1:1-1:27 - [e4]Mikolaj Bojanczyk, Emanuela Merelli
, David P. Woodruff:
49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France. LIPIcs 229, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-235-8 [contents] - [i35]Mikolaj Bojanczyk, Bartek Klin, Julian Salamanca:
Monadic Monadic Second Order Logic. CoRR abs/2201.09969 (2022) - [i34]Mikolaj Bojanczyk:
On the growth rate of polyregular functions. CoRR abs/2212.11631 (2022) - 2021
- [j51]Mikolaj Bojanczyk:
EATCS-Fellows 2021. Bull. EATCS 134 (2021) - [j50]David P. Woodruff, Mikolaj Bojanczyk:
ICALP 2022 - 49th EATCS International Colloquium on Automata, Languages and Programming. Bull. EATCS 135 (2021) - [j49]Mikolaj Bojanczyk, Thomas Brihaye, Christoph Haase, Slawomir Lasota, Joël Ouaknine, Igor Potapov:
Preface. Inf. Comput. 277: 104579 (2021) - [j48]Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk:
Definable decompositions for graphs of bounded linear cliquewidth. Log. Methods Comput. Sci. 17(1) (2021) - [c76]Mikolaj Bojanczyk, Bartek Klin, Joshua Moerman:
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata. LICS 2021: 1-13 - [p1]Mikolaj Bojanczyk:
Algebra for trees. Handbook of Automata Theory (I.) 2021: 801-838 - [e3]Mikolaj Bojanczyk, Chandra Chekuri:
41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference. LIPIcs 213, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-215-0 [contents] - [i33]Mikolaj Bojanczyk, Bartek Klin, Joshua Moerman:
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata. CoRR abs/2104.02438 (2021) - [i32]Mikolaj Bojanczyk:
Separator logic and star-free expressions for graphs. CoRR abs/2107.13953 (2021) - 2020
- [j47]Christel Baier, Mikolaj Bojanczyk, Mariangiola Dezani, Josep Díaz, Giuseppe F. Italiano:
EATCS Fellows 2021 - Call for Nominations. Bull. EATCS 132 (2020) - [j46]Thore Husfeldt, Meena Mahajan, Mikolaj Bojanczyk:
The Presburger Award for Young Scientists 2021 - Call for Nominations. Bull. EATCS 132 (2020) - [j45]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) - [c75]Mikolaj Bojanczyk, Rafal Stefanski:
Single-Use Automata and Transducers for Infinite Alphabets. ICALP 2020: 113:1-113:14 - [c74]Mikolaj Bojanczyk, Amina Doumane:
First-order tree-to-tree functions. LICS 2020: 252-265 - [c73]Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche:
Extensions of ω-Regular Languages. LICS 2020: 266-272 - [c72]Mikolaj Bojanczyk, Janusz Schmude:
Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers. MFCS 2020: 19:1-19:14 - [i31]Mikolaj Bojanczyk, Amina Doumane:
First-order tree-to-tree functions. CoRR abs/2002.09307 (2020) - [i30]Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche:
Extensions of ω-Regular Languages. CoRR abs/2002.09393 (2020) - [i29]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 abs/2008.11635 (2020)
2010 – 2019
- 2019
- [j44]Christel Baier, Mikolaj Bojanczyk, Mariangiola Dezani, Josep Díaz, Giuseppe F. Italiano:
EATCS Fellows 2020 - Call for Nominations. Bull. EATCS 129 (2019) - [j43]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) - [j42]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) - [j41]Mikolaj Bojanczyk:
Automata Column. ACM SIGLOG News 6(1): 4 (2019) - [j40]Mikolaj Bojanczyk:
The Hilbert method for transducer equivalence. ACM SIGLOG News 6(1): 5-17 (2019) - [c71]Mikolaj Bojanczyk, Sandra Kiefer, Nathan Lhote:
String-to-String Interpretations With Polynomial-Size Output. ICALP 2019: 106:1-106:14 - [c70]Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak:
MSO+∇ is undecidable. LICS 2019: 1-13 - [e2]Mikolaj Bojanczyk, Alex Simpson:
Foundations of Software Science and Computation Structures - 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings. Lecture Notes in Computer Science 11425, Springer 2019, ISBN 978-3-030-17126-1 [contents] - [i28]Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak:
MSO+nabla is undecidable. CoRR abs/1901.06900 (2019) - [i27]Mikolaj Bojanczyk, Sandra Kiefer, Nathan Lhote:
String-to-String Interpretations with Polynomial-Size Output. CoRR abs/1905.13190 (2019) - [i26]Mikolaj Bojanczyk, Rafal Stefanski:
Single use register automata for data words. CoRR abs/1907.10504 (2019) - 2018
- [j39]Mikolaj Bojanczyk:
Automata column. ACM SIGLOG News 5(1): 13 (2018) - [j38]Mikolaj Bojanczyk:
Automata column. ACM SIGLOG News 5(2): 3 (2018) - [j37]Mikolaj Bojanczyk:
Automata column. ACM SIGLOG News 5(3): 3 (2018) - [c69]Mikolaj Bojanczyk, Laure Daviaud, Shankara Narayanan Krishna:
Regular and First-Order List Functions. LICS 2018: 125-134 - [c68]Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk:
Definable decompositions for graphs of bounded linear cliquewidth. LICS 2018: 135-144 - [c67]Mikolaj Bojanczyk, Szymon Torunczyk:
On computability and tractability for infinite sets. LICS 2018: 145-154 - [i25]Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk:
Definable decompositions for graphs of bounded linear cliquewidth. CoRR abs/1803.05937 (2018) - [i24]Mikolaj Bojanczyk, Laure Daviaud, S. Krishna:
Regular and First Order List Functions. CoRR abs/1803.06168 (2018) - [i23]Mikolaj Bojanczyk, Bartek Klin:
A non-regular language of infinite trees that is recognizable by a finite algebra. CoRR abs/1804.06667 (2018) - [i22]Mikolaj Bojanczyk:
Two monads for graphs. CoRR abs/1804.09408 (2018) - [i21]Mikolaj Bojanczyk, Filippo Cavallari, Thomas Place, Michal Skrzypczak:
Regular tree languages in low levels of Wadge Hierarchy. CoRR abs/1806.02041 (2018) - [i20]Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith:
Undecidability of MSO+"ultimately periodic". CoRR abs/1807.08506 (2018) - [i19]Mikolaj Bojanczyk:
Polyregular Functions. CoRR abs/1810.08760 (2018) - 2017
- [j36]Mikolaj Bojanczyk:
It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton. Fundam. Informaticae 154(1-4): 37-46 (2017) - [j35]Mikolaj Bojanczyk, Thomas Colcombet:
Boundedness in languages of infinite words. Log. Methods Comput. Sci. 13(4) (2017) - [j34]Mikolaj Bojanczyk:
Automata column. ACM SIGLOG News 4(2): 3 (2017) - [j33]Mikolaj Bojanczyk:
Automata column. ACM SIGLOG News 4(3): 11 (2017) - [j32]Mikolaj Bojanczyk:
Automata column. ACM SIGLOG News 4(4): 9 (2017) - [c66]Mikolaj Bojanczyk:
Orbit-Finite Sets and Their Algorithms (Invited Talk). ICALP 2017: 1:1-1:14 - [c65]Mikolaj Bojanczyk, Hugo Gimbert, Edon Kelmendi:
Emptiness of Zero Automata Is Decidable. ICALP 2017: 106:1-106:13 - [c64]Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle:
Which Classes of Origin Graphs Are Generated by Transducers. ICALP 2017: 114:1-114:13 - [c63]Mikolaj Bojanczyk, Michal Pilipczuk:
Optimizing Tree Decompositions in MSO. STACS 2017: 15:1-15:13 - [i18]Mikolaj Bojanczyk, Michal Pilipczuk:
Optimizing tree decompositions in MSO. CoRR abs/1701.06937 (2017) - [i17]Mikolaj Bojanczyk, Hugo Gimbert, Edon Kelmendi:
Emptiness of zero automata is decidable. CoRR abs/1702.06858 (2017) - [i16]Mikolaj Bojanczyk, Henryk Michalewski:
Some connections between universal algebra and logics for trees. CoRR abs/1703.04736 (2017) - [i15]Mikolaj Bojanczyk:
It is undecidable if two regular tree languages can be separated by a deterministic tree-walking automaton. CoRR abs/1703.04997 (2017) - [i14]Mikolaj Bojanczyk:
Star Height via Games. CoRR abs/1708.03603 (2017) - [i13]Mikolaj Bojanczyk, Thomas Colcombet:
Boundedness in languages of infinite words. CoRR abs/1708.09765 (2017) - 2016
- [j31]Tomasz Idziaszek, Michal Skrzypczak, Mikolaj Bojanczyk:
Regular Languages of Thin Trees. Theory Comput. Syst. 58(4): 614-663 (2016) - [j30]Mikolaj Bojanczyk:
Automata column. ACM SIGLOG News 3(1): 3 (2016) - [j29]Mikolaj Bojanczyk:
Automata column. ACM SIGLOG News 3(3): 3 (2016) - [j28]Mikolaj Bojanczyk:
Automata column. ACM SIGLOG News 3(4): 12 (2016) - [c62]Mikolaj Bojanczyk:
Thin MSO with a Probabilistic Path Quantifier. ICALP 2016: 96:1-96:13 - [c61]Mikolaj Bojanczyk, Michal Pilipczuk:
Definability equals recognizability for graphs of bounded treewidth. LICS 2016: 407-416 - [c60]Mikolaj Bojanczyk:
Decidable Extensions of MSO. MFCS 2016: 2:1-2:1 - [c59]Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk:
The MSO+U Theory of (N, <) Is Undecidable. STACS 2016: 21:1-21:8 - [c58]Henryk Michalewski, Matteo Mio, Mikolaj Bojanczyk:
On the Regular Emptiness Problem of Subzero Automata. ICE 2016: 1-23 - [i12]Mikolaj Bojanczyk, Michal Pilipczuk:
Definability equals recognizability for graphs of bounded treewidth. CoRR abs/1605.03045 (2016) - 2015
- [j27]Mikolaj Bojanczyk:
McNaughton's theorem. ACM SIGLOG News 2(1): 5-6 (2015) - [j26]Mikolaj Bojanczyk:
Automata column. ACM SIGLOG News 2(2): 3 (2015) - [j25]Mikolaj Bojanczyk:
Automata column. ACM SIGLOG News 2(4): 3-15 (2015) - [c57]Mikolaj Bojanczyk:
Recognisable Languages over Monads. DLT 2015: 1-13 - [c56]Mikolaj Bojanczyk, Filip Murlak, Adam Witkowski:
Containment of Monadic Datalog Programs via Bounded Clique-Width. ICALP (2) 2015: 427-439 - [c55]Mikolaj Bojanczyk:
Star Height via Games. LICS 2015: 214-219 - [e1]Mikolaj Bojanczyk, Slawomir Lasota, Igor Potapov:
Reachability Problems - 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings. Lecture Notes in Computer Science 9328, Springer 2015, ISBN 978-3-319-24536-2 [contents] - [i11]Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk:
The MSO+U theory of (N, <) is undecidable. CoRR abs/1502.04578 (2015) - [i10]Mikolaj Bojanczyk:
Recognisable languages over monads. CoRR abs/1502.04898 (2015) - [i9]Mikolaj Bojanczyk, Meena Mahajan, Thomas Schwentick, Heribert Vollmer:
Circuits, Logic and Games (Dagstuhl Seminar 15401). Dagstuhl Reports 5(9): 105-124 (2015) - 2014
- [j24]Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota:
Automata theory in nominal sets. Log. Methods Comput. Sci. 10(3) (2014) - [j23]Mikolaj Bojanczyk, Stanislaw Szawiel, Marek W. Zawadowski:
Rigidity is undecidable. Math. Struct. Comput. Sci. 24(6) (2014) - [j22]Mikolaj Bojanczyk:
Automata column. ACM SIGLOG News 1(1): 4 (2014) - [j21]Mikolaj Bojanczyk:
Automata column. ACM SIGLOG News 1(2): 3-12 (2014) - [c54]Mikolaj Bojanczyk, Christoph Dittmann, Stephan Kreutzer:
Decomposition theorems and model-checking for the modal μ-calculus. CSL-LICS 2014: 17:1-17:10 - [c53]Mikolaj Bojanczyk:
Transducers with Origin Information. ICALP (2) 2014: 26-37 - [c52]Mikolaj Bojanczyk:
Weak MSO+U with Path Quantifiers over Infinite Trees. ICALP (2) 2014: 38-49 - [c51]Mikolaj Bojanczyk, Tomasz Gogacz, Henryk Michalewski, Michal Skrzypczak:
On the Decidability of MSO+U on Infinite Trees. ICALP (2) 2014: 50-61 - [i8]Mikolaj Bojanczyk:
Weak MSO+U with Path Quantifiers over Infinite Trees. CoRR abs/1404.7278 (2014) - [i7]Mikolaj Bojanczyk, Christoph Dittmann, Stephan Kreutzer:
Decomposition Theorems and Model-Checking for the Modal $μ$-Calculus. CoRR abs/1405.2234 (2014) - 2013
- [j20]Mikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak:
Solutions in XML data exchange. J. Comput. Syst. Sci. 79(6): 785-815 (2013) - [j19]Mikolaj Bojanczyk:
Nominal Monoids. Theory Comput. Syst. 53(2): 194-222 (2013) - [c50]Mikolaj Bojanczyk:
Automata and Algebras for Infinite Words and Trees. CALCO 2013: 17-18 - [c49]Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, Szymon Torunczyk:
Turing Machines with Atoms. LICS 2013: 183-192 - [c48]Mikolaj Bojanczyk, Luc Segoufin, Szymon Torunczyk:
Verification of database-driven systems via amalgamation. PODS 2013: 63-74 - [c47]Mikolaj Bojanczyk, Tomasz Idziaszek, Michal Skrzypczak:
Regular languages of thin trees. STACS 2013: 562-573 - [c46]Mikolaj Bojanczyk:
Modelling Infinite Structures with Atoms. WoLLIC 2013: 13-28 - [i6]Mikolaj Bojanczyk:
Transducers with origin information. CoRR abs/1309.6124 (2013) - [i5]Mikolaj Bojanczyk, Bartek Klin, Alexander Kurz, Andrew M. Pitts:
Nominal Computation Theory (Dagstuhl Seminar 13422). Dagstuhl Reports 3(10): 58-71 (2013) - 2012
- [j18]Mikolaj Bojanczyk, Slawomir Lasota:
An extension of data automata that captures XPath. Log. Methods Comput. Sci. 8(1) (2012) - [j17]Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing:
Piecewise testable tree languages. Log. Methods Comput. Sci. 8(3) (2012) - [j16]Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz:
Wreath Products of Forest Algebras, with Applications to Tree Logics. Log. Methods Comput. Sci. 8(3) (2012) - [j15]Vince Bárány, Mikolaj Bojanczyk:
Finite satisfiability for guarded fixpoint logic. Inf. Process. Lett. 112(10): 371-375 (2012) - [j14]Mikolaj Bojanczyk:
Algorithms for regular languages that use algebra. SIGMOD Rec. 41(2): 5-14 (2012) - [c45]Mikolaj Bojanczyk, Szymon Torunczyk:
Imperative Programming in Sets with Atoms. FSTTCS 2012: 4-15 - [c44]Vince Bárány, Mikolaj Bojanczyk, Diego Figueira, Pawel Parys:
Decidable classes of documents for XPath. FSTTCS 2012: 99-111 - [c43]Mikolaj Bojanczyk, Slawomir Lasota:
A Machine-Independent Characterization of Timed Languages. ICALP (2) 2012: 92-103 - [c42]Mikolaj Bojanczyk, Thomas Place:
Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets. ICALP (2) 2012: 104-115 - [c41]Mikolaj Bojanczyk, Thomas Place:
Toward Model Theory with Data Values. ICALP (2) 2012: 116-127 - [c40]Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, Slawomir Lasota:
Towards nominal computation. POPL 2012: 401-412 - [c39]Mikolaj Bojanczyk, Slawomir Lasota:
Fraenkel-Mostowski Sets with Non-homogeneous Atoms. RP 2012: 1-5 - [c38]Mikolaj Bojanczyk, Szymon Torunczyk:
Weak MSO+U over infinite trees. STACS 2012: 648-660 - [i4]Mikolaj Bojanczyk, Stanislaw Szawiel, Marek W. Zawadowski:
Rigidity is undecidable. CoRR abs/1204.4906 (2012) - [i3]Mikolaj Bojanczyk, Slawomir Lasota:
Minimization of semilinear automata. CoRR abs/1210.4980 (2012) - 2011
- [j13]Mikolaj Bojanczyk, Pawel Parys:
XPath evaluation in linear time. J. ACM 58(4): 17:1-17:33 (2011) - [j12]Mikolaj Bojanczyk:
Weak MSO with the Unbounding Quantifier. Theory Comput. Syst. 48(3): 554-576 (2011) - [j11]Albert Atserias, Mikolaj Bojanczyk, Balder ten Cate, Ronald Fagin, Floris Geerts, Kenneth A. Ross:
Foreword. Theory Comput. Syst. 49(2): 365-366 (2011) - [j10]Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Two-variable logic on data words. ACM Trans. Comput. Log. 12(4): 27:1-27:26 (2011) - [c37]Mikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak:
Solutions in XML data exchange. ICDT 2011: 102-113 - [c36]Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota:
Automata with Group Actions. LICS 2011: 355-364 - [c35]