Przemyslaw Uznanski

Orcid: 0000-0002-8652-0490

Affiliations:
  • University of Wrocław, Poland
  • ETH Zürich, Switzerland (former)


According to our database1, Przemyslaw Uznanski authored at least 65 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Energy Constrained Depth First Search.
Algorithmica, December, 2024

2023
Better Distance Labeling for Unweighted Planar Graphs.
Algorithmica, June, 2023

From Big Data Theory to Big Data Practice (Dagstuhl Seminar 23071).
Dagstuhl Reports, February, 2023

Pathway: a fast and flexible unified stream data processing framework for analytical and Machine Learning applications.
CoRR, 2023

2022
On convergence and threshold properties of discrete Lotka-Volterra population protocols.
J. Comput. Syst. Sci., 2022

Cardinality Estimation Using Gumbel Distribution.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

The Dynamic k-Mismatch Problem.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021
Noisy searching: simple, fast and correct.
CoRR, 2021

All-Pairs LCA in DAGs: Breaking through the <i>O</i>(<i>n</i><sup>2.5</sup>) barrier.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Brief Announcement: A Time and Space Optimal Stable Population Protocol Solving Exact Majority.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Comparison Dynamics in Population Protocols.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

An Efficient Noisy Binary Search in Graphs via Median Approximation.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

A time and space optimal stable population protocol solving exact majority.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
All-Pairs LCA in DAGs: Breaking through the O(n<sup>2.5</sup>) barrier.
CoRR, 2020

Robust Comparison in Population Protocols.
CoRR, 2020

Approximating Text-To-Pattern Distance via Dimensionality Reduction.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Recent Advances in Text-to-Pattern Distance Algorithms.
Proceedings of the Beyond the Horizon of Computability, 2020

L<sub>p</sub> Pattern Matching in a Stream.
Proceedings of the Approximation, 2020

Improved Circular k-Mismatch Sketches.
Proceedings of the Approximation, 2020

2019
Improved Analysis of Deterministic Load-Balancing Schemes.
ACM Trans. Algorithms, 2019

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

Almost Logarithmic-Time Space Optimal Leader Election in Population Protocols.
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.
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

RLE Edit Distance in Near Optimal Time.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Faster Algorithms for All-Pairs Bounded Min-Cuts.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

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

Hamming Distance Completeness.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Population Protocols Made Easy.
CoRR, 2018

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

Ergodic Effects in Token Circulation.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Brief Announcement: Population Protocols Are Fast.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Brief Announcement: Energy Constrained Depth First Search.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Time and space optimality of rotor-router graph exploration.
Inf. Process. Lett., 2017

Hamming distance completeness and sparse matrix multiplication.
CoRR, 2017

Distributed Colour Reduction Revisited.
CoRR, 2017

Optimal trade-offs for pattern matching with k mismatches.
CoRR, 2017

LCL Problems on Grids.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

All-Pairs 2-Reachability in O(n^w log n) Time.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Approximation Strategies for Generalized Binary Search in Weighted Trees.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Robust Detection in Leak-Prone Population Protocols.
Proceedings of the DNA Computing and Molecular Programming - 23rd International Conference, 2017

2016
Order-preserving pattern matching with k mismatches.
Theor. Comput. Sci., 2016

Bounds on the cover time of parallel rotor walks.
J. Comput. Syst. Sci., 2016

All-Pairs $2$-reachability in Õ(n<sup>ω</sup>) Time.
CoRR, 2016

A note on distance labeling in planar graphs.
CoRR, 2016

Sublinear-Space Distance Labeling Using Hubs.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Randomized Algorithms for Finding a Majority Element.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Brief Announcement: Sublinear-Space Distance Labeling Using Hubs.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences.
Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, 2016

2015
Fast collaborative graph exploration.
Inf. Comput., 2015

All Permutations Supersequence is coNP-complete.
CoRR, 2015

On the power of one bit: How to explore a graph when you cannot backtrack?
CoRR, 2015

Even Simpler Distance Labeling for (Sparse) Graphs.
CoRR, 2015

Limit Behavior of the Multi-agent Rotor-Router System.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

2014
Broadcasting on Large Scale Heterogeneous Platforms under the Bounded Multi-Port Model.
IEEE Trans. Parallel Distributed Syst., 2014

Tight tradeoffs for approximating palindromes in streams.
CoRR, 2014

Lock-in Problem for Parallel Rotor-router Walks.
CoRR, 2014

Be Fair and Be Selfish! Characterizing Deterministic Diffusive Load-Balancing Schemes with Small Discrepancy.
CoRR, 2014

Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs.
Proceedings of the Structural Information and Communication Complexity, 2014

Point-to-Point and Congestion Bandwidth Estimation: Experimental Evaluation on PlanetLab Data.
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).
PhD thesis, 2013

Splittable Single Source-Sink Routing on CMP Grids: A Sublinear Number of Paths Suffice.
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.
Proceedings of the 17th IEEE International Conference on Parallel and Distributed Systems, 2011


  Loading...