Bartlomiej Dudek

According to our database, Bartlomiej Dudek authored at least 17 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Slowing down top trees for better worst-case compression.

Bartlomiej Dudek, Pawel Gawrychowski

Theor. Comput. Sci., 2024

Sorting Signed Permutations by Reversals in Nearly-Linear Time.

Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Online Context-Free Recognition in OMv Time.

Bartlomiej Dudek, Pawel Gawrychowski

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2023

Optimal Heaviest Induced Ancestors.

Panagiotis Charalampopoulos, Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski

CoRR, 2023

Optimal Near-Linear Space Heaviest Induced Ancestors.

Panagiotis Charalampopoulos, Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022

Streaming Regular Expression Membership and Pattern Matching.

Bartlomiej Dudek, Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Strictly In-Place Algorithms for Permuting and Inverting Permutations.

Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

2020

All non-trivial variants of 3-LDT are equivalent.

Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Generalised Pattern Matching Revisited.

Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs.

Bartlomiej Dudek, Pawel Gawrychowski

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019

Computing quartet distance is equivalent to counting 4-cycles.

Bartlomiej Dudek, Pawel Gawrychowski

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018

Slowing Down Top Trees for Better Worst-Case Bounds.

Bartlomiej Dudek, Pawel Gawrychowski

CoRR, 2018

Universal protocols for information dissemination using emergent signals.

Bartlomiej Dudek, Adrian Kosowski

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Edit Distance between Unrooted Trees in Cubic Time.

Bartlomiej Dudek, Pawel Gawrychowski

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Spreading a Confirmed Rumor: A Case for Oscillatory Dynamics.

Bartlomiej Dudek, Adrian Kosowski

CoRR, 2017

Robust Detection in Leak-Prone Population Protocols.

Dan Alistarh, Bartlomiej Dudek, Adrian Kosowski, David Soloveichik, Przemyslaw Uznanski

Proceedings of the DNA Computing and Molecular Programming - 23rd International Conference, 2017

A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem.

Bartlomiej Dudek, Pawel Gawrychowski, Piotr Ostropolski-Nalewaja

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017