Bartłomiej Dudek
Bartłomiej Dudek
Verified email at cs.uni.wroc.pl - Homepage
Title
Cited by
Cited by
Year
Universal protocols for information dissemination using emergent signals
B Dudek, A Kosowski
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
162018
Robust detection in leak-prone population protocols
D Alistarh, B Dudek, A Kosowski, D Soloveichik, P Uznański
International Conference on DNA-Based Computers, 155-171, 2017
132017
Slowing down top trees for better worst-case compression
B Dudek, P Gawrychowski
Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018
11*2018
Computing quartet distance is equivalent to counting 4-cycles
B Dudek, P Gawrychowski
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
82019
A family of approximation algorithms for the maximum duo-preservation string mapping problem
B Dudek, P Gawrychowski, P Ostropolski-Nalewaja
Annual Symposium on Combinatorial Pattern Matching, 2017
72017
All non-trivial variants of 3-LDT are equivalent
B Dudek, P Gawrychowski, T Starikovskaya
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
42020
31st International Symposium on Algorithms and Computation (ISAAC 2020)
S Oum, K Yi, L Dublois, T Hanaka, M Khosravian Ghadikolaei, M Lampis, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020
22020
Strictly In-Place Algorithms for Permuting and Inverting Permutations
B Dudek, P Gawrychowski, K Pokorski
arXiv preprint arXiv:2101.03978, 2021
2021
Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs
B Dudek, P Gawrychowski
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2020
2020
Generalised Pattern Matching Revisited
B Dudek, P Gawrychowski, T Starikovskaya
arXiv preprint arXiv:2001.05976, 2020
2020
Edit Distance between Unrooted Trees in Cubic Time
B Dudek, P Gawrychowski
International Colloquium on Automata, Languages and Programming, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–11