Zmiana języka

Projects search

Algebraic techniques for parallelising algorithms

2019/33/B/ST6/00298

Keywords

Descriptors

  • ST6_006: Algorytmika, algorytmy równoległe, rozproszone i sieciowe, algorytmiczna teoria gier

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 Przemysław Konstanty Uznański

Number of co-investigators in the project: 3

Call

OPUS 17 – announced on 2019-03-15

Amount awarded
618 240 PLN
Project start date
2020-02-20
Project end date
2023-08-19
Project duration
42 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

Articles in post-conference publications (8)

  1. Improved Circular k-Mismatch Sketches

    Authors:
    Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemysław Uznański
    Conference:
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference (year: 2020, volume: APPROX/RANDOM 2020, pages: 46:1-46:24), Publisher: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
    Date:
    conference 17-19.08.2020
    Status:
    Published
    DOI:
    10.4230/LIPIcs.APPROX/RANDOM.2020.46 – link to the publication

  2. Lp Pattern Matching in a Stream

    Authors:
    Tatiana Starikovskaya, Michal Svagerka, Przemysław Uznański
    Conference:
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual Conference (year: 2020, volume: APPROX/RANDOM 2020, pages: 35:1-35:23), Publisher: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
    Date:
    conference 17-19.08.2020
    Status:
    Published
    DOI:
    10.4230/LIPIcs.APPROX/RANDOM.2020.35 – link to the publication

  3. Approximating Text-To-Pattern Distance via Dimensionality Reduction

    Authors:
    Przemysław Uznański
    Conference:
    31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020 (year: 2020, volume: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, pages: 29:1-29:11), Publisher: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
    Date:
    conference 17-19.06.2020
    Status:
    Published
    DOI:
    10.4230/LIPIcs.CPM.2020.29 – link to the publication

  4. Recent Advances in Text-to-Pattern Distance Algorithms

    Authors:
    Przemysław Uznański
    Conference:
    Beyond the Horizon of Computability - 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29 - July 3, 2020, Proceedings (year: 2020, volume: 16th Conference on Computability in Europe, CiE 2020, pages: 353-365), Publisher: Springer
    Date:
    conference 29.06 - 3.07.2020
    Status:
    Published
    DOI:
    10.1007/978-3-030-51466-2_32 – link to the publication

  5. The Dynamic k-Mismatch Problem

    Authors:
    Raphael Clifford, Paweł Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemysław Uznański
    Conference:
    33rd Annual Symposium on Combinatorial Pattern Matching (year: 2022, volume: 33rd Annual Symposium on Combinatorial Pattern Matching, pages: 18:1--18:15), Publisher: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
    Date:
    conference 27-29.06.2022
    Status:
    Published
    DOI:
    10.4230/LIPIcs.CPM.2022.18 – link to the publication

  6. Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

    Authors:
    Alexandra Lassota, Aleksander Łukasiewicz, Adam Polak
    Conference:
    49th International Colloquium on Automata, Languages, and Programming, ICALP 2022 (year: 2022, volume: 49th International Colloquium on Automata, Languages, and Programming, pages: 87:1-87:15), Publisher: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
    Date:
    conference 4.07-8.07 2022
    Status:
    Published
    DOI:
    10.4230/LIPIcs.ICALP.2022.87 – link to the publication

  7. All-Pairs LCA in DAGs: Breaking through the O(n^2.5) barrier

    Authors:
    Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Łukasiewicz, Nikos Parotsidis, Przemysław Uznański
    Conference:
    Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021 (year: 2021, volume: ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, pages: 273-289), Publisher: SIAM
    Date:
    conference 10-13.01.2021
    Status:
    Published
    DOI:
    10.1137/1.9781611976465.18 – link to the publication

  8. Cardinality Estimation Using Gumbel Distribution

    Authors:
    Aleksander Łukasiewicz, Przemysław Uznański
    Conference:
    30th Annual European Symposium on Algorithms (year: 2022, volume: European Symposium on Algorithms, pages: 76:1--76:13), Publisher: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
    Date:
    conference 5-9.09.2022
    Status:
    Published
    DOI:
    10.4230/LIPIcs.ESA.2022.76 – link to the publication

« New search

Graphic design and implementation: Jakub Piotrowski