Mikolaj Bojanczyk

According to our database1, Mikolaj Bojanczyk authored at least 106 papers between 2001 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
The Hilbert method for transducer equivalence.
SIGLOG News, 2019

Automata Column.
SIGLOG News, 2019

String-to-String Interpretations With Polynomial-Size Output.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Automata column.
SIGLOG News, 2018

Automata column.
SIGLOG News, 2018

Automata column.
SIGLOG News, 2018

On computability and tractability for infinite sets.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Definable decompositions for graphs of bounded linear cliquewidth.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Regular and First-Order List Functions.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
Automata column.
SIGLOG News, 2017

Automata column.
SIGLOG News, 2017

Automata column.
SIGLOG News, 2017

Boundedness in languages of infinite words.
Logical Methods in Computer Science, 2017

It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton.
Fundam. Inform., 2017

Optimizing Tree Decompositions in MSO.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Emptiness of Zero Automata Is Decidable.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Which Classes of Origin Graphs Are Generated by Transducers.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Orbit-Finite Sets and Their Algorithms (Invited Talk).
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Automata column.
SIGLOG News, 2016

Automata column.
SIGLOG News, 2016

Automata column.
SIGLOG News, 2016

Regular Languages of Thin Trees.
Theory Comput. Syst., 2016

On the Regular Emptiness Problem of Subzero Automata.
Proceedings of the Proceedings 9th Interaction and Concurrency Experience, 2016

The MSO+U Theory of (N, <) Is Undecidable.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Decidable Extensions of MSO.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Definability equals recognizability for graphs of bounded treewidth.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Thin MSO with a Probabilistic Path Quantifier.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Automata column.
SIGLOG News, 2015

Automata column.
SIGLOG News, 2015

McNaughton's theorem.
SIGLOG News, 2015

Circuits, Logic and Games (Dagstuhl Seminar 15401).
Dagstuhl Reports, 2015

Star Height via Games.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Containment of Monadic Datalog Programs via Bounded Clique-Width.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Recognisable Languages over Monads.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014
Automata column.
SIGLOG News, 2014

Automata column.
SIGLOG News, 2014

Rigidity is undecidable.
Mathematical Structures in Computer Science, 2014

Automata theory in nominal sets.
Logical Methods in Computer Science, 2014

On the Decidability of MSO+U on Infinite Trees.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Weak MSO+U with Path Quantifiers over Infinite Trees.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Transducers with Origin Information.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Decomposition theorems and model-checking for the modal μ-calculus.
Proceedings of the 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), 2014

2013
Nominal Monoids.
Theory Comput. Syst., 2013

Nominal Computation Theory (Dagstuhl Seminar 13422).
Dagstuhl Reports, 2013

Modelling Infinite Structures with Atoms.
Proceedings of the Logic, Language, Information, and Computation, 2013

Regular languages of thin trees.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Verification of database-driven systems via amalgamation.
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013

Turing Machines with Atoms.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Automata and Algebras for Infinite Words and Trees.
Proceedings of the Algebra and Coalgebra in Computer Science, 2013

2012
Algorithms for regular languages that use algebra.
SIGMOD Record, 2012

Finite satisfiability for guarded fixpoint logic.
Inf. Process. Lett., 2012

Wreath Products of Forest Algebras, with Applications to Tree Logics
Logical Methods in Computer Science, 2012

Piecewise testable tree languages
Logical Methods in Computer Science, 2012

An extension of data automata that captures XPath
Logical Methods in Computer Science, 2012

Weak MSO+U over infinite trees.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Fraenkel-Mostowski Sets with Non-homogeneous Atoms.
Proceedings of the Reachability Problems - 6th International Workshop, 2012

Towards nominal computation.
Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

Toward Model Theory with Data Values.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

A Machine-Independent Characterization of Timed Languages.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Imperative Programming in Sets with Atoms.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Decidable classes of documents for XPath.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011
Two-variable logic on data words.
ACM Trans. Comput. Log., 2011

Foreword.
Theory Comput. Syst., 2011

Data Monoids.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Efficient evaluation for a temporal logic on changing XML documents.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

Automata with Group Actions.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Solutions in XML data exchange.
Proceedings of the Database Theory, 2011

2010
On the Borel Complexity of MSO Definable Sets of Branches.
Fundam. Inform., 2010

Tree Languages Defined in First-Order Logic with One Quantifier Alternation
Logical Methods in Computer Science, 2010

Beyond omega-Regular Languages.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Automata for Data Words and Data Trees.
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

An Extension of Data Automata that Captures XPath.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

Efficient Evaluation of Nondeterministic Automata Using Factorization Forests.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Two-variable logic on data trees and XML reasoning.
J. ACM, 2009

Two-Way Unary Temporal Logic over Trees
Logical Methods in Computer Science, 2009

Weak MSO with the Unbounding Quantifier.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Wreath Products of Forest Algebras, with Applications to Tree Logics.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

Deterministic Automata and Extensions of Weak MSO.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

Factorization Forests.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

Algebra for Tree Languages.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

Algebra for Infinite Forests with an Application to the Temporal Logic EF.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
Effective characterizations of tree logics.
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

XPath evaluation in linear time.
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

Piecewise Testable Tree Languages.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

Tree-Walking Automata.
Proceedings of the Language and Automata Theory and Applications, 2008

Tree Languages Defined in First-Order Logic with One Quantifier Alternation.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

The Common Fragment of ACTL and LTL.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

Forest algebras.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007
A new algorithm for testing if a regular language is locally threshold testable.
Inf. Process. Lett., 2007

Reachability in Unions of Commutative Rewriting Systems Is Decidable.
Proceedings of the STACS 2007, 2007

Shuffle Expressions and Words with Nested Data.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Two-way unary temporal logic over trees.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Bounded Depth Data Trees.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Forest Expressions.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006
Two-variable logic on data trees and XML reasoning.
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

Two-Variable Logic on Words with Data.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Bounds in w-Regularity.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Expressive Power of Pebble Automata.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Tree-walking automata do not recognize all regular languages.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2004
Tree-Walking Automata Cannot Be Determinized.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

A Bounding Quantifier.
Proceedings of the Computer Science Logic, 18th International Workshop, 2004

Characterizing EF and EX Tree Logics.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
1-Bounded TWA Cannot Be Determinized.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002
Two-Way Alternating Automata and Finite Models.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
The Finite Graph Problem for Two-Way Alternating Automata.
Proceedings of the Foundations of Software Science and Computation Structures, 2001


  Loading...