Projects funded by the NCN

Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

Algebraic techniques for parallelising algorithms

2019/33/B/ST6/00298

Keywords:

matrix multiplication convolution error correcting codes data sketching streaming algorithms massively parallel algorithms computational complexity

Descriptors:

  • ST6_006:

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

woj. 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 (Y-m-d): 2020-02-20

Project end date (Y-m-d): 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 (9)
  1. 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 (rok: 2022, tom: 49th International Colloquium on Automata, Languages, and Programming, strony: 87:1-87:15), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
    Data:
    konferencja 4.07-8.07 2022
    Status:
    Published
    DOI:
    10.4230/LIPIcs.ICALP.2022.87 - link to the publication
  2. 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 (rok: 2021, tom: ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, strony: 273-289), Wydawca: SIAM
    Data:
    konferencja 10-13.01.2021
    Status:
    Published
    DOI:
    10.1137/1.9781611976465.18 - link to the publication
  3. 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 (rok: 2020, tom: APPROX/RANDOM 2020, strony: 46:1-46:24), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
    Data:
    konferencja 17-19.08.2020
    Status:
    Published
    DOI:
    10.4230/LIPIcs.APPROX/RANDOM.2020.46 - link to the publication
  4. Cardinality Estimation Using Gumbel Distribution
    Authors:
    Aleksander Łukasiewicz, Przemysław Uznański
    Conference:
    30th Annual European Symposium on Algorithms (rok: 2022, tom: European Symposium on Algorithms, strony: 76:1--76:13), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
    Data:
    konferencja 5-9.09.2022
    Status:
    Published
    DOI:
    10.4230/LIPIcs.ESA.2022.76 - link to the publication
  5. 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 (rok: 2020, tom: 16th Conference on Computability in Europe, CiE 2020, strony: 353-365), Wydawca: Springer
    Data:
    konferencja 29.06 - 3.07.2020
    Status:
    Published
    DOI:
    10.1007/978-3-030-51466-2_32 - link to the publication
  6. 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 (rok: 2022, tom: 33rd Annual Symposium on Combinatorial Pattern Matching, strony: 18:1--18:15), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
    Data:
    konferencja 27-29.06.2022
    Status:
    Published
    DOI:
    10.4230/LIPIcs.CPM.2022.18 - link to the publication
  7. 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 (rok: 2020, tom: APPROX/RANDOM 2020, strony: 35:1-35:23), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
    Data:
    konferencja 17-19.08.2020
    Status:
    Published
    DOI:
    10.4230/LIPIcs.APPROX/RANDOM.2020.35 - link to the publication
  8. Approximating Text-To-Pattern Distance via Dimensionality Reduction
    Authors:
    Przemysław Uznański
    Conference:
    31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020 (rok: 2020, tom: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, strony: 29:1-29:11), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
    Data:
    konferencja 17-19.06.2020
    Status:
    Published
    DOI:
    10.4230/LIPIcs.CPM.2020.29 - link to the publication
  9. 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 (rok: 2020, tom: 16th Conference on Computability in Europe, CiE 2020, strony: 353-365), Wydawca: Springer
    Data:
    konferencja 29.06 - 3.07.2020
    Status:
    Published
    DOI:
    10.1007/978-3-030-51466-2_32 - link to the publication

O Narodowym Centrum Nauki

Finansowanie nauki

Współpraca zagraniczna

Centrum prasowe

Deklaracja dostępności
Przetwarzanie danych osobowych
Polityka cookies

Partnerzy