Broadcasting on Large Scale Heterogeneous Platforms with Connectivity Artifacts under the Bounded Multi-port Model. - Olivier Beaumont; Nicolas Bonichon; Lionel Eyraud-Dubois; Przemyslaw Uznanski (ICPADS, 2011)

Splittable Single Source-Sink Routing on CMP Grids: A Sublinear Number of Paths Suffice. - Adrian Kosowski; Przemyslaw Uznanski (Euro-Par, 2013)

Large scale platform : Instantiable models and algorithmic design of communication schemes. (Modélisation des communications sur plates-formes à grande echelles). - Przemyslaw Uznanski (2013)

Point-to-Point and Congestion Bandwidth Estimation: Experimental Evaluation on PlanetLab Data. - Lionel Eyraud-Dubois; Przemyslaw Uznanski (IPDPS Workshops, 2014)

Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs. - Shantanu Das 001; Dariusz Dereniowski; Adrian Kosowski; Przemyslaw Uznanski (SIROCCO, 2014)

Be Fair and Be Selfish! Characterizing Deterministic Diffusive Load-Balancing Schemes with Small Discrepancy. - Petra Berenbrink; Ralf Klasing; Adrian Kosowski; Frederik Mallmann-Trenn; Przemyslaw Uznanski (CoRR, 2014)

Lock-in Problem for Parallel Rotor-router Walks. - Jérémie Chalopin; Shantanu Das 001; Pawel Gawrychowski; Adrian Kosowski; Arnaud Labourel; Przemyslaw Uznanski (CoRR, 2014)

Tight tradeoffs for approximating palindromes in streams. - Pawel Gawrychowski; Przemyslaw Uznanski (CoRR, 2014)

Broadcasting on Large Scale Heterogeneous Platforms under the Bounded Multi-Port Model. - Olivier Beaumont; Nicolas Bonichon; Lionel Eyraud-Dubois; Przemyslaw Uznanski; Shailesh Kumar Agrawal (IEEE Trans. Parallel Distributed Syst., 2014)

Limit Behavior of the Multi-agent Rotor-Router System. - Jérémie Chalopin; Shantanu Das 001; Pawel Gawrychowski; Adrian Kosowski; Arnaud Labourel; Przemyslaw Uznanski (DISC, 2015)

Even Simpler Distance Labeling for (Sparse) Graphs. - Pawel Gawrychowski; Adrian Kosowski; Przemyslaw Uznanski (CoRR, 2015)

On the power of one bit: How to explore a graph when you cannot backtrack? - Artur Menc; Dominik Pajak; Przemyslaw Uznanski (CoRR, 2015)

All Permutations Supersequence is coNP-complete. - Przemyslaw Uznanski (CoRR, 2015)

Fast collaborative graph exploration. - Dariusz Dereniowski; Yann Disser; Adrian Kosowski; Dominik Pajak; Przemyslaw Uznanski (Inf. Comput., 2015)

Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences. - Matús Mihalák; Przemyslaw Uznanski; Pencho Yordanov (ANALCO, 2016)

Brief Announcement: Sublinear-Space Distance Labeling Using Hubs. - Pawel Gawrychowski; Adrian Kosowski; Przemyslaw Uznanski (PODC, 2016)

Randomized Algorithms for Finding a Majority Element. - Pawel Gawrychowski; Jukka Suomela; Przemyslaw Uznanski (SWAT, 2016)

Sublinear-Space Distance Labeling Using Hubs. - Pawel Gawrychowski; Adrian Kosowski; Przemyslaw Uznanski (DISC, 2016)

A note on distance labeling in planar graphs. - Pawel Gawrychowski; Przemyslaw Uznanski (CoRR, 2016)

All-Pairs $2$-reachability in Õ(nω) Time. - Loukas Georgiadis; Daniel Graf 001; Giuseppe F. Italiano; Nikos Parotsidis; Przemyslaw Uznanski (CoRR, 2016)

Bounds on the cover time of parallel rotor walks. - Dariusz Dereniowski; Adrian Kosowski; Dominik Pajak; Przemyslaw Uznanski (J. Comput. Syst. Sci., 2016)

Order-preserving pattern matching with k mismatches. - Pawel Gawrychowski; Przemyslaw Uznanski (Theor. Comput. Sci., 2016)

Robust Detection in Leak-Prone Population Protocols. - Dan Alistarh; Bartlomiej Dudek 001; Adrian Kosowski; David Soloveichik; Przemyslaw Uznanski (DNA, 2017)

Approximation Strategies for Generalized Binary Search in Weighted Trees. - Dariusz Dereniowski; Adrian Kosowski; Przemyslaw Uznanski; Mengchuan Zou (ICALP, 2017)

All-Pairs 2-Reachability in O(n^w log n) Time. - Loukas Georgiadis; Daniel Graf 001; Giuseppe F. Italiano; Nikos Parotsidis; Przemyslaw Uznanski (ICALP, 2017)

LCL Problems on Grids. - Sebastian Brandt 002; Juho Hirvonen; Janne H. Korhonen; Tuomo Lempiäinen; Patric R. J. Östergård; Christopher Purcell; Joel Rybicki; Jukka Suomela; Przemyslaw Uznanski (PODC, 2017)

Optimal trade-offs for pattern matching with k mismatches. - Pawel Gawrychowski; Przemyslaw Uznanski (CoRR, 2017)

Distributed Colour Reduction Revisited. - Jukka Kohonen; Janne H. Korhonen; Christopher Purcell; Jukka Suomela; Przemyslaw Uznanski (CoRR, 2017)

Hamming distance completeness and sparse matrix multiplication. - Daniel Graf 001; Karim Labib; Przemyslaw Uznanski (CoRR, 2017)

Time and space optimality of rotor-router graph exploration. - Artur Menc; Dominik Pajak; Przemyslaw Uznanski (Inf. Process. Lett., 2017)

Brief Announcement: Energy Constrained Depth First Search. - Shantanu Das 001; Dariusz Dereniowski; Przemyslaw Uznanski (ICALP, 2018)

Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. - Daniel Graf 001; Karim Labib; Przemyslaw Uznanski (ICALP, 2018)

Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance. - Pawel Gawrychowski; Przemyslaw Uznanski (ICALP, 2018)

Brief Announcement: Population Protocols Are Fast. - Adrian Kosowski; Przemyslaw Uznanski (PODC, 2018)

Ergodic Effects in Token Circulation. - Adrian Kosowski; Przemyslaw Uznanski (SODA, 2018)

Faster Approximate(d) Text-to-Pattern L1 Distance. - Przemyslaw Uznanski (CoRR, 2018)

Population Protocols Made Easy. - Adrian Kosowski; Przemyslaw Uznanski (CoRR, 2018)

Hamming Distance Completeness. - Karim Labib; Przemyslaw Uznanski; Daniel Wolleb-Graf (CPM, 2019)

Approximating Approximate Pattern Matching. - Jan Studený; Przemyslaw Uznanski (CPM, 2019)

Faster Algorithms for All-Pairs Bounded Min-Cuts. - Amir Abboud; Loukas Georgiadis; Giuseppe F. Italiano; Robert Krauthgamer; Nikos Parotsidis; Ohad Trabelsi; Przemyslaw Uznanski; Daniel Wolleb-Graf (ICALP, 2019)

RLE Edit Distance in Near Optimal Time. - Raphaël Clifford; Pawel Gawrychowski; Tomasz Kociumaka; Daniel P. Martin 001; Przemyslaw Uznanski (MFCS, 2019)

Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling. - Adrian Kosowski; Przemyslaw Uznanski; Laurent Viennot (PODC, 2019)

A Framework for Searching in Graphs in the Presence of Errors. - Dariusz Dereniowski; Stefan Tiegel; Przemyslaw Uznanski; Daniel Wolleb-Graf (SOSA, 2019)

Almost Logarithmic-Time Space Optimal Leader Election in Population Protocols. - Leszek Gasieniec; Grzegorz Stachowiak; Przemyslaw Uznanski (SPAA, 2019)

Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. - Pawel Gawrychowski; Oleg Merkurev; Arseny M. Shur; Przemyslaw Uznanski (Algorithmica, 2019)

Improved Analysis of Deterministic Load-Balancing Schemes. - Petra Berenbrink; Ralf Klasing; Adrian Kosowski; Frederik Mallmann-Trenn; Przemyslaw Uznanski (ACM Trans. Algorithms, 2019)

Improved Circular k-Mismatch Sketches. - Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat; Przemyslaw Uznanski (APPROX-RANDOM, 2020)

Lp Pattern Matching in a Stream. - Tatiana Starikovskaya; Michal Svagerka; Przemyslaw Uznanski (APPROX-RANDOM, 2020)

Recent Advances in Text-to-Pattern Distance Algorithms. - Przemyslaw Uznanski (CiE, 2020)

Approximating Text-To-Pattern Distance via Dimensionality Reduction. - Przemyslaw Uznanski (CPM, 2020)

Robust Comparison in Population Protocols. - Dan Alistarh; Martin Töpfer 003; Przemyslaw Uznanski (CoRR, 2020)

All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier. - Fabrizio Grandoni 001; Giuseppe F. Italiano; Aleksander Lukasiewicz; Nikos Parotsidis; Przemyslaw Uznanski (CoRR, 2020)

A time and space optimal stable population protocol solving exact majority. - David Doty; Mahsa Eftekhari; Leszek Gasieniec; Eric E. Severson; Przemyslaw Uznanski; Grzegorz Stachowiak (FOCS, 2021)

An Efficient Noisy Binary Search in Graphs via Median Approximation. - Dariusz Dereniowski; Aleksander Lukasiewicz; Przemyslaw Uznanski (IWOCA, 2021)

Comparison Dynamics in Population Protocols. - Dan Alistarh; Martin Töpfer 003; Przemyslaw Uznanski (PODC, 2021)

Brief Announcement: A Time and Space Optimal Stable Population Protocol Solving Exact Majority. - David Doty; Mahsa Eftekhari; Leszek Gasieniec; Eric E. Severson; Grzegorz Stachowiak; Przemyslaw Uznanski (PODC, 2021)

All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier. - Fabrizio Grandoni 001; Giuseppe F. Italiano; Aleksander Lukasiewicz; Nikos Parotsidis; Przemyslaw Uznanski (SODA, 2021)

Noisy searching: simple, fast and correct. - Dariusz Dereniowski; Aleksander Lukasiewicz; Przemyslaw Uznanski (CoRR, 2021)

The Dynamic k-Mismatch Problem. - Raphaël Clifford; Pawel Gawrychowski; Tomasz Kociumaka; Daniel P. Martin 001; Przemyslaw Uznanski (CPM, 2022)

Cardinality Estimation Using Gumbel Distribution. - Aleksander Lukasiewicz; Przemyslaw Uznanski (ESA, 2022)

On convergence and threshold properties of discrete Lotka-Volterra population protocols. - Jurek Czyzowicz; Leszek Gasieniec; Adrian Kosowski; Evangelos Kranakis; Paul G. Spirakis; Przemyslaw Uznanski (J. Comput. Syst. Sci., 2022)

Pathway: a fast and flexible unified stream data processing framework for analytical and Machine Learning applications. - Michal Bartoszkiewicz; Jan Chorowski; Adrian Kosowski; Jakub Kowalski; Sergey Kulik; Mateusz Lewandowski; Krzysztof Nowicki 002; Kamil Piechowiak; Olivier Ruas; Zuzanna Stamirowska; Przemyslaw Uznanski (CoRR, 2023)

From Big Data Theory to Big Data Practice (Dagstuhl Seminar 23071). - Martin Farach-Colton; Fabian Daniel Kuhn; Ronitt Rubinfeld; Przemyslaw Uznanski (Dagstuhl Reports, 2023)

Better Distance Labeling for Unweighted Planar Graphs. - Pawel Gawrychowski; Przemyslaw Uznanski (Algorithmica, 2023)

Energy Constrained Depth First Search. - Shantanu Das 001; Dariusz Dereniowski; Przemyslaw Uznanski (Algorithmica, 2024)

Noisy (Binary) Searching: Simple, Fast and Correct. - Dariusz Dereniowski; Aleksander Lukasiewicz; Przemyslaw Uznanski (STACS, 2025)