Przemyslaw Uznanski

According to our database, Przemyslaw Uznanski authored at least 65 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Better Distance Labeling for Unweighted Planar Graphs.

Pawel Gawrychowski, Przemyslaw Uznanski

Algorithmica, June, 2023

From Big Data Theory to Big Data Practice (Dagstuhl Seminar 23071).

Martin Farach-Colton, Fabian Daniel Kuhn, Ronitt Rubinfeld, Przemyslaw Uznanski

Dagstuhl Reports, February, 2023

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, Kamil Piechowiak, Olivier Ruas, Zuzanna Stamirowska, Przemyslaw Uznanski

CoRR, 2023

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

Cardinality Estimation Using Gumbel Distribution.

Aleksander Lukasiewicz, Przemyslaw Uznanski

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

The Dynamic k-Mismatch Problem.

Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Noisy searching: simple, fast and correct.

Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski

CoRR, 2021

All-Pairs LCA in DAGs: Breaking through the <i>O</i>(<i>n</i>^2.5) barrier.

Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 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

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Comparison Dynamics in Population Protocols.

Dan Alistarh, Martin Töpfer, Przemyslaw Uznanski

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

An Efficient Noisy Binary Search in Graphs via Median Approximation.

Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

A time and space optimal stable population protocol solving exact majority.

David Doty, Mahsa Eftekhari, Leszek Gasieniec, Eric E. Severson, Przemyslaw Uznanski, Grzegorz Stachowiak

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

All-Pairs LCA in DAGs: Breaking through the O(n^2.5) barrier.

Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski

CoRR, 2020

Robust Comparison in Population Protocols.

Dan Alistarh, Martin Töpfer, Przemyslaw Uznanski

CoRR, 2020

Approximating Text-To-Pattern Distance via Dimensionality Reduction.

Przemyslaw Uznanski

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Recent Advances in Text-to-Pattern Distance Algorithms.

Przemyslaw Uznanski

Proceedings of the Beyond the Horizon of Computability, 2020

L_p Pattern Matching in a Stream.

Tatiana Starikovskaya, Michal Svagerka, Przemyslaw Uznanski

Proceedings of the Approximation, 2020

Improved Circular k-Mismatch Sketches.

Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski

Proceedings of the Approximation, 2020

2019

Improved Analysis of Deterministic Load-Balancing Schemes.

Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski

ACM Trans. Algorithms, 2019

Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams.

Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski

Algorithmica, 2019

Almost Logarithmic-Time Space Optimal Leader Election in Population Protocols.

Leszek Gasieniec, Grzegorz Stachowiak, Przemyslaw Uznanski

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

A Framework for Searching in Graphs in the Presence of Errors.

Dariusz Dereniowski, Stefan Tiegel, Przemyslaw Uznanski, Daniel Wolleb-Graf

Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling.

Adrian Kosowski, Przemyslaw Uznanski, Laurent Viennot

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

RLE Edit Distance in Near Optimal Time.

Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 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

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Approximating Approximate Pattern Matching.

Jan Studený, Przemyslaw Uznanski

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Hamming Distance Completeness.

Karim Labib, Przemyslaw Uznanski, Daniel Wolleb-Graf

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

Population Protocols Made Easy.

Adrian Kosowski, Przemyslaw Uznanski

CoRR, 2018

Faster Approximate(d) Text-to-Pattern L1 Distance.

Przemyslaw Uznanski

CoRR, 2018

Ergodic Effects in Token Circulation.

Adrian Kosowski, Przemyslaw Uznanski

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Brief Announcement: Population Protocols Are Fast.

Adrian Kosowski, Przemyslaw Uznanski

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance.

Pawel Gawrychowski, Przemyslaw Uznanski

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication.

Daniel Graf, Karim Labib, Przemyslaw Uznanski

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Brief Announcement: Energy Constrained Depth First Search.

Shantanu Das, Dariusz Dereniowski, Przemyslaw Uznanski

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Time and space optimality of rotor-router graph exploration.

Artur Menc, Dominik Pajak, Przemyslaw Uznanski

Inf. Process. Lett., 2017

Hamming distance completeness and sparse matrix multiplication.

Daniel Graf, Karim Labib, Przemyslaw Uznanski

CoRR, 2017

Energy Constrained Depth First Search.

Shantanu Das, Dariusz Dereniowski, Przemyslaw Uznanski

CoRR, 2017

Distributed Colour Reduction Revisited.

Jukka Kohonen, Janne H. Korhonen, Christopher Purcell, Jukka Suomela, Przemyslaw Uznanski

CoRR, 2017

Optimal trade-offs for pattern matching with k mismatches.

Pawel Gawrychowski, Przemyslaw Uznanski

CoRR, 2017

LCL Problems on Grids.

Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

All-Pairs 2-Reachability in O(n^w log n) Time.

Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Approximation Strategies for Generalized Binary Search in Weighted Trees.

Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski, Mengchuan Zou

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Robust Detection in Leak-Prone Population Protocols.

Dan Alistarh, Bartlomiej Dudek, Adrian Kosowski, David Soloveichik, Przemyslaw Uznanski

Proceedings of the DNA Computing and Molecular Programming - 23rd International Conference, 2017

2016

Order-preserving pattern matching with k mismatches.

Pawel Gawrychowski, Przemyslaw Uznanski

Theor. Comput. Sci., 2016

Bounds on the cover time of parallel rotor walks.

Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski

J. Comput. Syst. Sci., 2016

All-Pairs $2$-reachability in Õ(n^ω) Time.

Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski

CoRR, 2016

A note on distance labeling in planar graphs.

Pawel Gawrychowski, Przemyslaw Uznanski

CoRR, 2016

Sublinear-Space Distance Labeling Using Hubs.

Pawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski

Proceedings of the Distributed Computing - 30th International Symposium, 2016

Randomized Algorithms for Finding a Majority Element.

Pawel Gawrychowski, Jukka Suomela, Przemyslaw Uznanski

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Brief Announcement: Sublinear-Space Distance Labeling Using Hubs.

Pawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences.

Matús Mihalák, Przemyslaw Uznanski, Pencho Yordanov

Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, 2016

2015

Fast collaborative graph exploration.

Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski

Inf. Comput., 2015

All Permutations Supersequence is coNP-complete.

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

Even Simpler Distance Labeling for (Sparse) Graphs.

Pawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski

CoRR, 2015

Limit Behavior of the Multi-agent Rotor-Router System.

Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski

Proceedings of the Distributed Computing - 29th International Symposium, 2015

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

Tight tradeoffs for approximating palindromes in streams.

Pawel Gawrychowski, Przemyslaw Uznanski

CoRR, 2014

Lock-in Problem for Parallel Rotor-router Walks.

Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski

CoRR, 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

Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs.

Shantanu Das, Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski

Proceedings of the Structural Information and Communication Complexity, 2014

Point-to-Point and Congestion Bandwidth Estimation: Experimental Evaluation on PlanetLab Data.

Lionel Eyraud-Dubois, Przemyslaw Uznanski

Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014

2013

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

Przemyslaw Uznanski

PhD thesis, 2013

Splittable Single Source-Sink Routing on CMP Grids: A Sublinear Number of Paths Suffice.

Adrian Kosowski, Przemyslaw Uznanski

Proceedings of the Euro-Par 2013 Parallel Processing, 2013

2011

Broadcasting on Large Scale Heterogeneous Platforms with Connectivity Artifacts under the Bounded Multi-port Model.

Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois, Przemyslaw Uznanski

Proceedings of the 17th IEEE International Conference on Parallel and Distributed Systems, 2011