Przemyslaw Uznanski

ORCID

Publication Activity (10 Years)

Years Active: 2011-2023
Publications (10 Years): 83

Top Venues

University of Bordeaux, France (PHD)

Education History

University of Bordeaux, France

PHD

Publications

Michal Bartoszkiewicz, Jan Chorowski, Adrian Kosowski, Jakub Kowalski, Sergey Kulik, Mateusz Lewandowski, Krzysztof Nowicki, Kamil Piechowiak, Olivier Ruas, Zuzanna Stamirowska, Przemyslaw Uznanski
Pathway: a fast and flexible unified stream data processing framework for analytical and Machine Learning applications. CoRR (2023)
Martin Farach-Colton, Fabian Daniel Kuhn, Ronitt Rubinfeld, Przemyslaw Uznanski
From Big Data Theory to Big Data Practice (Dagstuhl Seminar 23071). Dagstuhl Reports 13 (2) (2023)
Pawel Gawrychowski, Przemyslaw Uznanski
Better Distance Labeling for Unweighted Planar Graphs. Algorithmica 85 (6) (2023)
Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Paul G. Spirakis, Przemyslaw Uznanski
On convergence and threshold properties of discrete Lotka-Volterra population protocols. J. Comput. Syst. Sci. 130 (2022)
Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski
The Dynamic k-Mismatch Problem. CPM (2022)
David Doty, Mahsa Eftekhari, Leszek Gasieniec, Eric E. Severson, Przemyslaw Uznanski, Grzegorz Stachowiak
A time and space optimal stable population protocol solving exact majority. FOCS (2022)
Aleksander Lukasiewicz, Przemyslaw Uznanski
Cardinality Estimation Using Gumbel Distribution. ESA (2022)
Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski
) barrier. SODA (2021)
David Doty, Mahsa Eftekhari, Leszek Gasieniec, Eric E. Severson, Przemyslaw Uznanski, Grzegorz Stachowiak
A time and space optimal stable population protocol solving exact majority. FOCS (2021)
Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski
An Efficient Noisy Binary Search in Graphs via Median Approximation. IWOCA (2021)
Dan Alistarh, Martin Töpfer, Przemyslaw Uznanski
Comparison Dynamics in Population Protocols. PODC (2021)
David Doty, Mahsa Eftekhari, Leszek Gasieniec, Eric E. Severson, Grzegorz Stachowiak, Przemyslaw Uznanski
A time and space optimal stable population protocol solving exact majority. CoRR (2021)
Pawel Gawrychowski, Przemyslaw Uznanski
Better Distance Labeling for Unweighted Planar Graphs. WADS (2021)
David Doty, Mahsa Eftekhari, Leszek Gasieniec, Eric E. Severson, Grzegorz Stachowiak, Przemyslaw Uznanski
Brief Announcement: A Time and Space Optimal Stable Population Protocol Solving Exact Majority. PODC (2021)
Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski
The Dynamic k-Mismatch Problem. CoRR (2021)
Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski
Noisy searching: simple, fast and correct. CoRR (2021)
Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski
An Efficient Noisy Binary Search in Graphs via Median Approximation. CoRR (2020)
Przemyslaw Uznanski
Approximating Text-To-Pattern Distance via Dimensionality Reduction. CPM (2020)
Dan Alistarh, Martin Töpfer, Przemyslaw Uznanski
Robust Comparison in Population Protocols. CoRR (2020)
Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski
) barrier. CoRR (2020)
Przemyslaw Uznanski
Recent Advances in Text-to-Pattern Distance Algorithms. CiE (2020)
Aleksander Lukasiewicz, Przemyslaw Uznanski
Cardinality estimation using Gumbel distribution. CoRR (2020)
Tatiana Starikovskaya, Michal Svagerka, Przemyslaw Uznanski
Pattern Matching in a Stream. APPROX-RANDOM (2020)
Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski
Improved Circular k-Mismatch Sketches. CoRR (2020)
Leszek Gasieniec, Grzegorz Stachowiak, Przemyslaw Uznanski
Time and Space Optimal Exact Majority Population Protocols. CoRR (2020)
Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski
Improved Circular k-Mismatch Sketches. APPROX-RANDOM (2020)
Przemyslaw Uznanski
Approximating Text-to-Pattern Distance via Dimensionality Reduction. CoRR (2020)
Karim Labib, Przemyslaw Uznanski, Daniel Wolleb-Graf
Hamming Distance Completeness. CPM (2019)
Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski
Improved Analysis of Deterministic Load-Balancing Schemes. ACM Trans. Algorithms 15 (1) (2019)
Adrian Kosowski, Przemyslaw Uznanski, Laurent Viennot
Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling. PODC (2019)
Tatiana Starikovskaya, Michal Svagerka, Przemyslaw Uznanski
Pattern Matching in a Stream. CoRR (2019)
Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski, Daniel Wolleb-Graf
Faster Algorithms for All-Pairs Bounded Min-Cuts. ICALP (2019)
Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski
RLE Edit Distance in Near Optimal Time. MFCS (2019)
Leszek Gasieniec, Grzegorz Stachowiak, Przemyslaw Uznanski
Almost Logarithmic-Time Space Optimal Leader Election in Population Protocols. SPAA (2019)
Dariusz Dereniowski, Stefan Tiegel, Przemyslaw Uznanski, Daniel Wolleb-Graf
A Framework for Searching in Graphs in the Presence of Errors. SOSA (2019)
Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. Algorithmica 81 (9) (2019)
Adrian Kosowski, Przemyslaw Uznanski, Laurent Viennot
Hardness of exact distance queries in sparse graphs through hub labeling. CoRR (2019)
Jan Studený, Przemyslaw Uznanski
Approximating Approximate Pattern Matching. CPM (2019)
Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski
RLE edit distance in near optimal time. CoRR (2019)
Shantanu Das, Dariusz Dereniowski, Przemyslaw Uznanski
Brief Announcement: Energy Constrained Depth First Search. ICALP (2018)
Amir Abboud, Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski
Faster Algorithms for All-Pairs Bounded Min-Cuts. CoRR (2018)
Daniel Graf, Karim Labib, Przemyslaw Uznanski
Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. ICALP (2018)
Dariusz Dereniowski, Daniel Graf, Stefan Tiegel, Przemyslaw Uznanski
A Framework for Searching in Graphs in the Presence of Errors. CoRR (2018)
Jan Studený, Przemyslaw Uznanski
Approximating Approximate Pattern Matching. CoRR (2018)
Pawel Gawrychowski, Przemyslaw Uznanski
Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance. ICALP (2018)
Leszek Gasieniec, Grzegorz Stachowiak, Przemyslaw Uznanski
Almost logarithmic-time space optimal leader election in population protocols. CoRR (2018)
Przemyslaw Uznanski
Faster Approximate(d) Text-to-Pattern L1 Distance. CoRR (2018)
Adrian Kosowski, Przemyslaw Uznanski
Population Protocols Made Easy. CoRR (2018)
Adrian Kosowski, Przemyslaw Uznanski
Brief Announcement: Population Protocols Are Fast. PODC (2018)
Adrian Kosowski, Przemyslaw Uznanski
Ergodic Effects in Token Circulation. SODA (2018)
Pawel Gawrychowski, Przemyslaw Uznanski
Optimal trade-offs for pattern matching with k mismatches. CoRR (2017)
Artur Menc, Dominik Pajak, Przemyslaw Uznanski
Time and space optimality of rotor-router graph exploration. Inf. Process. Lett. 127 (2017)
Dan Alistarh, Bartlomiej Dudek, Adrian Kosowski, David Soloveichik, Przemyslaw Uznanski
Robust Detection in Leak-Prone Population Protocols. CoRR (2017)
Jukka Kohonen, Janne H. Korhonen, Christopher Purcell, Jukka Suomela, Przemyslaw Uznanski
Distributed Colour Reduction Revisited. CoRR (2017)
Dan Alistarh, Bartlomiej Dudek, Adrian Kosowski, David Soloveichik, Przemyslaw Uznanski
Robust Detection in Leak-Prone Population Protocols. DNA (2017)
Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski
LCL Problems on Grids. PODC (2017)
Daniel Graf, Karim Labib, Przemyslaw Uznanski
Hamming distance completeness and sparse matrix multiplication. CoRR (2017)
Shantanu Das, Dariusz Dereniowski, Przemyslaw Uznanski
Energy Constrained Depth First Search. CoRR (2017)
Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski
LCL problems on grids. CoRR (2017)
Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski, Mengchuan Zou
Approximation Strategies for Generalized Binary Search in Weighted Trees. ICALP (2017)
Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski, Mengchuan Zou
Approximation Strategies for Generalized Binary Search in Weighted Trees. CoRR (2017)
Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski
All-Pairs 2-Reachability in O(n^w log n) Time. ICALP (2017)
Pawel Gawrychowski, Jukka Suomela, Przemyslaw Uznanski
Randomized Algorithms for Finding a Majority Element. SWAT (2016)
Matús Mihalák, Przemyslaw Uznanski, Pencho Yordanov
Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences. ANALCO (2016)
Pawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski
Brief Announcement: Sublinear-Space Distance Labeling Using Hubs. PODC (2016)
Pawel Gawrychowski, Przemyslaw Uznanski
A note on distance labeling in planar graphs. CoRR (2016)
Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski
Bounds on the cover time of parallel rotor walks. J. Comput. Syst. Sci. 82 (5) (2016)
Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. CoRR (2016)
Pawel Gawrychowski, Przemyslaw Uznanski
Order-preserving pattern matching with k mismatches. Theor. Comput. Sci. 638 (2016)
Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. CPM (2016)
Adrian Kosowski, Przemyslaw Uznanski
Ergodic Effects in Token Circulation. CoRR (2016)
Pawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski
Sublinear-Space Distance Labeling Using Hubs. DISC (2016)
Pawel Gawrychowski, Jukka Suomela, Przemyslaw Uznanski
Randomized algorithms for finding a majority element. CoRR (2016)
Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski
) Time. CoRR (2016)
Artur Menc, Dominik Pajak, Przemyslaw Uznanski
On the power of one bit: How to explore a graph when you cannot backtrack? CoRR (2015)
Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski
Improved Analysis of Deterministic Load-Balancing Schemes. PODC (2015)
Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski
Limit Behavior of the Multi-agent Rotor-Router System. DISC (2015)
Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Paul G. Spirakis, Przemyslaw Uznanski
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols. CoRR (2015)
Przemyslaw Uznanski
All Permutations Supersequence is coNP-complete. CoRR (2015)
Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Paul G. Spirakis, Przemyslaw Uznanski
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols. ICALP (1) (2015)
Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski
Fast collaborative graph exploration. Inf. Comput. 243 (2015)
Matús Mihalák, Przemyslaw Uznanski, Pencho Yordanov
Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences. CoRR (2015)
Pawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski
Even Simpler Distance Labeling for (Sparse) Graphs. CoRR (2015)
Shantanu Das, Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski
Rendezvous of Distance-aware Mobile Agents in Unknown Graphs. CoRR (2014)
Shantanu Das, Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs. SIROCCO (2014)
Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski
Lock-in Problem for Parallel Rotor-router Walks. CoRR (2014)
Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski
Bounds on the Cover Time of Parallel Rotor Walks. STACS (2014)
Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski
Be Fair and Be Selfish! Characterizing Deterministic Diffusive Load-Balancing Schemes with Small Discrepancy. CoRR (2014)
Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois, Przemyslaw Uznanski, Shailesh Kumar Agrawal
Broadcasting on Large Scale Heterogeneous Platforms under the Bounded Multi-Port Model. IEEE Trans. Parallel Distributed Syst. 25 (10) (2014)
Pawel Gawrychowski, Przemyslaw Uznanski
Tight tradeoffs for approximating palindromes in streams. CoRR (2014)
Lionel Eyraud-Dubois, Przemyslaw Uznanski
Point-to-Point and Congestion Bandwidth Estimation: Experimental Evaluation on PlanetLab Data. IPDPS Workshops (2014)
Pawel Gawrychowski, Przemyslaw Uznanski
Order-Preserving Pattern Matching with k Mismatches. CPM (2014)
Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski
Fast Collaborative Graph Exploration. ICALP (2) (2013)
Pawel Gawrychowski, Przemyslaw Uznanski
Order-preserving pattern matching with k mismatches. CoRR (2013)
Adrian Kosowski, Przemyslaw Uznanski
Splittable Single Source-Sink Routing on CMP Grids: A Sublinear Number of Paths Suffice. Euro-Par (2013)
Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois, Przemyslaw Uznanski
Broadcasting on Large Scale Heterogeneous Platforms with Connectivity Artifacts under the Bounded Multi-port Model. ICPADS (2011)

Przemyslaw Uznanski.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Przemyslaw Uznanski