MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 13 documents:

  1. A really Simple Approximation of Smallest Grammar
    Artur Jez
    In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), Moscow, Russia, 2014, 182-191
  2. Approximation of smallest linear tree grammar
    Artur Jez and Markus Lohrey
    In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), Lyon, France, 2014, 445-457

  3. Computational completeness of equations over sets of natural numbers
    Artur Jez and Alexander Okhotin
    Information and Computation 237: 56-94, 2014
  4. Context Unification is in PSPACE
    Artur Jez
    In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), Copenhagen, Denmark, 2014, 244-255
  5. Finding All Solutions of Equations in Free Groups and Monoids with Involution
    Volker Diekert, Artur Jez, and Wojciech Plandowski
    In: 9th International Computer Science Symposium in Russia (CSR 2014), Moscow, Russia, 2014, 1-15
  6. The Complexity of Compressed Membership Problems for Finite Automata
    Artur Jez
    Theory of Computing Systems 55 (4): 685-718, 2014
  7. Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
    Pawel Gawrychowski, Artur Jez, and Lukasz Jez
    Theory of Computing Systems 54 (2): 337-372, 2014
  8. Approximation of Grammar-Based Compression via Recompression
    Artur Jez
    In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), Bad Herrenalb, Germany, 2013, 165-176. Note: Full version at http://arxiv.org/abs/1301.5842

  9. Hyper-minimization for deterministic tree automata
    Artur Jez and Andreas Maletti
    International Journal of Foundations of Computer Science 24 (6): 815-830, 2013
  10. One-Variable Word Equations in Linear Time
    Artur Jez
    In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), Latvia, Riga, 2013, 324-335. Note: Full version available at http://arxiv.org/abs/1111.3244

  11. Recompression: a simple and powerful technique for word equations
    Artur Jez
    In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Kiel, Germany, 2013, 233-244
    [PDF: Download: 25.pdf]
  12. Recompression: Word Equations and Beyond
    Artur Jez
    In: 17th International Conference on Developments in Language Theory (DLT 2013), Marne-la-Vallée, France, 2013, 12-26

  13. Unambiguous Conjunctive Grammars over a One-Letter Alphabet
    Artur Jez and Alexander Okhotin
    In: 17th International Conference on Developments in Language Theory (DLT 2013), Marne-la-Vallée, France, 2013, 277-288