Przemysław Uznański
Przemysław Uznański
NavAlgo & Institute of Computer Science, University of Wrocław
Bestätigte E-Mail-Adresse bei cs.uni.wroc.pl - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
492013
Order-preserving pattern matching with k mismatches
P Gawrychowski, P Uznański
Theoretical Computer Science 638, 136-144, 2016
382016
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
332019
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
322017
Population Protocols Are Fast
A Kosowski, P Uznański
arXiv preprint arXiv:1802.06872, 2018
27*2018
Bounds on the cover time of parallel rotor walks
D Dereniowski, A Kosowski, D Pajak, P Uznański
STACS 2014, 263--275, 2014
232014
Improved analysis of deterministic load-balancing schemes
P Berenbrink, R Klasing, A Kosowski, F Mallmann-Trenn, P Uznański
19*2014
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
18*2018
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
182015
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
16*2015
Sublinear-space distance labeling using hubs
P Gawrychowski, A Kosowski, P Uznański
International Symposium on Distributed Computing, 230-242, 2016
14*2016
Time and space optimality of rotor-router graph exploration
A Menc, D Pająk, P Uznański
arXiv preprint arXiv:1502.05545, 2015
142015
Hamming distance completeness
K Labib, P Uznanski, D Wolleb-Graf
30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019) 128, 14, 2019
12*2019
Broadcasting on large scale heterogeneous platforms under the bounded multi-port model
O Beaumont, N Bonichon, L Eyraud-Dubois, P Uznański, SK Agrawal
Parallel and Distributed Systems, IEEE Transactions on 25 (10), 2520-2528, 2014
12*2014
A note on distance labeling in planar graphs
P Gawrychowski, P Uznański
arXiv preprint arXiv:1611.06529, 2016
112016
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
102019
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
102017
Faster algorithms for all-pairs bounded min-cuts
A Abboud, L Georgiadis, GF Italiano, R Krauthgamer, N Parotsidis, ...
arXiv preprint arXiv:1807.05803, 2018
92018
Energy constrained depth first search
S Das, D Dereniowski, P Uznański
arXiv preprint arXiv:1709.10146, 2017
8*2017
Approximation strategies for generalized binary search in weighted trees
D Dereniowski, A Kosowski, P Uznanski, M Zou
arXiv preprint arXiv:1702.08207, 2017
82017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20