Mikołaj Bojańczyk | Academic Influence

Mikołaj Bojańczyk's AcademicInfluence.com Rankings

Mikołaj Bojańczyk

Computer Science

#3528

World Rank

#3701

Historical Rank

Theoretical Computer Science

#66

World Rank

#66

Historical Rank

computer-science Degrees

Mikołaj Bojańczyk

Philosophy

#6008

World Rank

#8966

Historical Rank

Mathematical Logic

#31

World Rank

#46

Historical Rank

Logic

#3204

World Rank

#4326

Historical Rank

philosophy Degrees

Download Badge

Computer Science
Philosophy

Mikołaj Bojańczyk's Degrees

PhD Computer Science University of Warsaw
Masters Mathematics University of Warsaw

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2024

Why Is Mikołaj Bojańczyk Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Mikołaj Bojańczyk is a Polish theoretical computer scientist and logician known for settling open problems on tree walking automata jointly with Thomas Colcombet, and for contributions to logic in automata theory. He is a professor at Warsaw University.

(See a Problem?)

Mikołaj Bojańczyk's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Two-Variable Logic on Words with Data (2006) (206)
Two-variable logic on data words (2011) (183)
Two-variable logic on data trees and XML reasoning (2006) (163)
Automata theory in nominal sets (2014) (113)
Automata with Group Actions (2011) (106)
Two-variable logic on data trees and XML reasoning (2009) (96)
Bounds in ω-regularity (75)
Bounds in w-Regularity (2006) (70)
Weak MSO with the Unbounding Quantifier (2009) (64)
Transducers with Origin Information (2013) (62)
Forest algebras (2008) (61)
Piecewise Testable Tree Languages (2008) (55)
Turing Machines with Atoms (2013) (54)
Recognisable Languages over Monads (2015) (53)
Towards nominal computation (2012) (53)
Tree-walking automata do not recognize all regular languages (2005) (52)
Weak MSO+U over infinite trees (2012) (46)
Characterizing EF and EX tree logics (2006) (45)
XPath evaluation in linear time (2008) (44)
Tree-Walking Automata Cannot Be Determinized (2006) (43)
An Extension of Data Automata that Captures XPath (2010) (42)
Expressive Power of Pebble Automata (2006) (40)
Definability equals recognizability for graphs of bounded treewidth * (2016) (38)
A Machine-Independent Characterization of Timed Languages (2012) (36)
Tree-Walking Automata (2008) (35)
Data Monoids (2011) (33)
The MSO+U theory of (N, <) is undecidable (2015) (33)
Wreath Products of Forest Algebras, with Applications to Tree Logics (2009) (29)
Factorization Forests (2009) (29)
A Bounding Quantifier (2004) (29)
Tree Languages Defined in First-Order Logic with One Quantifier Alternation (2008) (29)
Shuffle Expressions and Words with Nested Data (2007) (28)
Deterministic Automata and Extensions of Weak MSO (2009) (26)
Two-way unary temporal logic over trees (2007) (26)
Automata for Data Words and Data Trees (2010) (22)
XPath evaluation in linear time (2011) (22)
Algebra for Infinite Forests with an Application to the Temporal Logic EF (2009) (22)
Verification of database-driven systems via amalgamation (2013) (22)
Solutions in XML data exchange (2011) (20)
Bounded Depth Data Trees (2007) (19)
Two-Way Alternating Automata and Finite Models (2002) (19)
On the Decidability of MSO+U on Infinite Trees (2014) (19)
The Common Fragment of ACTL and LTL (2008) (18)
Nominal Monoids (2013) (18)
Which Classes of Origin Graphs Are Generated by Transducers (2017) (17)
Weak MSO+U with Path Quantifiers over Infinite Trees (2014) (17)
String-to-String Interpretations with Polynomial-Size Output (2019) (17)
Finite satisfiability for guarded fixpoint logic (2011) (17)
Optimizing Tree Decompositions in MSO (2017) (16)
Imperative Programming in Sets with Atoms (2012) (15)
Regular Languages of Thin Trees (2016) (14)
Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets (2012) (14)
Decidable Properties of Tree Languages (2004) (13)
A new algorithm for testing if a regular language is locally threshold testable (2007) (13)
Regular and First-Order List Functions (2018) (13)
Thin MSO with a Probabilistic Path Quantifier (2016) (12)
Effective characterizations of tree logics (2008) (11)
Emptiness of zero automata is decidable (2017) (10)
Star Height via Games (2015) (10)
Automata for Data Words and Data Trees: Invited Presentation at the First Symposium on Games, Automata, Logic, and Formal Verification (2010) (9)
Toward Model Theory with Data Values (2012) (9)
Single-Use Automata and Transducers for Infinite Alphabets (2020) (9)
The finite graph problem for two-way alternating automata (2001) (8)
Ramsey’s theorem for colors from a metric space (2012) (8)
Modelling Infinite Structures with Atoms (2013) (7)
Fraenkel-Mostowski Sets with Non-homogeneous Atoms (2012) (7)
Efficient Evaluation of Nondeterministic Automata Using Factorization Forests (2010) (7)
Decomposition theorems and model-checking for the modal μ-calculus (2014) (7)
Polyregular Functions (2018) (7)
Beyond omega-Regular Languages (2010) (7)
On the Borel Complexity of MSO Definable Sets of Branches (2010) (7)
Beyond ! -Regular Languages (2009) (7)
1-Bounded TWA Cannot Be Determinized (2003) (6)
Forest Expressions (2007) (6)
The Hilbert method for transducer equivalence (2019) (6)
Transducers of polynomial growth (2022) (5)
Undecidability of MSO+"ultimately periodic" (2018) (5)
MSO+∇ is undecidable (2019) (4)
On the Regular Emptiness Problem of Subzero Automata (2016) (4)
Boundedness in languages of infinite words (2017) (4)
On computability and tractability for infinite sets (2018) (4)
Unranked Tree Algebra (2005) (4)
Containment of Monadic Datalog Programs via Bounded Clique-Width (2015) (4)
Algorithms for regular languages that use algebra (2012) (4)
Orbit-Finite Sets and Their Algorithms (Invited Talk) (2017) (3)
Nominal Computation Theory (Dagstuhl Seminar 13422) (2013) (3)
Two monads for graphs (2018) (3)
Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers (2020) (3)
Efficient evaluation for a temporal logic on changing XML documents (2011) (3)
Separator logic and star-free expressions for graphs (2021) (3)
Extensions of ω-Regular Languages (2020) (3)
Definable decompositions for graphs of bounded linear cliquewidth (2018) (3)
A non-regular language of infinite trees that is recognizable by a finite algebra (2018) (3)
It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton (2017) (3)
Constraint Satisfaction Problem and Universal Algebra (2014) (2)
Decidable classes of documents for XPath (2012) (2)
MSO+nabla is undecidable (2019) (2)
Single use register automata for data words (2019) (2)
Automata column (2016) (2)
Algebra for trees (2021) (2)
Automata column (2016) (1)
Automata column (2018) (1)
Reachability in Unions of Commutative Rewriting Systems Is Decidable (2007) (1)
Expressive power of pebbles Automata (2006) (1)
Rigidity is undecidable (2012) (1)
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 (2019) (1)
Automata column (2018) (1)
Undecidability of a weak version of MSO+U (2018) (1)
Regular tree languages in low levels of Wadge Hierarchy (2018) (1)
Minimization of semilinear automata (2012) (1)
Algebra for Tree Languages (2009) (1)
ICALP 2022 - 49th EATCS International Colloquium on Automata, Languages and Programming (2021) (1)
Nominal Monoids (2013) (0)
Regular Languages of Thin Trees (2015) (0)
Orbit-Finite Sets and Their Algorithms ∗ † (2017) (0)
Automata column (2016) (0)
Automata column (2017) (0)
Automata column (2018) (0)
EATCS Fellows 2020 - Call for Nominations (2019) (0)
Some connections between universal algebra and logics for trees (2017) (0)
URL: www.mimuw.edu.pl/∼bojan (2010) (0)
Automata column (2016) (0)
41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference (2021) (0)
EATCS-Fellows 2021 (2021) (0)
Preface (2021) (0)
EATCS Fellows 2021 - Call for Nominations (2020) (0)
Circuits, Logic and Games (Dagstuhl Seminar 15401) (2015) (0)
Automata Column (2019) (0)
Structural properties of trees and expressivity of logical formalisms (2013) (0)
Automata column (2015) (0)
Automata column (2014) (0)
Decidable Extensions of MSO (2016) (0)
Foreword (2010) (0)
Ramsey’s theorem for colors from a metric space (2012) (0)
Automata column (2017) (0)
Nominal Monoids Miko laj Bojańczyk (2013) (0)
Automata and Algebras for Infinite Words and Trees (2013) (0)
Two Variable FO on Two Successors (2010) (0)
Automata column (2017) (0)
McNaughton's theorem (2015) (0)

This paper list is powered by the following services:

Other Resources About Mikołaj Bojańczyk

What Schools Are Affiliated With Mikołaj Bojańczyk?

Mikołaj Bojańczyk is affiliated with the following schools:

University of Warsaw