Follow
Przemysław Uznański
Przemysław Uznański
Pathway
Verified email at pathway.com - Homepage
Title
Cited by
Cited by
Year
Fast collaborative graph exploration
D Dereniowski, Y Disser, A Kosowski, D Pająk, P Uznański
International Colloquium on Automata, Languages, and Programming, 520-532, 2013
662013
Almost logarithmic-time space optimal leader election in population protocols
L Gąsieniec, G Stachowiak, P Uznanski
The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 93-102, 2019
512019
LCL problems on grids
S Brandt, J Hirvonen, JH Korhonen, T Lempiäinen, PRJ Östergård, ...
Proceedings of the ACM Symposium on Principles of Distributed Computing, 101-110, 2017
502017
Order-preserving pattern matching with k mismatches
P Gawrychowski, P Uznański
Theoretical Computer Science 638, 136-144, 2016
462016
Population Protocols Are Fast
A Kosowski, P Uznański
arXiv preprint arXiv:1802.06872, 2018
40*2018
Towards unified approximate pattern matching for Hamming and L_1 distance
P Gawrychowski, P Uznanski
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
31*2018
Bounds on the cover time of parallel rotor walks
D Dereniowski, A Kosowski, D Pajak, P Uznański
STACS 2014, 263--275, 2014
272014
Improved analysis of deterministic load-balancing schemes
P Berenbrink, R Klasing, A Kosowski, F Mallmann-Trenn, P Uznański
25*2014
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols
J Czyzowicz, L Gasieniec, A Kosowski, E Kranakis, PG Spirakis, ...
arXiv preprint arXiv:1503.09168, 2015
222015
Time and space optimality of rotor-router graph exploration
A Menc, D Pająk, P Uznański
arXiv preprint arXiv:1502.05545, 2015
212015
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
192017
Hamming distance completeness
K Labib, P Uznanski, D Wolleb-Graf
30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019) 128, 14, 2019
18*2019
Faster algorithms for all-pairs bounded min-cuts
A Abboud, L Georgiadis, GF Italiano, R Krauthgamer, N Parotsidis, ...
arXiv preprint arXiv:1807.05803, 2018
182018
Sublinear-space distance labeling using hubs
P Gawrychowski, A Kosowski, P Uznański
International Symposium on Distributed Computing, 230-242, 2016
17*2016
Limit behavior of the multi-agent rotor-router system
J Chalopin, S Das, P Gawrychowski, A Kosowski, A Labourel, P Uznański
International Symposium on Distributed Computing, 123-139, 2015
17*2015
Better distance labeling for unweighted planar graphs
P Gawrychowski, P Uznański
Workshop on Algorithms and Data Structures, 428-441, 2021
16*2021
Tight tradeoffs for real-time approximation of longest palindromes in streams
P Gawrychowski, O Merkurev, AM Shur, P Uznański
Algorithmica 81 (9), 3630-3654, 2019
162019
Approximation strategies for generalized binary search in weighted trees
D Dereniowski, A Kosowski, P Uznanski, M Zou
arXiv preprint arXiv:1702.08207, 2017
162017
A time and space optimal stable population protocol solving exact majority
D Doty, M Eftekhari, L Gąsieniec, E Severson, P Uznański, G Stachowiak
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
13*2022
All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier
F Grandoni, GF Italian, A Łukasiewicz, N Parotsidis, P Uznański
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
132021
The system can't perform the operation now. Try again later.
Articles 1–20