Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Mikolaj Bojanczyk
2010 – today
- 2013
[j20]Mikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak: Solutions in XML data exchange. J. Comput. Syst. Sci. 79(6): 785-815 (2013)- [j19]
- [c46]Mikolaj Bojanczyk, Tomasz Idziaszek, Michal Skrzypczak: Regular languages of thin trees. STACS 2013: 562-573
- 2012
- [j18]Mikolaj Bojanczyk, Slawomir Lasota: An extension of data automata that captures XPath. Logical Methods in Computer Science 8(1) (2012)
- [j17]Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing: Piecewise testable tree languages. Logical Methods in Computer Science 8(3) (2012)
- [j16]Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz: Wreath Products of Forest Algebras, with Applications to Tree Logics. Logical Methods in Computer Science 8(3) (2012)
- [j15]Vince Bárány, Mikolaj Bojanczyk: Finite satisfiability for guarded fixpoint logic. Inf. Process. Lett. 112(10): 371-375 (2012)
- [j14]Mikolaj Bojanczyk: Algorithms for regular languages that use algebra. SIGMOD Record 41(2): 5-14 (2012)
- [c45]
- [c44]Vince Bárány, Mikolaj Bojanczyk, Diego Figueira, Pawel Parys: Decidable classes of documents for XPath. FSTTCS 2012: 99-111
- [c43]Mikolaj Bojanczyk, Slawomir Lasota: A Machine-Independent Characterization of Timed Languages. ICALP (2) 2012: 92-103
- [c42]Mikolaj Bojanczyk, Thomas Place: Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets. ICALP (2) 2012: 104-115
- [c41]
- [c40]Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, Slawomir Lasota: Towards nominal computation. POPL 2012: 401-412
- [c39]Mikolaj Bojanczyk, Slawomir Lasota: Fraenkel-Mostowski Sets with Non-homogeneous Atoms. RP 2012: 1-5
- [c38]
- [i4]Mikolaj Bojanczyk, Stanislaw Szawiel, Marek W. Zawadowski: Rigidity is undecidable. CoRR abs/1204.4906 (2012)
- [i3]
- 2011
- [j13]
- [j12]Mikolaj Bojanczyk: Weak MSO with the Unbounding Quantifier. Theory Comput. Syst. 48(3): 554-576 (2011)
- [j11]Albert Atserias, Mikolaj Bojanczyk, Balder ten Cate, Ronald Fagin, Floris Geerts, Kenneth Ross: Foreword. Theory Comput. Syst. 49(2): 365-366 (2011)
- [j10]Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin: Two-variable logic on data words. ACM Trans. Comput. Log. 12(4): 27 (2011)
- [c37]Mikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak: Solutions in XML data exchange. ICDT 2011: 102-113
- [c36]
- [c35]Mikolaj Bojanczyk, Diego Figueira: Efficient evaluation for a temporal logic on changing XML documents. PODS 2011: 259-270
- [c34]
- [i2]Vince Bárány, Mikolaj Bojanczyk: Finite Satisfiability for Guarded Fixpoint Logic. CoRR abs/1104.2262 (2011)
- 2010
- [j9]Mikolaj Bojanczyk, Luc Segoufin: Tree Languages Defined in First-Order Logic with One Quantifier Alternation. Logical Methods in Computer Science 6(4) (2010)
- [j8]Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabinovich, Adam Radziwonczyk-Syta, Michal Skrzypczak: On the Borel Complexity of MSO Definable Sets of Branches. Fundam. Inform. 98(4): 337-349 (2010)
- [c33]Mikolaj Bojanczyk, Pawel Parys: Efficient Evaluation of Nondeterministic Automata Using Factorization Forests. ICALP (1) 2010: 515-526
- [c32]Mikolaj Bojanczyk, Slawomir Lasota: An Extension of Data Automata that Captures XPath. LICS 2010: 243-252
- [c31]
- [c30]
2000 – 2009
- 2009
- [j7]Mikolaj Bojanczyk: Two-Way Unary Temporal Logic over Trees. Logical Methods in Computer Science 5(3) (2009)
- [j6]Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin: Two-variable logic on data trees and XML reasoning. J. ACM 56(3) (2009)
- [c29]Mikolaj Bojanczyk, Tomasz Idziaszek: Algebra for Infinite Forests with an Application to the Temporal Logic EF. CONCUR 2009: 131-145
- [c28]
- [c27]
- [c26]Mikolaj Bojanczyk, Szymon Torunczyk: Deterministic Automata and Extensions of Weak MSO. FSTTCS 2009: 73-84
- [c25]Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz: Wreath Products of Forest Algebras, with Applications to Tree Logics. LICS 2009: 255-263
- [c24]
- [i1]
- 2008
- [j5]Mikolaj Bojanczyk, Thomas Colcombet: Tree-Walking Automata Do Not Recognize All Regular Languages. SIAM J. Comput. 38(2): 658-701 (2008)
- [c23]
- [c22]
- [c21]Mikolaj Bojanczyk, Luc Segoufin: Tree Languages Defined in First-Order Logic with One Quantifier Alternation. ICALP (2) 2008: 233-245
- [c20]
- [c19]Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing: Piecewise Testable Tree Languages. LICS 2008: 442-451
- [c18]
- [c17]
- 2007
- [j4]Mikolaj Bojanczyk: A new algorithm for testing if a regular language is locally threshold testable. Inf. Process. Lett. 104(3): 91-94 (2007)
- [c16]
- [c15]
- [c14]
- [c13]Henrik Björklund, Mikolaj Bojanczyk: Shuffle Expressions and Words with Nested Data. MFCS 2007: 750-761
- [c12]Mikolaj Bojanczyk, Piotr Hoffman: Reachability in Unions of Commutative Rewriting Systems Is Decidable. STACS 2007: 622-633
- 2006
- [j3]Mikolaj Bojanczyk, Thomas Colcombet: Tree-walking automata cannot be determinized. Theor. Comput. Sci. 350(2-3): 164-173 (2006)
- [j2]Mikolaj Bojanczyk, Igor Walukiewicz: Characterizing EF and EX tree logics. Theor. Comput. Sci. 358(2-3): 255-272 (2006)
- [c11]Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin: Expressive Power of Pebble Automata. ICALP (1) 2006: 157-168
- [c10]Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David: Two-Variable Logic on Words with Data. LICS 2006: 7-16
- [c9]
- [c8]Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin: Two-variable logic on data trees and XML reasoning. PODS 2006: 10-19
- 2005
- [c7]Mikolaj Bojanczyk, Thomas Colcombet: Tree-walking automata do not recognize all regular languages. STOC 2005: 234-243
- 2004
- [c6]
- [c5]
- [c4]Mikolaj Bojanczyk, Thomas Colcombet: Tree-Walking Automata Cannot Be Determinized. ICALP 2004: 246-256
- 2003
- [j1]Mikolaj Bojanczyk: The finite graph problem for two-way alternating automata. Theor. Comput. Sci. 3(298): 511-528 (2003)
- [c3]
- 2002
- [c2]
- 2001
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 09:51 CEST by the dblp team