The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Mikolaj Bojanczyk: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mikolaj Bojanczyk, Igor Walukiewicz
    Characterizing EF and EX Tree Logics. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:131-145 [Conf]
  2. Mikolaj Bojanczyk
    A Bounding Quantifier. [Citation Graph (0, 0)][DBLP]
    CSL, 2004, pp:41-55 [Conf]
  3. Mikolaj Bojanczyk
    The Finite Graph Problem for Two-Way Alternating Automata. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:88-103 [Conf]
  4. Mikolaj Bojanczyk
    1-Bounded TWA Cannot Be Determinized. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:62-73 [Conf]
  5. Mikolaj Bojanczyk
    Two-Way Alternating Automata and Finite Models. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:833-844 [Conf]
  6. Mikolaj Bojanczyk, Thomas Colcombet
    Tree-Walking Automata Cannot Be Determinized. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:246-256 [Conf]
  7. Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin
    Expressive Power of Pebble Automata. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:157-168 [Conf]
  8. Mikolaj Bojanczyk, Thomas Colcombet
    Bounds in w-Regularity. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:285-296 [Conf]
  9. Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David
    Two-Variable Logic on Words with Data. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:7-16 [Conf]
  10. Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin
    Two-variable logic on data trees and XML reasoning. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:10-19 [Conf]
  11. Mikolaj Bojanczyk, Piotr Hoffman
    Reachability in Unions of Commutative Rewriting Systems Is Decidable. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:622-633 [Conf]
  12. Mikolaj Bojanczyk, Thomas Colcombet
    Tree-walking automata do not recognize all regular languages. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:234-243 [Conf]
  13. Mikolaj Bojanczyk
    The finite graph problem for two-way alternating automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:3, n:298, pp:511-528 [Journal]
  14. Mikolaj Bojanczyk, Thomas Colcombet
    Tree-walking automata cannot be determinized. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:350, n:2-3, pp:164-173 [Journal]
  15. Mikolaj Bojanczyk, Igor Walukiewicz
    Characterizing EF and EX tree logics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:358, n:2-3, pp:255-272 [Journal]
  16. Mikolaj Bojanczyk
    Forest Expressions. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:146-160 [Conf]
  17. Henrik Björklund, Mikolaj Bojanczyk
    Bounded Depth Data Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:862-874 [Conf]
  18. Mikolaj Bojanczyk
    Two-way unary temporal logic over trees. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:121-130 [Conf]
  19. Henrik Björklund, Mikolaj Bojanczyk
    Shuffle Expressions and Words with Nested Data. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:750-761 [Conf]
  20. Mikolaj Bojanczyk
    A new algorithm for testing if a regular language is locally threshold testable. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:3, pp:91-94 [Journal]

  21. Algebra for Infinite Forests with an Application to the Temporal Logic EF. [Citation Graph (, )][DBLP]


  22. Algebra for Tree Languages. [Citation Graph (, )][DBLP]


  23. Factorization Forests. [Citation Graph (, )][DBLP]


  24. The Common Fragment of ACTL and LTL. [Citation Graph (, )][DBLP]


  25. Deterministic Automata and Extensions of Weak MSO. [Citation Graph (, )][DBLP]


  26. Tree Languages Defined in First-Order Logic with One Quantifier Alternation. [Citation Graph (, )][DBLP]


  27. Efficient Evaluation of Nondeterministic Automata Using Factorization Forests. [Citation Graph (, )][DBLP]


  28. Piecewise Testable Tree Languages. [Citation Graph (, )][DBLP]


  29. Wreath Products of Forest Algebras, with Applications to Tree Logics. [Citation Graph (, )][DBLP]


  30. An Extension of Data Automata that Captures XPath. [Citation Graph (, )][DBLP]


  31. XPath evaluation in linear time. [Citation Graph (, )][DBLP]


  32. Automata for Data Words and Data Trees. [Citation Graph (, )][DBLP]


  33. Beyond omega-Regular Languages. [Citation Graph (, )][DBLP]


  34. Weak MSO with the Unbounding Quantifier. [Citation Graph (, )][DBLP]


  35. Tree-Walking Automata. [Citation Graph (, )][DBLP]


  36. Weak Mso with the Unbounding Quantifier [Citation Graph (, )][DBLP]


  37. Two-Way Unary Temporal Logic over Trees [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.305secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002