Edit Profile Bojańczyk, Mikołaj Compute Distance To: Compute Author ID: bojanczyk.mikolaj Published as: Bojanczyk, Mikolaj; Bojanczyk, Mikołaj; Bojañczyk, Mikołaj; Bojańczyk, Mikolaj; Bojańczyk, Mikołaj; Bojánczyk, Mikolaj; Bojánczyk, Mikołaj Homepage: https://www.mimuw.edu.pl/~bojan/ External Links: MGP · Wikidata · dblp · GND Documents Indexed: 78 Publications since 2001, including 2 Books all top 5 Co-Authors 24 single-authored 7 Lasota, Sławomir 6 Segoufin, Luc 6 Toruńczyk, Szymon 5 Colcombet, Thomas 5 Skrzypczak, Michał 4 Klin, Bartek 4 Parys, Paweł 4 Walukiewicz, Igor 3 Idziaszek, Tomasz 3 Place, Thomas 3 Schwentick, Thomas 2 Bárány, Vince 2 Björklund, Henrik 2 Daviaud, Laure 2 Guillon, Bruno 2 Michalewski, Henryk 2 Murlak, Filip 2 Muscholl, Anca 2 Penelle, Vincent 2 Pilipczuk, Michał 2 Straubing, Howard 1 Braud, Laurent 1 Cavallari, Filippo 1 David, Claire 1 Dittmann, Christoph 1 Figueira, Diego 1 Gimbert, Hugo 1 Gogacz, Tomasz 1 Hoffman, Piotr 1 Kelmendi, Edon 1 Kołodziejczyk, Leszek Aleksander 1 Kopczyński, Eryk 1 Kreutzer, Stephan 1 Mio, Matteo 1 Niwiński, Damian 1 Potapov, Igor 1 Rabinovich, Alexander 1 Radziwończyk-Syta, Adam 1 Samuelides, Mathias 1 Simpson, Alex K. 1 Sreejith, A V 1 Szawiel, Stanisław 1 Witkowski, Adam 1 Zawadowski, Marek W. all top 5 Serials 10 Logical Methods in Computer Science 3 Theoretical Computer Science 3 Theory of Computing Systems 2 Information Processing Letters 2 Journal of the ACM 2 Fundamenta Informaticae 2 Lecture Notes in Computer Science 1 Journal of Computer and System Sciences 1 Semigroup Forum 1 SIAM Journal on Computing 1 MSCS. Mathematical Structures in Computer Science 1 ACM Transactions on Computational Logic all top 5 Fields 64 Computer science (68-XX) 51 Mathematical logic and foundations (03-XX) 3 Combinatorics (05-XX) 2 General and overarching topics; collections (00-XX) 2 Group theory and generalizations (20-XX) 1 General algebraic systems (08-XX) 1 Category theory; homological algebra (18-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH 58 Publications have been cited 264 times in 176 Documents Cited by ▼ Year ▼ Two-variable logic on data words. Zbl 1352.03041Bojańczyk, Mikołaj; David, Claire; Muscholl, Anca; Schwentick, Thomas; Segoufin, Luc 37 2011 Two-variable logic on data trees and XML reasoning. Zbl 1325.68078Bojańczyk, Mikolaj; Muscholl, Anca; Schwentick, Thomas; Segoufin, Luc 28 2009 Automata theory in nominal sets. Zbl 1338.68140Bojańczyk, Mikołaj; Klin, Bartek; Lasota, Sławomir 12 2014 Towards nominal computation. Zbl 1321.68139Bojanczyk, Mikolaj; Braud, Laurent; Klin, Bartek; Lasota, Slawomir 11 2012 Expressive power of pebble automata. Zbl 1223.68065Bojańczyk, Mikołaj; Samuelides, Mathias; Schwentick, Thomas; Segoufin, Luc 8 2006 Recognisable languages over monads. Zbl 1434.68307Bojańczyk, Mikołaj 7 2015 Transducers with origin information. Zbl 1409.68152Bojańczyk, Mikołaj 7 2014 Weak MSO with the unbounding quantifier. Zbl 1227.03051Bojańczyk, Mikołaj 7 2011 Tree-walking automata. Zbl 1156.68445Bojańczyk, Mikołaj 7 2008 Turing machines with atoms. Zbl 1367.68098Bojánczyk, Mikolaj; Klin, Bartek; Lasota, Sławomir; Toruńczyk, Szymon 6 2013 Algebra for infinite forests with an application to the temporal logic EF. Zbl 1254.68158Bojańczyk, Mikołaj; Idziaszek, Tomasz 6 2009 Tree-walking automata do not recognize all regular languages. Zbl 1172.68030Bojańczyk, Mikołaj; Colcombet, Thomas 6 2009 Forest algebras. Zbl 1217.68123Bojańczyk, Mikołaj; Walukiewicz, Igor 6 2008 Characterizing EF and EX tree logics. Zbl 1097.03013Bojańczyk, Mikolaj; Walukiewicz, Igor 6 2006 Tree-walking automata do not recognize all regular languages. Zbl 1192.68406Bojanczyk, Mikolaj; Colcombet, Thomas 6 2005 Characterizing EF and EX tree logics. Zbl 1097.03504Bojańczyk, Mikołaj; Walukiewicz, Igor 6 2004 Regular languages of infinite trees that are Boolean combinations of open sets. Zbl 1367.68160Bojańczyk, Mikołaj; Place, Thomas 5 2012 Weak \(\text{MSO}+U\) over infinite trees. Zbl 1245.68119Bojańczyk, Mikolaj; Toruńczyk, Szymon 5 2012 Tree-walking automata cannot be determinized. Zbl 1086.68070Bojańczyk, Mikołaj; Colcombet, Thomas 5 2006 A bounding quantifier. Zbl 1095.03007Bojańczyk, Mikołaj 5 2004 The common fragment of ACTL and LTL. Zbl 1139.68036Bojańczyk, Mikołaj 4 2008 Shuffle expressions and words with nested data. Zbl 1147.68554Björklund, Henrik; Bojańczyk, Mikołaj 4 2007 Tree-walking automata cannot be determinized. Zbl 1098.68620Bojańczyk, Mikołaj; Colcombet, Thomas 4 2004 Boundedness in languages of infinite words. Zbl 06816924Bojańczyk, Mikołaj; Colcombet, Thomas 3 2017 Definability equals recognizability for graphs of bounded treewidth. Zbl 1394.03062Bojańczyk, Mikołaj; Pilipczuk, Michał 3 2016 The MSO+U theory of \((\mathbb N,<)\) is undecidable. Zbl 1388.03016Bojanczyk, Mikolaj; Parys, Pawel; Torunczyk, Szymon 3 2016 On the decidability of MSO+U on infinite trees. Zbl 1407.03007Bojańczyk, Mikołaj; Gogacz, Tomasz; Michalewski, Henryk; Skrzypczak, Michał 3 2014 Piecewise testable tree languages. Zbl 1261.03126Bojańczyk, Mikołaj; Segoufin, Luc; Straubing, Howard 3 2012 An extension of data automata that captures XPath. Zbl 1241.68077Bojańczyk, Mikołaj; Lasota, Sławomir 3 2012 XPath evaluation in linear time. Zbl 1281.68093Bojańczyk, Mikołaj; Parys, Paweł 3 2011 Data monoids. Zbl 1230.68146Bojańczyk, Mikolaj 3 2011 Deterministic automata and extensions of weak MSO. Zbl 1248.68285Bojańczyk, Mikołaj; Toruńczyk, Szymon 3 2009 Tree languages defined in first-order logic with one quantifier alternation. Zbl 1170.03019Bojańczyk, Mikołaj; Segoufin, Luc 3 2008 Forest expressions. Zbl 1179.68068Bojańczyk, Mikołaj 3 2007 Two-way alternating automata and finite models. Zbl 1057.03029Bojańczyk, Mikołaj 3 2002 Containment of monadic Datalog programs via bounded clique-width. Zbl 1440.68054Bojańczyk, Mikołaj; Murlak, Filip; Witkowski, Adam 2 2015 Weak MSO+U with path quantifiers over infinite trees. Zbl 1407.03006Bojańczyk, Mikołaj 2 2014 Nominal monoids. Zbl 1295.68163Bojańczyk, Mikołaj 2 2013 Wreath products of forest algebras, with applications to tree logics. Zbl 1258.03044Bojańczyk, Mikolaj; Walukiewicz, Igor; Straubing, Howard 2 2012 On the Borel complexity of MSO definable sets of branches. Zbl 1206.03041Bojańczyk, Mikołaj; Niwiński, Damian; Rabinovich, Alexander; Radziwończyk-Syta, Adam; Skrzypczak, Michał 2 2010 Bounded depth data trees. Zbl 1171.68432Björklund, Henrik; Bojańczyk, Mikołaj 2 2007 1-bounded TWA cannot be determinized. Zbl 1205.68193Bojañczyk, Mikołaj 2 2003 Which classes of origin graphs are generated by transducers. Zbl 1442.68083Bojańczyk, Mikołaj; Daviaud, Laure; Guillon, Bruno; Penelle, Vincent 1 2017 Regular languages of thin trees. Zbl 1350.68173Idziaszek, Tomasz; Skrzypczak, Michał; Bojańczyk, Mikołaj 1 2016 Star height via games. Zbl 1401.68148Bojańczyk, Mikolaj 1 2015 Decomposition theorems and model-checking for the modal \(\mu\)-calculus. Zbl 1394.68222Bojanczyk, Mikolaj; Dittmann, Christoph; Kreutzer, Stephan 1 2014 Regular languages of thin trees. Zbl 1354.68146Bojańczyk, Mikołaj; Idziaszek, Tomasz; Skrzypczak, Michał 1 2013 Solutions in XML data exchange. Zbl 1408.68045Bojańczyk, Mikołaj; Kołodziejczyk, Leszek A.; Murlak, Filip 1 2013 Modelling infinite structures with atoms. Zbl 1394.03055Bojańczyk, Mikołaj 1 2013 Imperative programming in sets with atoms. Zbl 1354.68053Bojańczyk, Mikolaj; Toruńczyk, Szymon 1 2012 Toward model theory with data values. Zbl 1367.03051Bojańczyk, Mikołaj; Place, Thomas 1 2012 A machine-independent characterization of timed languages. Zbl 1367.68159Bojańczyk, Mikołaj; Lasota, Sławomir 1 2012 Finite satisfiability for guarded fixpoint logic. Zbl 1243.68191Bárány, Vince; Bojańczyk, Mikołaj 1 2012 Beyond \(\omega\)-regular languages. Zbl 1230.68124Bojańczyk, Mikołaj 1 2010 Factorization forests. Zbl 1247.68127Bojańczyk, Mikołaj 1 2009 A new algorithm for testing if a regular language is locally threshold testable. Zbl 1184.68307Bojańczyk, Mikołaj 1 2007 Reachability in unions of commutative rewriting systems is decidable. Zbl 1186.68231Bojańczyk, Mikołaj; Hoffman, Piotr 1 2007 The finite graph problem for two-way alternating automata. Zbl 1052.68069Bojańczyk, Mikołaj 1 2003 Boundedness in languages of infinite words. Zbl 06816924Bojańczyk, Mikołaj; Colcombet, Thomas 3 2017 Which classes of origin graphs are generated by transducers. Zbl 1442.68083Bojańczyk, Mikołaj; Daviaud, Laure; Guillon, Bruno; Penelle, Vincent 1 2017 Definability equals recognizability for graphs of bounded treewidth. Zbl 1394.03062Bojańczyk, Mikołaj; Pilipczuk, Michał 3 2016 The MSO+U theory of \((\mathbb N,<)\) is undecidable. Zbl 1388.03016Bojanczyk, Mikolaj; Parys, Pawel; Torunczyk, Szymon 3 2016 Regular languages of thin trees. Zbl 1350.68173Idziaszek, Tomasz; Skrzypczak, Michał; Bojańczyk, Mikołaj 1 2016 Recognisable languages over monads. Zbl 1434.68307Bojańczyk, Mikołaj 7 2015 Containment of monadic Datalog programs via bounded clique-width. Zbl 1440.68054Bojańczyk, Mikołaj; Murlak, Filip; Witkowski, Adam 2 2015 Star height via games. Zbl 1401.68148Bojańczyk, Mikolaj 1 2015 Automata theory in nominal sets. Zbl 1338.68140Bojańczyk, Mikołaj; Klin, Bartek; Lasota, Sławomir 12 2014 Transducers with origin information. Zbl 1409.68152Bojańczyk, Mikołaj 7 2014 On the decidability of MSO+U on infinite trees. Zbl 1407.03007Bojańczyk, Mikołaj; Gogacz, Tomasz; Michalewski, Henryk; Skrzypczak, Michał 3 2014 Weak MSO+U with path quantifiers over infinite trees. Zbl 1407.03006Bojańczyk, Mikołaj 2 2014 Decomposition theorems and model-checking for the modal \(\mu\)-calculus. Zbl 1394.68222Bojanczyk, Mikolaj; Dittmann, Christoph; Kreutzer, Stephan 1 2014 Turing machines with atoms. Zbl 1367.68098Bojánczyk, Mikolaj; Klin, Bartek; Lasota, Sławomir; Toruńczyk, Szymon 6 2013 Nominal monoids. Zbl 1295.68163Bojańczyk, Mikołaj 2 2013 Regular languages of thin trees. Zbl 1354.68146Bojańczyk, Mikołaj; Idziaszek, Tomasz; Skrzypczak, Michał 1 2013 Solutions in XML data exchange. Zbl 1408.68045Bojańczyk, Mikołaj; Kołodziejczyk, Leszek A.; Murlak, Filip 1 2013 Modelling infinite structures with atoms. Zbl 1394.03055Bojańczyk, Mikołaj 1 2013 Towards nominal computation. Zbl 1321.68139Bojanczyk, Mikolaj; Braud, Laurent; Klin, Bartek; Lasota, Slawomir 11 2012 Regular languages of infinite trees that are Boolean combinations of open sets. Zbl 1367.68160Bojańczyk, Mikołaj; Place, Thomas 5 2012 Weak \(\text{MSO}+U\) over infinite trees. Zbl 1245.68119Bojańczyk, Mikolaj; Toruńczyk, Szymon 5 2012 Piecewise testable tree languages. Zbl 1261.03126Bojańczyk, Mikołaj; Segoufin, Luc; Straubing, Howard 3 2012 An extension of data automata that captures XPath. Zbl 1241.68077Bojańczyk, Mikołaj; Lasota, Sławomir 3 2012 Wreath products of forest algebras, with applications to tree logics. Zbl 1258.03044Bojańczyk, Mikolaj; Walukiewicz, Igor; Straubing, Howard 2 2012 Imperative programming in sets with atoms. Zbl 1354.68053Bojańczyk, Mikolaj; Toruńczyk, Szymon 1 2012 Toward model theory with data values. Zbl 1367.03051Bojańczyk, Mikołaj; Place, Thomas 1 2012 A machine-independent characterization of timed languages. Zbl 1367.68159Bojańczyk, Mikołaj; Lasota, Sławomir 1 2012 Finite satisfiability for guarded fixpoint logic. Zbl 1243.68191Bárány, Vince; Bojańczyk, Mikołaj 1 2012 Two-variable logic on data words. Zbl 1352.03041Bojańczyk, Mikołaj; David, Claire; Muscholl, Anca; Schwentick, Thomas; Segoufin, Luc 37 2011 Weak MSO with the unbounding quantifier. Zbl 1227.03051Bojańczyk, Mikołaj 7 2011 XPath evaluation in linear time. Zbl 1281.68093Bojańczyk, Mikołaj; Parys, Paweł 3 2011 Data monoids. Zbl 1230.68146Bojańczyk, Mikolaj 3 2011 On the Borel complexity of MSO definable sets of branches. Zbl 1206.03041Bojańczyk, Mikołaj; Niwiński, Damian; Rabinovich, Alexander; Radziwończyk-Syta, Adam; Skrzypczak, Michał 2 2010 Beyond \(\omega\)-regular languages. Zbl 1230.68124Bojańczyk, Mikołaj 1 2010 Two-variable logic on data trees and XML reasoning. Zbl 1325.68078Bojańczyk, Mikolaj; Muscholl, Anca; Schwentick, Thomas; Segoufin, Luc 28 2009 Algebra for infinite forests with an application to the temporal logic EF. Zbl 1254.68158Bojańczyk, Mikołaj; Idziaszek, Tomasz 6 2009 Tree-walking automata do not recognize all regular languages. Zbl 1172.68030Bojańczyk, Mikołaj; Colcombet, Thomas 6 2009 Deterministic automata and extensions of weak MSO. Zbl 1248.68285Bojańczyk, Mikołaj; Toruńczyk, Szymon 3 2009 Factorization forests. Zbl 1247.68127Bojańczyk, Mikołaj 1 2009 Tree-walking automata. Zbl 1156.68445Bojańczyk, Mikołaj 7 2008 Forest algebras. Zbl 1217.68123Bojańczyk, Mikołaj; Walukiewicz, Igor 6 2008 The common fragment of ACTL and LTL. Zbl 1139.68036Bojańczyk, Mikołaj 4 2008 Tree languages defined in first-order logic with one quantifier alternation. Zbl 1170.03019Bojańczyk, Mikołaj; Segoufin, Luc 3 2008 Shuffle expressions and words with nested data. Zbl 1147.68554Björklund, Henrik; Bojańczyk, Mikołaj 4 2007 Forest expressions. Zbl 1179.68068Bojańczyk, Mikołaj 3 2007 Bounded depth data trees. Zbl 1171.68432Björklund, Henrik; Bojańczyk, Mikołaj 2 2007 A new algorithm for testing if a regular language is locally threshold testable. Zbl 1184.68307Bojańczyk, Mikołaj 1 2007 Reachability in unions of commutative rewriting systems is decidable. Zbl 1186.68231Bojańczyk, Mikołaj; Hoffman, Piotr 1 2007 Expressive power of pebble automata. Zbl 1223.68065Bojańczyk, Mikołaj; Samuelides, Mathias; Schwentick, Thomas; Segoufin, Luc 8 2006 Characterizing EF and EX tree logics. Zbl 1097.03013Bojańczyk, Mikolaj; Walukiewicz, Igor 6 2006 Tree-walking automata cannot be determinized. Zbl 1086.68070Bojańczyk, Mikołaj; Colcombet, Thomas 5 2006 Tree-walking automata do not recognize all regular languages. Zbl 1192.68406Bojanczyk, Mikolaj; Colcombet, Thomas 6 2005 Characterizing EF and EX tree logics. Zbl 1097.03504Bojańczyk, Mikołaj; Walukiewicz, Igor 6 2004 A bounding quantifier. Zbl 1095.03007Bojańczyk, Mikołaj 5 2004 Tree-walking automata cannot be determinized. Zbl 1098.68620Bojańczyk, Mikołaj; Colcombet, Thomas 4 2004 1-bounded TWA cannot be determinized. Zbl 1205.68193Bojañczyk, Mikołaj 2 2003 The finite graph problem for two-way alternating automata. Zbl 1052.68069Bojańczyk, Mikołaj 1 2003 Two-way alternating automata and finite models. Zbl 1057.03029Bojańczyk, Mikołaj 3 2002 all cited Publications top 5 cited Publications all top 5 Cited by 271 Authors 9 Bojańczyk, Mikołaj 7 Skrzypczak, Michał 6 Lasota, Sławomir 5 Demri, Stéphane P. 5 Ésik, Zoltán 5 Gastin, Paul 5 Lazić, Ranko 4 Bollig, Benedikt 4 Héam, Pierre-Cyrille 4 Lohrey, Markus 4 Maneth, Sebastian 4 Place, Thomas 4 Schmitz, Sylvain 4 Schwentick, Thomas 4 Tan, Tony 4 Zeitoun, Marc 4 Zimmermann, Martín G. 3 Abriola, Sergio 3 Alur, Rajeev 3 Björklund, Henrik 3 Chen, Liang-Ting 3 Engelfriet, Joost 3 Figueira, Diego 3 Figueira, Santiago 3 Fisman, Dana 3 Gabbay, Murdoch James 3 Hugot, Vincent 3 Idziaszek, Tomasz 3 Keshvardoost, Khadijeh 3 Klin, Bartek 3 Kozen, Dexter C. 3 Libkin, Leonid O. 3 Mamouras, Konstantinos 3 Martens, Wim 3 Michalewski, Henryk 3 Milius, Stefan 3 Montanari, Angelo 3 Murlak, Filip 3 Sala, Pietro 3 Segoufin, Luc 3 Silva, Alexandra 3 Talbot, Jean-Marc 3 Urbat, Henning 2 Adámek, Jiří 2 Babari, Parvaneh 2 Bárány, Vince 2 Björklund, Johanna 2 Blumensath, Achim 2 Carapelle, Claudia 2 Cavallari, Filippo 2 Charatonik, Witold 2 Choffrut, Christian 2 David, Claire 2 Decker, Normann 2 Descotte, María Emilia 2 Deters, Morgan 2 Diekert, Volker 2 Droste, Manfred 2 Fervari, Raul 2 Filiot, Emmanuel 2 Grigorieff, Serge 2 Habermehl, Peter 2 Hofman, Piotr 2 Kartzow, Alexander 2 Kouchnarenko, Olga 2 Kufleitner, Manfred 2 Kupferman, Orna 2 Mahmoudi, Mojgan 2 Mio, Matteo 2 Monmege, Benjamin 2 Murawski, Andrzej S. 2 Muscholl, Anca 2 Neven, Frank 2 Nicaud, Cyril 2 Niehren, Joachim 2 Paredaens, Jan 2 Parys, Paweł 2 Pazzaglia, Marco 2 Perevoshchikov, Vitaly 2 Petrisan, Daniela Luan 2 Piterman, Nir 2 Pous, Damien 2 Raghothaman, Mukund 2 Reynier, Pierre-Alain 2 ten Cate, Balder David 2 Thoma, Daniel 2 Thomas, Wolfgang 2 Tzevelekos, Nikos 2 Weil, Pascal 2 Wu, Zhilin 1 Abdulla, Parosh Aziz 1 Abramsky, Samson 1 Aiswarya, Cyriac 1 Alirezazadeh, Saeid 1 Amano, Shun’ichi 1 Amarilli, Antoine 1 Antonopoulos, Timos 1 Areces, Carlos 1 Bárcenas, Everardo 1 Barozzini, David ...and 171 more Authors all top 5 Cited in 28 Serials 24 Theoretical Computer Science 15 Information and Computation 14 Journal of Computer and System Sciences 14 Logical Methods in Computer Science 8 Theory of Computing Systems 7 Information Processing Letters 7 ACM Transactions on Computational Logic 6 Journal of Logical and Algebraic Methods in Programming 5 Acta Informatica 4 International Journal of Foundations of Computer Science 3 MSCS. Mathematical Structures in Computer Science 3 Journal of the ACM 2 Journal of Pure and Applied Algebra 2 Journal of Applied Non-Classical Logics 2 RAIRO. Theoretical Informatics and Applications 1 Information Sciences 1 European Journal of Combinatorics 1 Annals of Pure and Applied Logic 1 Journal of Automated Reasoning 1 Formal Aspects of Computing 1 International Journal of Algebra and Computation 1 Archive for Mathematical Logic 1 Soft Computing 1 Discrete Mathematics and Theoretical Computer Science. DMTCS 1 RAIRO. Theoretical Informatics and Applications 1 The Journal of Logic and Algebraic Programming 1 Journal of Applied Logic 1 Axioms all top 5 Cited in 12 Fields 159 Computer science (68-XX) 82 Mathematical logic and foundations (03-XX) 7 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 6 Group theory and generalizations (20-XX) 4 Combinatorics (05-XX) 4 General algebraic systems (08-XX) 4 Category theory; homological algebra (18-XX) 2 History and biography (01-XX) 2 Order, lattices, ordered algebraic structures (06-XX) 1 Topological groups, Lie groups (22-XX) 1 Measure and integration (28-XX) 1 General topology (54-XX) Citations by Year Wikidata Timeline The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.