| 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 | 94 | 2013 |
| 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 | 69 | 2017 |
| 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 | 57 | 2019 |
| Order-preserving pattern matching with k mismatches P Gawrychowski, P Uznański Theoretical Computer Science 638, 136-144, 2016 | 54 | 2016 |
| Population Protocols Are Fast A Kosowski, P Uznański arXiv preprint arXiv:1802.06872, 2018 | 48* | 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 | 46 | 2018 |
| 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 | 30 | 2022 |
| Bounds on the cover time of parallel rotor walks D Dereniowski, A Kosowski, D Pajak, P Uznański STACS 2014, 263--275, 2014 | 30 | 2014 |
| Faster algorithms for all-pairs bounded min-cuts A Abboud, L Georgiadis, GF Italiano, R Krauthgamer, N Parotsidis, ... arXiv preprint arXiv:1807.05803, 2018 | 29 | 2018 |
| Time and space optimality of rotor-router graph exploration A Menc, D Pająk, P Uznański arXiv preprint arXiv:1502.05545, 2015 | 29 | 2015 |
| Improved analysis of deterministic load-balancing schemes P Berenbrink, R Klasing, A Kosowski, F Mallmann-Trenn, P Uznański | 26* | 2014 |
| Better distance labeling for unweighted planar graphs P Gawrychowski, P Uznański Algorithmica 85 (6), 1805-1823, 2023 | 23* | 2023 |
| Tight tradeoffs for real-time approximation of longest palindromes in streams P Gawrychowski, O Merkurev, AM Shur, P Uznański Algorithmica 81, 3630-3654, 2019 | 23 | 2019 |
| Hamming distance completeness K Labib, P Uznanski, D Wolleb-Graf 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019) 128, 14, 2019 | 23* | 2019 |
| Robust detection in leak-prone population protocols D Alistarh, B Dudek, A Kosowski, D Soloveichik, P Uznański DNA Computing and Molecular Programming: 23rd International Conference, DNA …, 2017 | 22 | 2017 |
| On convergence and threshold properties of discrete Lotka-Volterra population protocols J Czyzowicz, L Gąsieniec, A Kosowski, E Kranakis, PG Spirakis, ... Journal of Computer and System Sciences 130, 1-25, 2022 | 21* | 2022 |
| A framework for searching in graphs in the presence of errors D Dereniowski, S Tiegel, P Uznański, D Wolleb-Graf arXiv preprint arXiv:1804.02075, 2018 | 21 | 2018 |
| 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 | 19* | 2015 |
| Approximation strategies for generalized binary search in weighted trees D Dereniowski, A Kosowski, P Uznanski, M Zou arXiv preprint arXiv:1702.08207, 2017 | 18 | 2017 |
| Sublinear-space distance labeling using hubs P Gawrychowski, A Kosowski, P Uznański International Symposium on Distributed Computing, 230-242, 2016 | 17* | 2016 |
Adrian KosowskiCo-founder, CPO at Pathwaypathway.com의 이메일 확인됨
