Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrzemyslaw Uznanski
Przemek Uznanski – Przemysław Uznański
Person information
- affiliation: University of Wrocław, Poland
- affiliation (former): ETH Zürich, Switzerland
- unicode name: Przemysław Uznański
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j9]Pawel Gawrychowski
, Przemyslaw Uznanski:
Better Distance Labeling for Unweighted Planar Graphs. Algorithmica 85(6): 1805-1823 (2023)- [i42]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 abs/2307.13116 (2023) - [i41]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): 33-46 (2023) - 2022
- [j8]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: 1-25 (2022) - [c43]Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski:
The Dynamic k-Mismatch Problem. CPM 2022: 18:1-18:15 - [c42]Aleksander Lukasiewicz, Przemyslaw Uznanski:
Cardinality Estimation Using Gumbel Distribution. ESA 2022: 76:1-76:13 - 2021
- [c41]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: 1044-1055 - [c40]Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski:
An Efficient Noisy Binary Search in Graphs via Median Approximation. IWOCA 2021: 265-281 - [c39]Dan Alistarh, Martin Töpfer, Przemyslaw Uznanski:
Comparison Dynamics in Population Protocols. PODC 2021: 55-65 - [c38]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: 77-80 - [c37]Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski:
All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier. SODA 2021: 273-289 - [c36]Pawel Gawrychowski, Przemyslaw Uznanski:
Better Distance Labeling for Unweighted Planar Graphs. WADS 2021: 428-441 - [i40]Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski:
The Dynamic k-Mismatch Problem. CoRR abs/2105.06166 (2021) - [i39]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 abs/2106.10201 (2021) - [i38]Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski:
Noisy searching: simple, fast and correct. CoRR abs/2107.05753 (2021) - 2020
- [c35]Tatiana Starikovskaya, Michal Svagerka, Przemyslaw Uznanski:
Lp Pattern Matching in a Stream. APPROX-RANDOM 2020: 35:1-35:23 - [c34]Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski:
Improved Circular k-Mismatch Sketches. APPROX-RANDOM 2020: 46:1-46:24 - [c33]Przemyslaw Uznanski:
Recent Advances in Text-to-Pattern Distance Algorithms. CiE 2020: 353-365 - [c32]Przemyslaw Uznanski:
Approximating Text-To-Pattern Distance via Dimensionality Reduction. CPM 2020: 29:1-29:11 - [i37]Przemyslaw Uznanski:
Approximating Text-to-Pattern Distance via Dimensionality Reduction. CoRR abs/2002.03459 (2020) - [i36]Dan Alistarh, Martin Töpfer, Przemyslaw Uznanski:
Robust Comparison in Population Protocols. CoRR abs/2003.06485 (2020) - [i35]Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski:
An Efficient Noisy Binary Search in Graphs via Median Approximation. CoRR abs/2005.00144 (2020) - [i34]Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski:
Improved Circular k-Mismatch Sketches. CoRR abs/2006.13673 (2020) - [i33]Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski:
All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier. CoRR abs/2007.08914 (2020) - [i32]Aleksander Lukasiewicz, Przemyslaw Uznanski:
Cardinality estimation using Gumbel distribution. CoRR abs/2008.07590 (2020)
2010 – 2019
- 2019
- [j7]Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski:
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. Algorithmica 81(9): 3630-3654 (2019) - [j6]Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski:
Improved Analysis of Deterministic Load-Balancing Schemes. ACM Trans. Algorithms 15(1): 10:1-10:22 (2019) - [c31]Karim Labib, Przemyslaw Uznanski, Daniel Wolleb-Graf:
Hamming Distance Completeness. CPM 2019: 14:1-14:17 - [c30]Jan Studený, Przemyslaw Uznanski:
Approximating Approximate Pattern Matching. CPM 2019: 15:1-15:13 - [c29]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: 7:1-7:15 - [c28]Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski:
RLE Edit Distance in Near Optimal Time. MFCS 2019: 66:1-66:13 - [c27]Adrian Kosowski, Przemyslaw Uznanski, Laurent Viennot:
Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling. PODC 2019: 272-279 - [c26]Dariusz Dereniowski, Stefan Tiegel, Przemyslaw Uznanski, Daniel Wolleb-Graf:
A Framework for Searching in Graphs in the Presence of Errors. SOSA 2019: 4:1-4:17 - [c25]Leszek Gasieniec, Grzegorz Stachowiak, Przemyslaw Uznanski:
Almost Logarithmic-Time Space Optimal Leader Election in Population Protocols. SPAA 2019: 93-102 - [i31]Adrian Kosowski, Przemyslaw Uznanski, Laurent Viennot:
Hardness of exact distance queries in sparse graphs through hub labeling. CoRR abs/1902.07055 (2019) - [i30]Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski:
RLE edit distance in near optimal time. CoRR abs/1905.01254 (2019) - [i29]Tatiana Starikovskaya, Michal Svagerka, Przemyslaw Uznanski:
Lp Pattern Matching in a Stream. CoRR abs/1907.04405 (2019) - 2018
- [c24]Pawel Gawrychowski, Przemyslaw Uznanski:
Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance. ICALP 2018: 62:1-62:13 - [c23]Daniel Graf, Karim Labib, Przemyslaw Uznanski:
Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. ICALP 2018: 109:1-109:4 - [c22]Shantanu Das, Dariusz Dereniowski, Przemyslaw Uznanski:
Brief Announcement: Energy Constrained Depth First Search. ICALP 2018: 165:1-165:5 - [c21]Adrian Kosowski, Przemyslaw Uznanski:
Brief Announcement: Population Protocols Are Fast. PODC 2018: 475-477 - [c20]Adrian Kosowski, Przemyslaw Uznanski:
Ergodic Effects in Token Circulation. SODA 2018: 2668-2682 - [i28]Przemyslaw Uznanski:
Faster Approximate(d) Text-to-Pattern L1 Distance. CoRR abs/1801.09159 (2018) - [i27]Leszek Gasieniec, Grzegorz Stachowiak, Przemyslaw Uznanski:
Almost logarithmic-time space optimal leader election in population protocols. CoRR abs/1802.06867 (2018) - [i26]Adrian Kosowski, Przemyslaw Uznanski:
Population Protocols Made Easy. CoRR abs/1802.06872 (2018) - [i25]Dariusz Dereniowski, Daniel Graf, Stefan Tiegel, Przemyslaw Uznanski:
A Framework for Searching in Graphs in the Presence of Errors. CoRR abs/1804.02075 (2018) - [i24]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 abs/1807.05803 (2018) - [i23]Jan Studený, Przemyslaw Uznanski:
Approximating Approximate Pattern Matching. CoRR abs/1810.01676 (2018) - 2017
- [j5]Artur Menc, Dominik Pajak, Przemyslaw Uznanski:
Time and space optimality of rotor-router graph exploration. Inf. Process. Lett. 127: 17-20 (2017) - [c19]Dan Alistarh, Bartlomiej Dudek, Adrian Kosowski, David Soloveichik, Przemyslaw Uznanski:
Robust Detection in Leak-Prone Population Protocols. DNA 2017: 155-171 - [c18]Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski:
All-Pairs 2-Reachability in O(n^w log n) Time. ICALP 2017: 74:1-74:14 - [c17]Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski, Mengchuan Zou:
Approximation Strategies for Generalized Binary Search in Weighted Trees. ICALP 2017: 84:1-84:14 - [c16]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: 101-110 - [i22]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 abs/1702.05456 (2017) - [i21]Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski, Mengchuan Zou:
Approximation Strategies for Generalized Binary Search in Weighted Trees. CoRR abs/1702.08207 (2017) - [i20]Pawel Gawrychowski, Przemyslaw Uznanski:
Optimal trade-offs for pattern matching with k mismatches. CoRR abs/1704.01311 (2017) - [i19]Dan Alistarh, Bartlomiej Dudek, Adrian Kosowski, David Soloveichik, Przemyslaw Uznanski:
Robust Detection in Leak-Prone Population Protocols. CoRR abs/1706.09937 (2017) - [i18]Jukka Kohonen, Janne H. Korhonen, Christopher Purcell, Jukka Suomela, Przemyslaw Uznanski:
Distributed Colour Reduction Revisited. CoRR abs/1709.00901 (2017) - [i17]Shantanu Das, Dariusz Dereniowski, Przemyslaw Uznanski:
Energy Constrained Depth First Search. CoRR abs/1709.10146 (2017) - [i16]Daniel Graf, Karim Labib, Przemyslaw Uznanski:
Hamming distance completeness and sparse matrix multiplication. CoRR abs/1711.03887 (2017) - 2016
- [j4]Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski:
Bounds on the cover time of parallel rotor walks. J. Comput. Syst. Sci. 82(5): 802-816 (2016) - [j3]Pawel Gawrychowski, Przemyslaw Uznanski:
Order-preserving pattern matching with k mismatches. Theor. Comput. Sci. 638: 136-144 (2016) - [c15]Matús Mihalák, Przemyslaw Uznanski, Pencho Yordanov:
Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences. ANALCO 2016: 93-105 - [c14]Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski:
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. CPM 2016: 18:1-18:13 - [c13]Pawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski:
Brief Announcement: Sublinear-Space Distance Labeling Using Hubs. PODC 2016: 43-45 - [c12]Pawel Gawrychowski, Jukka Suomela, Przemyslaw Uznanski:
Randomized Algorithms for Finding a Majority Element. SWAT 2016: 9:1-9:14 - [c11]Pawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski:
Sublinear-Space Distance Labeling Using Hubs. DISC 2016: 230-242 - [i15]Pawel Gawrychowski, Jukka Suomela, Przemyslaw Uznanski:
Randomized algorithms for finding a majority element. CoRR abs/1603.01583 (2016) - [i14]Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski:
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. CoRR abs/1610.03125 (2016) - [i13]Pawel Gawrychowski, Przemyslaw Uznanski:
A note on distance labeling in planar graphs. CoRR abs/1611.06529 (2016) - [i12]Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski:
All-Pairs $2$-reachability in Õ(nω) Time. CoRR abs/1612.08075 (2016) - [i11]Adrian Kosowski, Przemyslaw Uznanski:
Ergodic Effects in Token Circulation. CoRR abs/1612.09145 (2016) - 2015
- [j2]Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski:
Fast collaborative graph exploration. Inf. Comput. 243: 37-49 (2015) - [c10]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: 393-405 - [c9]Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski:
Improved Analysis of Deterministic Load-Balancing Schemes. PODC 2015: 301-310 - [c8]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: 123-139 - [i10]Artur Menc, Dominik Pajak, Przemyslaw Uznanski:
On the power of one bit: How to explore a graph when you cannot backtrack? CoRR abs/1502.05545 (2015) - [i9]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 abs/1503.09168 (2015) - [i8]Przemyslaw Uznanski:
All Permutations Supersequence is coNP-complete. CoRR abs/1506.05079 (2015) - [i7]Pawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski:
Even Simpler Distance Labeling for (Sparse) Graphs. CoRR abs/1507.06240 (2015) - [i6]Matús Mihalák, Przemyslaw Uznanski, Pencho Yordanov:
Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences. CoRR abs/1507.07727 (2015) - 2014
- [j1]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): 2520-2528 (2014) - [c7]Pawel Gawrychowski, Przemyslaw Uznanski:
Order-Preserving Pattern Matching with k Mismatches. CPM 2014: 130-139 - [c6]Lionel Eyraud-Dubois, Przemyslaw Uznanski:
Point-to-Point and Congestion Bandwidth Estimation: Experimental Evaluation on PlanetLab Data. IPDPS Workshops 2014: 89-96 - [c5]Shantanu Das, Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski:
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs. SIROCCO 2014: 295-310 - [c4]Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski:
Bounds on the Cover Time of Parallel Rotor Walks. STACS 2014: 263-275 - [i5]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 abs/1404.4344 (2014) - [i4]Shantanu Das, Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski:
Rendezvous of Distance-aware Mobile Agents in Unknown Graphs. CoRR abs/1406.2795 (2014) - [i3]Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski:
Lock-in Problem for Parallel Rotor-router Walks. CoRR abs/1407.3200 (2014) - [i2]Pawel Gawrychowski, Przemyslaw Uznanski:
Tight tradeoffs for approximating palindromes in streams. CoRR abs/1410.6433 (2014) - 2013
- [b1]Przemyslaw Uznanski:
Large scale platform : Instantiable models and algorithmic design of communication schemes. (Modélisation des communications sur plates-formes à grande echelles). University of Bordeaux, France, 2013 - [c3]Adrian Kosowski, Przemyslaw Uznanski:
Splittable Single Source-Sink Routing on CMP Grids: A Sublinear Number of Paths Suffice. Euro-Par 2013: 671-683 - [c2]Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski:
Fast Collaborative Graph Exploration. ICALP (2) 2013: 520-532 - [i1]Pawel Gawrychowski, Przemyslaw Uznanski:
Order-preserving pattern matching with k mismatches. CoRR abs/1309.6453 (2013) - 2011
- [c1]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: 173-180
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-17 20:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
