Bartlomiej Dudek

Orcid: 0000-0003-2652-995X

Affiliations:
  • University of Wroclaw, Poland


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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Slowing down top trees for better worst-case compression.
Theor. Comput. Sci., 2024

Sorting Signed Permutations by Reversals in Nearly-Linear Time.
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Online Context-Free Recognition in OMv Time.
Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2023
Optimal Heaviest Induced Ancestors.
CoRR, 2023

Optimal Near-Linear Space Heaviest Induced Ancestors.
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022
Streaming Regular Expression Membership and Pattern Matching.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021
Strictly In-Place Algorithms for Permuting and Inverting Permutations.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

2020
All non-trivial variants of 3-LDT are equivalent.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Generalised Pattern Matching Revisited.
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.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019
Computing quartet distance is equivalent to counting 4-cycles.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018
Slowing Down Top Trees for Better Worst-Case Bounds.
CoRR, 2018

Universal protocols for information dissemination using emergent signals.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Edit Distance between Unrooted Trees in Cubic Time.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Spreading a Confirmed Rumor: A Case for Oscillatory Dynamics.
CoRR, 2017

Robust Detection in Leak-Prone Population Protocols.
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.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017


  Loading...