Projects funded by the NCN

Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

Graph modeling of search processes

2018/31/B/ST6/00820

Keywords:

graph algorithms distributed computing computational complexity

Descriptors:

  • ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory

Panel:

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

Host institution :

Politechnika Gdańska, Wydział Elektroniki, Telekomunikacji i Informatyki

woj. pomorskie

Other projects carried out by the institution 

Principal investigator (from the host institution):

dr hab. Dariusz Dereniowski 

Number of co-investigators in the project: 5

Call: OPUS 16 - announced on 2018-09-14

Amount awarded: 480 200 PLN

Project start date (Y-m-d): 2019-06-28

Project end date (Y-m-d): 2024-06-27

Project duration:: 36 months (the same as in the proposal)

Project status: Pending project

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 (5)
  • Articles in post-conference publications (4)
  1. Edge and Pair Queries - Random Graphs and Complexity
    Authors:
    Dariusz Dereniowski, Przemysław Gordinowicz, Paweł Prałat
    Academic press:
    The Electronic Journal of Combinatorics (rok: 2023, tom: 30(2), strony: P2.34), Wydawca: N.J. Calkin and H.S. Wilf, [Atlanta, Ga.]
    Status:
    Published
    DOI:
    10.37236/11159 - link to the publication
  2. On the characteristic graph of a discrete symmetric channel
    Authors:
    Dariusz Dereniowski, Marcin Jurkiewicz
    Academic press:
    IEEE Transactions on Information Theory (rok: 2021, tom: 67, strony: 3818-3823), Wydawca: IEEE
    Status:
    Published
    DOI:
    10.1109/TIT.2021.3073822 - link to the publication
  3. Searching in trees with monotonic query times
    Authors:
    Dariusz Dereniowski, Izajasz Wrosz
    Academic press:
    Theoretical Computer Science , Wydawca: Elsevier
    Status:
    Submitted
    DOI:
    brak - link to the publication
  4. The Complexity of Bicriteria Tree-Depth
    Authors:
    Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula
    Academic press:
    Theoretical Computer Science (rok: 2023, tom: 947, strony: 113682), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.tcs.2022.12.032 - link to the publication
  5. Gossiping by Energy-Constrained Mobile Agents in Tree Networks
    Authors:
    Jurek Czyzowicz, Dariusz Dereniowski, Robert Ostrowski, Wojciech Rytter
    Academic press:
    Theoretical Computer Science (rok: 2021, tom: 861, strony: 45-65), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.tcs.2021.02.009 - link to the publication
  1. An Efficient Noisy Binary Search in Graphs via Median Approximation
    Authors:
    Dariusz Dereniowski, Aleksander Łukasiewicz, Przemysław Uznański
    Conference:
    32nd International Workshop on Combinatorial Algorithms IWOCA 2021 (rok: 2021, ), Wydawca: Springer
    Data:
    konferencja 5-8 lipiec 2021
    Status:
    Published
  2. The Complexity of Bicriteria Tree-depth
    Authors:
    Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula
    Conference:
    23rd International Symposium on Fundamentals of Computation Theory (rok: 2021, ), Wydawca: Springer
    Data:
    konferencja 12-15 wrzesień 2021
    Status:
    Published
  3. Noisy searching: simple, fast and correct
    Authors:
    Dariusz Dereniowski, Aleksander Łukasiewicz, Przemysław Uznański
    Conference:
    International Colloquium on Automata, Languages and Programming (ICALP) (rok: 2024, ), Wydawca: Leibniz International Proceedings in Informatics, LIPIcs
    Data:
    konferencja 8-13.07.2024
    Status:
    Submitted
  4. Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
    Authors:
    Dariusz Dereniowski, Izajasz Wrosz
    Conference:
    47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022) (rok: 2022, ), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
    Data:
    konferencja 22-26.08.2022
    Status:
    Published

O Narodowym Centrum Nauki

Finansowanie nauki

Współpraca zagraniczna

Centrum prasowe

Deklaracja dostępności
Przetwarzanie danych osobowych
Polityka cookies

Partnerzy