| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Vince Bárány, Mikolaj Bojanczyk |
Finite satisfiability for guarded fixpoint logic.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Slawomir Lasota |
An extension of data automata that captures XPath |
Logical Methods in Computer Science |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Stanislaw Szawiel, Marek W. Zawadowski |
Rigidity is undecidable |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Szymon Torunczyk |
Weak MSO+U over infinite trees. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, Slawomir Lasota |
Towards nominal computation. |
POPL |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Pawel Parys |
XPath evaluation in linear time. |
J. ACM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vince Bárány, Mikolaj Bojanczyk |
Finite Satisfiability for Guarded Fixpoint Logic |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Albert Atserias, Mikolaj Bojanczyk, Balder ten Cate, Ronald Fagin, Floris Geerts, Kenneth Ross |
Foreword. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
Weak MSO with the Unbounding Quantifier. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin |
Two-variable logic on data words. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
Data Monoids. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak |
Solutions in XML data exchange. |
ICDT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota |
Automata with Group Actions. |
LICS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Diego Figueira |
Efficient evaluation for a temporal logic on changing XML documents. |
PODS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabinovich, Adam Radziwonczyk-Syta, Michal Skrzypczak |
On the Borel Complexity of MSO Definable Sets of Branches. |
Fundam. Inform. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Luc Segoufin |
Tree Languages Defined in First-Order Logic with One Quantifier Alternation |
Logical Methods in Computer Science |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Pawel Parys |
Efficient Evaluation of Nondeterministic Automata Using Factorization Forests. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
Beyond omega-Regular Languages. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
Automata for Data Words and Data Trees. |
RTA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Slawomir Lasota |
An Extension of Data Automata that Captures XPath. |
LICS |
2010 |
DBLP DOI BibTeX RDF |
Regular XPath, data automata, register automata |
| 1 | Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin |
Two-variable logic on data trees and XML reasoning. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
XML, consistency, Integrity constraints, DTDs, implications |
| 1 | Mikolaj Bojanczyk |
Two-Way Unary Temporal Logic over Trees |
Logical Methods in Computer Science |
2009 |
DBLP BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
Weak Mso with the Unbounding Quantifier |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Tomasz Idziaszek |
Algebra for Infinite Forests with an Application to the Temporal Logic EF. |
CONCUR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
Weak MSO with the Unbounding Quantifier. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
Factorization Forests. |
Developments in Language Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz |
Wreath Products of Forest Algebras, with Applications to Tree Logics. |
LICS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
Algebra for Tree Languages. |
CSL |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Szymon Torunczyk |
Deterministic Automata and Extensions of Weak MSO. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Thomas Colcombet |
Tree-Walking Automata Do Not Recognize All Regular Languages. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
Tree-Walking Automata. |
LATA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Luc Segoufin |
Tree Languages Defined in First-Order Logic with One Quantifier Alternation. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Igor Walukiewicz |
Forest algebras. |
Logic and Automata |
2008 |
DBLP BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing |
Piecewise Testable Tree Languages. |
LICS |
2008 |
DBLP DOI BibTeX RDF |
logic, algebra, tree automata |
| 1 | Mikolaj Bojanczyk, Pawel Parys |
XPath evaluation in linear time. |
PODS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
The Common Fragment of ACTL and LTL. |
FoSSaCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
A new algorithm for testing if a regular language is locally threshold testable. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Mikolaj Bojanczyk |
Bounded Depth Data Trees. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Mikolaj Bojanczyk |
Shuffle Expressions and Words with Nested Data. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Piotr Hoffman |
Reachability in Unions of Commutative Rewriting Systems Is Decidable. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
Topic classification Logic in computer science, rewriting |
| 1 | Mikolaj Bojanczyk |
Two-way unary temporal logic over trees. |
LICS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
Forest Expressions. |
CSL |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Igor Walukiewicz |
Characterizing EF and EX tree logics. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Thomas Colcombet |
Tree-walking automata cannot be determinized. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin |
Expressive Power of Pebble Automata. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David |
Two-Variable Logic on Words with Data. |
LICS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Thomas Colcombet |
Bounds in w-Regularity. |
LICS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin |
Two-variable logic on data trees and XML reasoning. |
PODS |
2006 |
DBLP DOI BibTeX RDF |
data trees, first-order logic, decidability |
| 1 | Mikolaj Bojanczyk, Thomas Colcombet |
Tree-walking automata do not recognize all regular languages. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Igor Walukiewicz |
Characterizing EF and EX Tree Logics. |
CONCUR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Thomas Colcombet |
Tree-Walking Automata Cannot Be Determinized. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
A Bounding Quantifier. |
CSL |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
The finite graph problem for two-way alternating automata. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
1-Bounded TWA Cannot Be Determinized. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
Two-Way Alternating Automata and Finite Models. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
The Finite Graph Problem for Two-Way Alternating Automata. |
FoSSaCS |
2001 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")