Aspects of grammar compression

2017/26/E/ST6/00191

Keywords

Descriptors

  • ST6_6: Algorytmika, algorytmy równoległe, rozproszone i sieciowe, algorytmiczna teoria gier
  • ST6_4: Metody formalne, teoretyczne podstawy informatyki w tym informatyka teoretyczna

Panel

ST6 – Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems

Host institution

Uniwersytet Wrocławski, Wydział Matematyki i Informatyki

Voivodeship: dolnośląskie

Other projects carried out by the institution »

Principal investigator (from the host institution)

dr hab. Artur Jeż

Number of co-investigators in the project: 8

Call

SONATA BIS 7 – announced on 2017-06-14

Amount awarded
1 760 200 PLN
Project start date
2018-04-20
Project end date
2023-10-19
Project duration
66 months (the same as in the proposal)
Project status
Project settled

Project description

Download the project description in a pdf file

Note — project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.

Information in the final report

Publication in academic press/journals (2)

  1. The Smallest Grammar Problem Revisited

    Authors:
    Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jeż, Markus Lohrey, Carl Philipp Reh
    Academic press:
    IEEE Transactions on Information Theory (year: 2021, volume: 2,79236111111111, pages: 317–328), Publisher: IEEE
    Status:
    Published
    DOI:
    10.1109/TIT.2020.3038147 – link to the publication
  2. Balancing Straight-line Programs

    Authors:
    Moses Ganardi, Artur Jeż, Markus Lohrey
    Academic press:
    Journal of the ACM (year: 2021, volume: 2,83611111111111, pages: 27:1–27:40), Publisher: ACM
    Status:
    Published
    DOI:
    10.1145/3457389 – link to the publication

Articles in post-conference publications (9)

  1. Solving Word Equations (And Other Unification Problems) by Recompression

    Authors:
    Artur Jeż
    Conference:
    28th EACSL Annual Conference on Computer Science Logic (CSL 2020) (year: 2020, pages: 3:1–3:17), Publisher: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
    Date:
    conference 13–16.01.2020
    Status:
    Published
    DOI:
    link to the publication
  2. Using Statistical Encoding to Achieve Tree Succinctness Never Seen Before

    Authors:
    Michał Gańczorz
    Conference:
    37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020) (year: 2020, pages: 22:1–22:29), Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
    Date:
    conference 10–13.03.2020
    Status:
    Published
    DOI:
    link to the publication
  3. Data Path Queries over Embedded Graph Databases

    Authors:
    Diego Figueira, Artur Jeż, Anthony W. Lin
    Conference:
    International Conference on Management of Data (PODS '22); dawniej Principles of Database Systems (year: 2022, pages: 189–201), Publisher: ACM
    Date:
    conference 12–17.06.2022
    Status:
    Published
  4. Solving One Variable Word Equations in the Free Group in Cubic Time

    Authors:
    Robert Ferens, Artur Jeż
    Conference:
    38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) (year: 2021, pages: 30:1–30:17), Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
    Date:
    conference 16–18.03.2021
    Status:
    Published
    DOI:
    link to the publication
  5. Towards Better Compressed Representations

    Authors:
    Michał Gańczorz
    Conference:
    2020 Data Compression Conference (DCC 2020) (year: 2020, pages: 370), Publisher: IEEE Computer Society Conference Publishing Services
    Date:
    conference 24–27.03.2020
    Status:
    Published
  6. Entropy Lower Bounds for Dictionary Compression

    Authors:
    Michał Gańczorz
    Conference:
    30th Annual Symposium on Combinatorial Pattern Matching (CPM) (year: 2019, pages: 11:1-11:18), Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
    Date:
    conference 2019-06-18–2019-06-20
    Status:
    Published
    DOI:
    link to the publication
  7. Parikh's Theorem Made Symbolic

    Authors:
    Matthew Hague, Artur Jeż, Anthony W. Lin
    Conference:
    51st ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2024) (year: 2024, pages: 65:1–65:33), Publisher: ACM
    Date:
    conference 17–19.01.2024
    Status:
    Published
  8. Decision Procedures for Sequence Theories

    Authors:
    Artur Jeż, Anthony W. Lin, Oliver Markgraf, Philipp Rümmer
    Conference:
    35th International Conference on Computer Aided Verification (CAV) (year: 2023, pages: 18–40), Publisher: Springer
    Date:
    conference 17–22.07.2023
    Status:
    Published
    DOI:
    link to the publication
  9. Balancing Straight-Line Programs

    Authors:
    Moses Ganardi, Artur Jeż, Markus Lohrey
    Conference:
    IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) (year: 2019, pages: 1169-1183), Publisher: IEEE
    Date:
    conference 9-12.11.2019
    Status:
    Published

« New search

Graphic design and implementation: Jakub Piotrowski