The following pages link to Przemysław Uznański (Q269497):
Displayed 43 items.
- Bounds on the cover time of parallel rotor walks (Q269498) (← links)
- Order-preserving pattern matching with \(k\) mismatches (Q294955) (← links)
- Better distance labeling for unweighted planar graphs (Q832885) (← links)
- Sublinear-space distance labeling using hubs (Q1660937) (← links)
- Limit behavior of the multi-agent rotor-router system (Q1664136) (← links)
- Robust detection in leak-prone population protocols (Q1694427) (← links)
- Recent advances in text-to-pattern distance algorithms (Q2106622) (← links)
- An efficient noisy binary search in graphs via Median approximation (Q2115863) (← links)
- On convergence and threshold properties of discrete Lotka-Volterra population protocols (Q2168846) (← links)
- Tight tradeoffs for real-time approximation of longest palindromes in streams (Q2319637) (← links)
- Fast collaborative graph exploration (Q2347797) (← links)
- Time and space optimality of rotor-router graph exploration (Q2398496) (← links)
- Improved Analysis of Deterministic Load-Balancing Schemes (Q2796265) (← links)
- Bounds on the Cover Time of Parallel Rotor Walks (Q2965489) (← links)
- On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols (Q3448801) (← links)
- (Q4608065) (← links)
- Improved Analysis of Deterministic Load-Balancing Schemes (Q4629980) (← links)
- Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance (Q5002739) (← links)
- Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. (Q5002794) (← links)
- (Q5002857) (← links)
- Hamming Distance Completeness (Q5088904) (← links)
- Approximating Approximate Pattern Matching (Q5088905) (← links)
- (Q5091155) (← links)
- (Q5092429) (← links)
- All-Pairs 2-Reachability in O(n^w log n) Time (Q5111405) (← links)
- (Q5111415) (← links)
- Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling (Q5145219) (← links)
- Order-Preserving Pattern Matching with k Mismatches (Q5165599) (← links)
- Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences (Q5194946) (← links)
- Brief Announcement (Q5197713) (← links)
- Fast Collaborative Graph Exploration (Q5327462) (← links)
- Brief Announcement (Q5361914) (← links)
- LCL Problems on Grids (Q5368949) (← links)
- Randomized algorithms for finding a majority element (Q5369511) (← links)
- Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. (Q5369553) (← links)
- Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs (Q5496166) (← links)
- Approximating Text-To-Pattern Distance via Dimensionality Reduction (Q5874460) (← links)
- (Q6062160) (← links)
- (Q6084405) (← links)
- Better distance labeling for unweighted planar graphs (Q6103529) (← links)
- Comparison Dynamics in Population Protocols (Q6120921) (← links)
- Brief Announcement: A Time and Space Optimal Stable Population Protocol Solving Exact Majority (Q6120923) (← links)
- (Q6147265) (← links)