| ||
| 1. | Algorithms for regular languages that use algebra
SIAM JOURNAL ON COMPUTING Vol. 41 Nr 2 yr. 2012, pp. 5-14 (Article) Mikołaj Bojańczyk | |
| 2. | An extension of data automata that captures XPath
LOGICAL METHODS IN COMPUTER SCIENCE Vol. 8 Nr 1 yr. 2012, pp. (Article) Mikołaj Bojańczyk, Sławomir Lasota | |
| 3. | Finite satisfiability for guarded fixpoint logic
INFORMATION PROCESSING LETTERS Vol. 112 Nr 10 yr. 2012, pp. 371-375 (Article) Vince Bárány, Mikołaj Bojańczyk | |
| 4. | Piecewise testable tree languages
LOGICAL METHODS IN COMPUTER SCIENCE Vol. 8 Nr 3 yr. 2012, pp. (Article) Mikołaj Bojańczyk, Luc Segoufin, Howard Straubing | |
| 5. | Wreath Products of Forest Algebras, with Applications to Tree Logics
LOGICAL METHODS IN COMPUTER SCIENCE Vol. 8 Nr 3 yr. 2012, pp. 1-39 (Article) Mikołaj Bojańczyk, Howard Straubing, Igor Walukiewicz | |
| 6. | Foreword
THEORY OF COMPUTING SYSTEMS Vol. 49 Nr 2 yr. 2011, pp. 365-366 (Article) Albert Atserias, Mikołaj Bojańczyk, Balder ten Cate, Ronald Fagin, Floris Geerts, Kenneth Ross | |
| 7. | Two-variable logic on data words
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC Vol. 12 Nr 4 yr. 2011, pp. (Article) Mikołaj Bojańczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin | |
| 8. | Weak MSO with the Unbounding Quantifier
THEORY OF COMPUTING SYSTEMS Vol. 48 Nr 3 yr. 2011, pp. 554-576 (Article) Mikołaj Bojańczyk | |
| 9. | XPath evaluation in linear time
JOURNAL OF THE ACM Vol. 58 Nr 4 yr. 2011, pp. 17-17 (Article) Paweł Parys, Mikołaj Bojańczyk | |
| 10. | Efficient Evaluation of Nondeterministic Automata Using Factorization Forests
LECTURE NOTES IN COMPUTER SCIENCE Vol. 6198 yr. 2010, pp. 515-526 (Article) Mikołaj Bojańczyk, Paweł Parys | |
| 11. | On the Borel Complexity of MSO Definable Sets of Branches
FUNDAMENTA INFORMATICAE Vol. 98 Nr 4 yr. 2010, pp. 337-349 (Article) Mikołaj Bojańczyk, Damian Niwiński, Alexander Rabinovich, Adam Radziwonczyk-Syta, Michał Skrzypczak | |
| 12. | Tree Languages Defined in First-Order Logic with One Quantifier Alternation
LOGICAL METHODS IN COMPUTER SCIENCE Vol. 6 Nr 4 yr. 2010, pp. 1-26 (Article) Mikołaj Bojańczyk, Luc Segoufin | |
| 13. | Algebra for Infinite Forests with an Application to the Temporal Logic EF
LECTURE NOTES IN COMPUTER SCIENCE Vol. 5710 yr. 2009, pp. 131-145 (Article) Mikołaj Bojańczyk, Tomasz Idziaszek | |
| 14. | Algebra for Tree Languages
LECTURE NOTES IN COMPUTER SCIENCE Vol. 5771 yr. 2009, pp. 1-1 (Conference article) Mikołaj Bojańczyk | |
| 15. | Factorization Forests
LECTURE NOTES IN COMPUTER SCIENCE Vol. 5583 yr. 2009, pp. 1-17 (Conference article) Mikołaj Bojańczyk | |
| 16. | Two-variable logic on data trees and XML reasoning
JOURNAL OF THE ACM Vol. 56 Nr 3 yr. 2009, pp. (Article) Mikołaj Bojańczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin | |
| 17. | Two-Way Unary Temporal Logic over Trees
[ LINK ]
LOGICAL METHODS IN COMPUTER SCIENCE Vol. 5 Nr 3 yr. 2009, pp. 1-29 (Article) Mikołaj Bojańczyk | |
| 18. | The Common Fragment of ACTL and LTL
LECTURE NOTES IN COMPUTER SCIENCE Vol. 4962 yr. 2008, pp. 172-185 (Article) Mikołaj Bojańczyk | |
| 19. | Tree Languages Defined in First-Order Logic with One Quantifier Alternation
LECTURE NOTES IN COMPUTER SCIENCE Vol. 5126 yr. 2008, pp. 233-245 (Article) Mikołaj Bojańczyk, Luc Segoufin | |
| 20. | Tree-Walking Automata
LECTURE NOTES IN COMPUTER SCIENCE Vol. 5196 yr. 2008, pp. 1-2 (Article) Mikołaj Bojańczyk | |
| 21. | Tree-Walking Automata Do Not Recognize All Regular Languages
SIAM JOURNAL ON COMPUTING Vol. 38 Nr 2 yr. 2008, pp. 658-701 (Article) Mikołaj Bojańczyk, Thomas Colcombet | |
| 22. | A new algorithm for testing if a regular language is locally threshold testable
INFORMATION PROCESSING LETTERS Vol. 104 Nr 3 yr. 2007, pp. 91-94 (Article) Mikołaj Bojańczyk | |
| 23. | Bounded Depth Data Trees
LECTURE NOTES IN COMPUTER SCIENCE Vol. 4596 yr. 2007, pp. 862-874 (Conference article) Henrik Bjorklund, Mikołaj Bojańczyk | |
| 24. | Forest Expressions
LECTURE NOTES IN COMPUTER SCIENCE Vol. 4646 yr. 2007, pp. 146-160 (Conference article) Mikołaj Bojańczyk | |
| 25. | Reachability in Unions of Commutative Rewriting Systems Is Decidable
LECTURE NOTES IN COMPUTER SCIENCE Vol. 4393 yr. 2007, pp. 622-633 (Conference article) Piotr Hoffman, Mikołaj Bojańczyk | |