Przemysław Uznański

From MaRDI portal
Person:269497

Available identifiers

zbMath Open uznanski.przemyslawMaRDI QIDQ269497

List of research outcomes





PublicationDate of PublicationType
Energy constrained depth first search2024-12-03Paper
A framework for searching in graphs in the presence of errors2024-08-26Paper
The dynamic \(k\)-mismatch problem2024-05-06Paper
Comparison Dynamics in Population Protocols2024-03-26Paper
Brief Announcement: A Time and Space Optimal Stable Population Protocol Solving Exact Majority2024-03-26Paper
https://portal.mardi4nfdi.de/entity/Q61472652024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q60621602023-10-31Paper
https://portal.mardi4nfdi.de/entity/Q60844052023-10-31Paper
Better distance labeling for unweighted planar graphs2023-06-05Paper
Approximating Text-To-Pattern Distance via Dimensionality Reduction2023-02-07Paper
Recent advances in text-to-pattern distance algorithms2022-12-16Paper
On convergence and threshold properties of discrete Lotka-Volterra population protocols2022-08-26Paper
https://portal.mardi4nfdi.de/entity/Q50911552022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50924292022-07-21Paper
Approximating Approximate Pattern Matching2022-07-18Paper
Hamming Distance Completeness2022-07-18Paper
Better distance labeling for unweighted planar graphs2022-03-25Paper
An efficient noisy binary search in graphs via Median approximation2022-03-22Paper
Towards unified approximate pattern matching for Hamming and \(L_1\) distance2021-07-28Paper
Brief announcement: Hamming distance completeness and sparse matrix multiplication2021-07-28Paper
Brief announcement: Energy constrained depth first search2021-07-28Paper
Hardness of exact distance queries in sparse graphs through hub labeling2021-01-20Paper
Approximation strategies for generalized binary search in weighted trees2020-05-27Paper
All-pairs 2-reachability in \(\mathcal{O}(n^\omega\log n)\) time2020-05-27Paper
Brief Announcement2019-09-19Paper
Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences2019-09-17Paper
Tight tradeoffs for real-time approximation of longest palindromes in streams2019-08-20Paper
Improved analysis of deterministic load-balancing schemes2019-03-28Paper
Limit behavior of the multi-agent rotor-router system2018-08-24Paper
Sublinear-space distance labeling using hubs2018-08-16Paper
https://portal.mardi4nfdi.de/entity/Q46080652018-03-15Paper
Robust detection in leak-prone population protocols2018-02-02Paper
Randomized algorithms for finding a majority element2017-10-17Paper
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams.2017-10-17Paper
LCL problems on grids2017-10-11Paper
Brief announcement: Sublinear-space distance labeling using hubs2017-09-29Paper
Time and space optimality of rotor-router graph exploration2017-08-16Paper
Bounds on the cover time of parallel rotor walks2017-03-03Paper
Order-preserving pattern matching with \(k\) mismatches2016-06-16Paper
Bounds on the cover time of parallel rotor walks2016-04-18Paper
Improved analysis of deterministic load-balancing schemes2016-03-23Paper
On convergence and threshold properties of discrete Lotka-Volterra population protocols2015-10-27Paper
Fast collaborative graph exploration2015-06-09Paper
Rendezvous of distance-aware mobile agents in unknown graphs2014-08-07Paper
Order-preserving pattern matching with \(k\) mismatches2014-06-30Paper
Fast collaborative graph exploration2013-08-07Paper

Research outcomes over time

This page was built for person: Przemysław Uznański