default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPawel Gawrychowski
Person information
- affiliation: University of Wroclaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j35]Pawel Gawrychowski, Shay Mozes, Oren Weimann
:
Minimum Cut in O(mlog 2 n) Time. Theory Comput. Syst. 68(4): 814-834 (2024)- [j34]Bartlomiej Dudek, Pawel Gawrychowski:
Slowing down top trees for better worst-case compression. Theor. Comput. Sci. 1015: 114764 (2024) - [c132]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Simon R. Tarnow:
Faster Sliding Window String Indexing in Streams. CPM 2024: 8:1-8:14 - [c131]Bartlomiej Dudek, Pawel Gawrychowski:
Online Context-Free Recognition in OMv Time. CPM 2024: 13:1-13:9 - [c130]Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner:
Compressed Consecutive Pattern Matching†. DCC 2024: 163-172 - [c129]Pawel Gawrychowski, Mateusz Wasylkiewicz:
Finding Perfect Matchings in Bridgeless Cubic Multigraphs Without Dynamic (2-)connectivity. ESA 2024: 59:1-59:14 - [c128]Panagiotis Charalampopoulos, Pawel Gawrychowski, Samah Ghazawi:
Optimal Bounds for Distinct Quartics. ICALP 2024: 39:1-39:17 - [c127]Duncan Adamson, Pawel Gawrychowski, Florin Manea:
Enumerating m-Length Walks in Directed Graphs with Constant Delay. LATIN (1) 2024: 35-50 - [c126]Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya:
Sorting Signed Permutations by Reversals in Nearly-Linear Time. SOSA 2024: 199-214 - [i105]Duncan Adamson, Pawel Gawrychowski, Florin Manea:
Enumerating m-Length Walks in Directed Graphs with Constant Delay. CoRR abs/2401.02163 (2024) - [i104]Panagiotis Charalampopoulos, Pawel Gawrychowski, Samah Ghazawi:
Optimal Bounds for Distinct Quartics. CoRR abs/2403.06667 (2024) - [i103]Pawel Gawrychowski, Mateusz Wasylkiewicz:
Finding perfect matchings in bridgeless cubic multigraphs without dynamic (2-)connectivity. CoRR abs/2405.03856 (2024) - [i102]Pawel Gawrychowski, Wojciech Janczewski:
Optimal Distance Labeling for Permutation Graphs. CoRR abs/2407.12147 (2024) - [i101]Pawel Gawrychowski, Egor Gorbachev, Tomasz Kociumaka:
Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications. CoRR abs/2408.04613 (2024) - [i100]Pawel Gawrychowski, Florin Manea, Markus L. Schmid:
Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration. CoRR abs/2409.18563 (2024) - 2023
- [j33]Pawel Gawrychowski, Przemyslaw Uznanski:
Better Distance Labeling for Unweighted Planar Graphs. Algorithmica 85(6): 1805-1823 (2023) - [j32]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Tight Bound for the Number of Distinct Palindromes in a Tree. Electron. J. Comb. 30(2) (2023) - [j31]Panagiotis Charalampopoulos, Pawel Gawrychowski, Yaowei Long, Shay Mozes, Seth Pettie, Oren Weimann, Christian Wulff-Nilsen:
Almost Optimal Exact Distance Oracles for Planar Graphs. J. ACM 70(2): 12:1-12:50 (2023) - [c125]Panagiotis Charalampopoulos, Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski:
Optimal Near-Linear Space Heaviest Induced Ancestors. CPM 2023: 8:1-8:18 - [c124]Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner:
Compressed Indexing for Consecutive Occurrences. CPM 2023: 12:1-12:22 - [c123]Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau:
Order-Preserving Squares in Strings. CPM 2023: 13:1-13:19 - [c122]Giulia Bernardini, Gabriele Fici, Pawel Gawrychowski, Solon P. Pissis:
Substring Complexity in Sublinear Space. ISAAC 2023: 12:1-12:19 - [c121]Jonas Ellert, Pawel Gawrychowski, Garance Gourdel:
Optimal Square Detection Over General Alphabets. SODA 2023: 5220-5242 - [c120]Pawel Gawrychowski, Maria Kosche, Florin Manea:
On the Number of Factors in the LZ-End Factorization. SPIRE 2023: 253-259 - [i99]Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau:
Order-Preserving Squares in Strings. CoRR abs/2302.00724 (2023) - [i98]Panagiotis Charalampopoulos, Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski:
Optimal Heaviest Induced Ancestors. CoRR abs/2302.01373 (2023) - [i97]Jonas Ellert, Pawel Gawrychowski, Garance Gourdel:
Optimal Square Detection Over General Alphabets. CoRR abs/2303.07229 (2023) - [i96]Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner:
Compressed Indexing for Consecutive Occurrences. CoRR abs/2304.00887 (2023) - [i95]Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya:
Sorting Signed Permutations by Reversals in Nearly-Linear Time. CoRR abs/2308.15928 (2023) - 2022
- [j30]Pawel Gawrychowski, Tatiana Starikovskaya:
Streaming Dictionary Matching with Mismatches. Algorithmica 84(4): 896-916 (2022) - [j29]Pawel Gawrychowski, Florin Manea, Radoslaw Serafin:
Fast and Longest Rollercoasters. Algorithmica 84(4): 1081-1106 (2022) - [j28]Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann:
The Theory of Universal Graphs for Infinite Duration Games. Log. Methods Comput. Sci. 18(3) (2022) - [j27]Giulia Bernardini, Pawel Gawrychowski, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Elastic-Degenerate String Matching via Fast Matrix Multiplication. SIAM J. Comput. 51(3): 549-576 (2022) - [j26]Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Fault-tolerant distance labeling for planar graphs. Theor. Comput. Sci. 918: 48-59 (2022) - [c119]Simon Apers, Pawel Gawrychowski, Troy Lee:
Finding the KT Partition of a Weighted Graph in Near-Linear Time. APPROX/RANDOM 2022: 32:1-32:14 - [c118]Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski:
The Dynamic k-Mismatch Problem. CPM 2022: 18:1-18:15 - [c117]Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai:
Cut Query Algorithms with Star Contraction. FOCS 2022: 507-518 - [c116]Pawel Gawrychowski, Karol Pokorski:
Sublinear Dynamic Interval Scheduling (On One or Multiple Machines). ICALP 2022: 67:1-67:19 - [c115]Bartlomiej Dudek, Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya:
Streaming Regular Expression Membership and Pattern Matching. SODA 2022: 670-694 - [c114]Moses Ganardi, Pawel Gawrychowski:
Pattern Matching on Grammar-Compressed Strings in Linear Time. SODA 2022: 2833-2846 - [c113]Pawel Gawrychowski, Wojciech Janczewski:
Simpler Adjacency Labeling for Planar Graphs with B-Trees. SOSA 2022: 24-36 - [c112]Pawel Gawrychowski, Mateusz Rzepecki:
Faster Exponential Algorithm for Permutation Pattern Matching. SOSA 2022: 279-284 - [c111]Pawel Gawrychowski, Florin Manea, Stefan Siemer:
Matching Patterns with Variables Under Edit Distance. SPIRE 2022: 275-289 - [c110]Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
On the Hardness of Computing the Edit Distance of Shallow Trees. SPIRE 2022: 290-302 - [i94]Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai:
Cut query algorithms with star contraction. CoRR abs/2201.05674 (2022) - [i93]Pawel Gawrychowski, Karol Pokorski:
Sublinear Dynamic Interval Scheduling (on one or multiple machines). CoRR abs/2203.14310 (2022) - [i92]Pawel Gawrychowski, Florin Manea, Stefan Siemer:
Matching Patterns with Variables Under Edit Distance. CoRR abs/2207.07477 (2022) - 2021
- [j25]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. Algorithmica 83(12): 3602-3628 (2021) - [j24]Djamal Belazzougui, Manuel Cáceres, Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Gonzalo Navarro, Alberto Ordóñez Pereira, Simon J. Puglisi, Yasuo Tabei:
Block trees. J. Comput. Syst. Sci. 117: 1-22 (2021) - [j23]Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann:
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time. SIAM J. Comput. 50(2): 509-554 (2021) - [j22]Golnaz Badkobeh, Pawel Gawrychowski, Juha Kärkkäinen, Simon J. Puglisi, Bella Zhukova:
Tight upper and lower bounds on suffix tree breadth. Theor. Comput. Sci. 854: 63-67 (2021) - [c109]Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
An Almost Optimal Edit Distance Oracle. ICALP 2021: 48:1-48:20 - [c108]Pawel Gawrychowski, Florin Manea, Stefan Siemer:
Matching Patterns with Variables Under Hamming Distance. MFCS 2021: 48:1-48:24 - [c107]Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Fault-Tolerant Distance Labeling for Planar Graphs. SIROCCO 2021: 315-333 - [c106]Pawel Gawrychowski, Wojciech Janczewski, Jakub Lopuszanski:
Shorter Labels for Routing in Trees. SODA 2021: 2174-2193 - [c105]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Planar Negative k-Cycle. SODA 2021: 2717-2724 - [c104]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
A Note on a Recent Algorithm for Minimum Cut. SOSA 2021: 74-79 - [c103]Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau:
Lower Bounds for the Number of Repetitions in 2D Strings. SPIRE 2021: 179-192 - [c102]Pawel Gawrychowski, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Efficiently Testing Simon's Congruence. STACS 2021: 34:1-34:18 - [c101]Pawel Gawrychowski, Wojciech Janczewski:
Fully dynamic approximation of LIS in polylogarithmic time. STOC 2021: 654-667 - [c100]Giulia Bernardini, Paola Bonizzoni, Pawel Gawrychowski:
Incomplete Directed Perfect Phylogeny in Linear Time. WADS 2021: 172-185 - [c99]Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski:
Strictly In-Place Algorithms for Permuting and Inverting Permutations. WADS 2021: 329-342 - [c98]Pawel Gawrychowski, Przemyslaw Uznanski:
Better Distance Labeling for Unweighted Planar Graphs. WADS 2021: 428-441 - [e1]Pawel Gawrychowski, Tatiana Starikovskaya:
32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland. LIPIcs 191, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-186-3 [contents] - [i91]Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski:
Strictly In-Place Algorithms for Permuting and Inverting Permutations. CoRR abs/2101.03978 (2021) - [i90]Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Fault-Tolerant Distance Labeling for Planar Graphs. CoRR abs/2102.07154 (2021) - [i89]Pawel Gawrychowski, Wojciech Janczewski:
Conditional Lower Bounds for Variants of Dynamic LIS. CoRR abs/2102.11797 (2021) - [i88]Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
An Almost Optimal Edit Distance Oracle. CoRR abs/2103.03294 (2021) - [i87]Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann:
The Theory of Universal Graphs for Infinite Duration Games. CoRR abs/2104.05262 (2021) - [i86]Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski:
The Dynamic k-Mismatch Problem. CoRR abs/2105.06166 (2021) - [i85]Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau:
Lower Bounds for the Number of Repetitions in 2D Strings. CoRR abs/2105.14903 (2021) - [i84]Pawel Gawrychowski, Florin Manea, Stefan Siemer:
Matching Patterns with Variables under Hamming Distance. CoRR abs/2106.06249 (2021) - [i83]Pawel Gawrychowski, Mateusz Rzepecki:
Faster Exponential Algorithm for Permutation Pattern Matching. CoRR abs/2108.11475 (2021) - [i82]Simon Apers, Pawel Gawrychowski, Troy Lee:
Finding the KT partition of a weighted graph in near-linear time. CoRR abs/2111.01378 (2021) - [i81]Moses Ganardi, Pawel Gawrychowski:
Pattern Matching on Grammar-Compressed Strings in Linear Time. CoRR abs/2111.05016 (2021) - 2020
- [j21]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search. ACM Trans. Algorithms 16(2): 16:1-16:24 (2020) - [j20]Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can). ACM Trans. Algorithms 16(4): 48:1-48:22 (2020) - [j19]Pawel Gawrychowski, Seungbum Jo, Shay Mozes, Oren Weimann:
Compressed range minimum queries. Theor. Comput. Sci. 812: 39-48 (2020) - [j18]Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Universal reconstruction of a string. Theor. Comput. Sci. 812: 174-186 (2020) - [c97]Giulia Bernardini, Paola Bonizzoni, Pawel Gawrychowski:
On Two Measures of Distance Between Fully-Labelled Trees. CPM 2020: 6:1-6:16 - [c96]Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau:
On Indeterminate Strings Matching. CPM 2020: 14:1-14:14 - [c95]Panagiotis Charalampopoulos, Pawel Gawrychowski, Karol Pokorski:
Dynamic Longest Common Substring in Polylogarithmic Time. ICALP 2020: 27:1-27:19 - [c94]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Minimum Cut in O(m log² n) Time. ICALP 2020: 57:1-57:15 - [c93]Anadi Agrawal, Pawel Gawrychowski:
A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem. ISAAC 2020: 4:1-4:12 - [c92]Bartlomiej Dudek, Pawel Gawrychowski:
Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs. ISAAC 2020: 23:1-23:18 - [c91]Maciej Duleba, Pawel Gawrychowski, Wojciech Janczewski:
Efficient Labeling for Reachability in Directed Acyclic Graphs. ISAAC 2020: 27:1-27:14 - [c90]Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann:
Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games. MFCS 2020: 34:1-34:15 - [c89]Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula:
Existential Length Universality. STACS 2020: 16:1-16:14 - [c88]Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya:
Generalised Pattern Matching Revisited. STACS 2020: 18:1-18:18 - [c87]Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya:
All non-trivial variants of 3-LDT are equivalent. STOC 2020: 974-981 - [i80]Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya:
All non-trivial variants of 3-LDT are equivalent. CoRR abs/2001.01289 (2020) - [i79]Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya:
Generalised Pattern Matching Revisited. CoRR abs/2001.05976 (2020) - [i78]Giulia Bernardini, Paola Bonizzoni, Pawel Gawrychowski:
On Two Measures of Distance between Fully-Labelled Trees. CoRR abs/2002.05600 (2020) - [i77]Pawel Gawrychowski, Wojciech Janczewski, Jakub Lopuszanski:
Shorter Labels for Routing in Trees. CoRR abs/2003.06691 (2020) - [i76]Anadi Agrawal, Pawel Gawrychowski:
A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem. CoRR abs/2003.13589 (2020) - [i75]Pawel Gawrychowski, Maria Kosche, Tore Koss, Florin Manea, Stefan Siemer:
Efficiently Testing Simon's Congruence. CoRR abs/2005.01112 (2020) - [i74]Panagiotis Charalampopoulos, Pawel Gawrychowski, Karol Pokorski:
Dynamic Longest Common Substring in Polylogarithmic Time. CoRR abs/2006.02408 (2020) - [i73]Maciej Duleba, Pawel Gawrychowski, Wojciech Janczewski:
Efficient Labeling for Reachability in Digraphs. CoRR abs/2007.06105 (2020) - [i72]Giulia Bernardini, Gabriele Fici, Pawel Gawrychowski, Solon P. Pissis:
Substring Complexity in Sublinear Space. CoRR abs/2007.08357 (2020) - [i71]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
A Note on a Recent Algorithm for Minimum Cut. CoRR abs/2008.02060 (2020) - [i70]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Tight Bound for the Number of Distinct Palindromes in a Tree. CoRR abs/2008.13209 (2020) - [i69]Bartlomiej Dudek, Pawel Gawrychowski:
Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs. CoRR abs/2010.00348 (2020) - [i68]Giulia Bernardini, Paola Bonizzoni, Pawel Gawrychowski:
Incomplete Directed Perfect Phylogeny in Linear Time. CoRR abs/2010.05644 (2020) - [i67]Pawel Gawrychowski, Wojciech Janczewski:
Fully Dynamic Approximation of LIS in Polylogarithmic Time. CoRR abs/2011.09761 (2020)
2010 – 2019
- 2019
- [j17]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) - [j16]Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka:
Hide and seek with repetitions. J. Comput. Syst. Sci. 101: 42-67 (2019) - [c86]Pawel Gawrychowski:
How to Exploit Periodicity (Invited Talk). CPM 2019: 1:1-1:1 - [c85]Pawel Gawrychowski, Tatiana Starikovskaya:
Streaming Dictionary Matching with Mismatches. CPM 2019: 21:1-21:15 - [c84]Pawel Gawrychowski, Jakub Radoszewski, Tatiana Starikovskaya:
Quasi-Periodicity in Streams. CPM 2019: 22:1-22:14 - [c83]Giulia Bernardini, Pawel Gawrychowski, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication. ICALP 2019: 21:1-21:15 - [c82]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. ISAAC 2019: 4:1-4:18 - [c81]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 - [c80]Gabriele Fici, Pawel Gawrychowski:
Minimal Absent Words in Rooted and Unrooted Trees. SPIRE 2019: 152-161 - [c79]Pawel Gawrychowski, Florin Manea, Radoslaw Serafin:
Fast and Longest Rollercoasters. STACS 2019: 30:1-30:17 - [c78]Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Almost optimal distance oracles for planar graphs. STOC 2019: 138-151 - [c77]Bartlomiej Dudek, Pawel Gawrychowski:
Computing quartet distance is equivalent to counting 4-cycles. STOC 2019: 733-743 - [i66]Philip Bille, Inge Li Gørtz, Pawel Gawrychowski, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. CoRR abs/1902.02187 (2019) - [i65]Pawel Gawrychowski, Seungbum Jo, Shay Mozes, Oren Weimann:
Compressed Range Minimum Queries. CoRR abs/1902.04427 (2019) - [i64]Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski:
RLE edit distance in near optimal time. CoRR abs/1905.01254 (2019) - [i63]Giulia Bernardini, Pawel Gawrychowski, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication. CoRR abs/1905.02298 (2019) - [i62]Gabriele Fici, Pawel Gawrychowski:
Minimal Absent Words in Rooted and Unrooted Trees. CoRR abs/1907.12034 (2019) - [i61]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Minimum Cut in O(m log2n) Time. CoRR abs/1911.01145 (2019) - 2018
- [j15]Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea:
Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets. Theory Comput. Syst. 62(1): 162-191 (2018) - [j14]Pawel Gawrychowski, Lukasz Zatorski:
Speeding up dynamic programming in the line-constrained k-median. Theory Comput. Syst. 62(6): 1351-1365 (2018) - [j13]Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann:
The nearest colored node in a tree. Theor. Comput. Sci. 710: 66-73 (2018) - [c76]Alexander Schickedanz, Deepak Ajwani, Ulrich Meyer, Pawel Gawrychowski:
Average-Case Behavior of k-Shortest Path Algorithms. COMPLEX NETWORKS (1) 2018: 28-40 - [c75]Bartlomiej Dudek, Pawel Gawrychowski:
Slowing Down Top Trees for Better Worst-Case Compression. CPM 2018: 16:1-16:8 - [c74]Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Near-Optimal Distance Emulator for Planar Graphs. ESA 2018: 16:1-16:17 - [c73]Michal Ganczorz, Pawel Gawrychowski, Artur Jez, Tomasz Kociumaka:
Edit Distance with Block Operations. ESA 2018: 33:1-33:14 - [c72]Bartlomiej Dudek, Pawel Gawrychowski:
Edit Distance between Unrooted Trees in Cubic Time. ICALP 2018: 45:1-45:14 - [c71]Pawel Gawrychowski, Adam Karczmarz:
Improved Bounds for Shortest Paths in Dense Distance Graphs. ICALP 2018: 61:1-61:15 - [c70]Pawel Gawrychowski, Przemyslaw Uznanski:
Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance. ICALP 2018: 62:1-62:13 - [c69]Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann:
A Faster Construction of Greedy Consensus Trees. ICALP 2018: 63:1-63:14 - [c68]Pawel Gawrychowski, Liran Markin, Oren Weimann:
A Faster FPTAS for #Knapsack. ICALP 2018: 64:1-64:13 - [c67]Pawel Gawrychowski, Gad M. Landau, Tatiana Starikovskaya:
Fast Entropy-Bounded String Dictionary Look-Up with Mismatches. MFCS 2018: 66:1-66:15 - [c66]Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann:
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time. SODA 2018: 495-514 - [c65]Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen:
Better Tradeoffs for Exact Distance Oracles in Planar Graphs. SODA 2018: 515-529 - [c64]Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Near-Optimal Compression for the Planar Graph Metric. SODA 2018: 530-549 - [c63]Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). SODA 2018: 1190-1206 - [c62]Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski:
Optimal Dynamic Strings. SODA 2018: 1509-1528 - [c61]Pawel Gawrychowski, Fabian Kuhn, Jakub Lopuszanski, Konstantinos Panagiotou, Pascal Su:
Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees. SODA 2018: 2604-2619 - [i60]Bartlomiej Dudek, Pawel Gawrychowski:
Slowing Down Top Trees for Better Worst-Case Bounds. CoRR abs/1801.01059 (2018) - [i59]Pawel Gawrychowski, Liran Markin, Oren Weimann:
A Faster FPTAS for #Knapsack. CoRR abs/1802.05791 (2018) - [i58]Bartlomiej Dudek, Pawel Gawrychowski:
Edit Distance between Unrooted Trees in Cubic Time. CoRR abs/1804.10186 (2018) - [i57]Pawel Gawrychowski, Gad M. Landau, Tatiana Starikovskaya:
Fast entropy-bounded string dictionary look-up with mismatches. CoRR abs/1806.09646 (2018) - [i56]Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Near-Optimal Distance Emulator for Planar Graphs. CoRR abs/1807.01478 (2018) - [i55]Pawel Gawrychowski, Tatiana Starikovskaya:
Streaming dictionary matching with mismatches. CoRR abs/1809.02517 (2018) - [i54]Pawel Gawrychowski, Florin Manea, Radoslaw Serafin:
Fast and Longest Rollercoasters. CoRR abs/1810.07422 (2018) - [i53]Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Almost Optimal Distance Oracles for Planar Graphs. CoRR abs/1811.01551 (2018) - [i52]Bartlomiej Dudek, Pawel Gawrychowski:
Computing Quartet Distance is Equivalent to Counting 4-Cycles. CoRR abs/1811.06244 (2018) - [i51]Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann:
The complexity of mean payoff games using universal graphs. CoRR abs/1812.07072 (2018) - 2017
- [j12]Marius Dumitran, Pawel Gawrychowski, Florin Manea:
Longest Gapped Repeats and Palindromes. Discret. Math. Theor. Comput. Sci. 19(4) (2017) - [c60]Bartlomiej Dudek, Pawel Gawrychowski, Piotr Ostropolski-Nalewaja:
A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem. CPM 2017: 10:1-10:14 - [c59]Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes, Oren Weimann:
Dispersion on Trees. ESA 2017: 40:1-40:13 - [c58]Ofer Freedman, Pawel Gawrychowski, Patrick K. Nicholson, Oren Weimann:
Optimal Distance Labeling Schemes for Trees. PODC 2017: 185-194 - [c57]Pawel Gawrychowski, Tomasz Kociumaka:
Sparse Suffix Tree Construction in Optimal Time and Space. SODA 2017: 425-439 - [c56]Mika Amit, Pawel Gawrychowski:
Distinct Squares in Circular Words. SPIRE 2017: 27-37 - [c55]Pawel Gawrychowski, Patrick K. Nicholson:
Optimal Query Time for Encoding Range Majority. WADS 2017: 409-420 - [i50]Bartlomiej Dudek, Pawel Gawrychowski, Piotr Ostropolski-Nalewaja:
A family of approximation algorithms for the maximum duo-preservation string mapping problem. CoRR abs/1702.02405 (2017) - [i49]Pawel Gawrychowski, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula:
Existential length universality. CoRR abs/1702.03961 (2017) - [i48]Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Near-Optimal Compression for the Planar Graph Metric. CoRR abs/1703.04814 (2017) - [i47]Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). CoRR abs/1703.08940 (2017) - [i46]Pawel Gawrychowski, Przemyslaw Uznanski:
Optimal trade-offs for pattern matching with k mismatches. CoRR abs/1704.01311 (2017) - [i45]Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann:
Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ(n5/3) time. CoRR abs/1704.02793 (2017) - [i44]Pawel Gawrychowski, Patrick K. Nicholson:
Optimal Query Time for Encoding Range Majority. CoRR abs/1704.06149 (2017) - [i43]Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann:
A Faster Construction of Phylogenetic Consensus Trees. CoRR abs/1705.10548 (2017) - [i42]Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes, Oren Weimann:
Dispersion on Trees. CoRR abs/1706.09185 (2017) - [i41]Pawel Gawrychowski, Jakub Lopuszanski:
Better Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees. CoRR abs/1707.06011 (2017) - [i40]Mika Amit, Pawel Gawrychowski:
Distinct Squares in Circular Words. CoRR abs/1708.00639 (2017) - [i39]Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen:
Better Tradeoffs for Exact Distance Oracles in Planar Graphs. CoRR abs/1708.01386 (2017) - 2016
- [j11]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Longest common extensions in trees. Theor. Comput. Sci. 638: 98-107 (2016) - [j10]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Ignat I. Kolesnichenko, Tatiana Starikovskaya:
Computing minimal and maximal suffixes of a substring. Theor. Comput. Sci. 638: 112-121 (2016) - [j9]Pawel Gawrychowski, Przemyslaw Uznanski:
Order-preserving pattern matching with k mismatches. Theor. Comput. Sci. 638: 136-144 (2016) - [c54]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Faster Longest Common Extension Queries in Strings over General Alphabets. CPM 2016: 5:1-5:13 - [c53]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 - [c52]Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann:
The Nearest Colored Node in a Tree. CPM 2016: 25:1-25:12 - [c51]Pawel Gawrychowski, Artur Jez:
LZ77 Factorisation of Trees. FSTTCS 2016: 35:1-35:15 - [c50]Pawel Gawrychowski, Lukasz Zatorski:
Speeding up Dynamic Programming in the Line-Constrained k-median. IWOCA 2016: 293-305 - [c49]Pawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski:
Brief Announcement: Sublinear-Space Distance Labeling Using Hubs. PODC 2016: 43-45 - [c48]Patrick Hagge Cording, Pawel Gawrychowski, Oren Weimann:
Bookmarks in Grammar-Compressed Strings. SPIRE 2016: 153-159 - [c47]Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea:
Efficiently Finding All Maximal alpha-gapped Repeats. STACS 2016: 39:1-39:14 - [c46]Pawel Gawrychowski, Jukka Suomela, Przemyslaw Uznanski:
Randomized Algorithms for Finding a Majority Element. SWAT 2016: 9:1-9:14 - [c45]Pawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski:
Sublinear-Space Distance Labeling Using Hubs. DISC 2016: 230-242 - [i38]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Faster Longest Common Extension Queries in Strings over General Alphabets. CoRR abs/1602.00447 (2016) - [i37]Pawel Gawrychowski, Adam Karczmarz:
Improved Bounds for Shortest Paths in Dense Distance Graphs. CoRR abs/1602.07013 (2016) - [i36]Pawel Gawrychowski, Jukka Suomela, Przemyslaw Uznanski:
Randomized algorithms for finding a majority element. CoRR abs/1603.01583 (2016) - [i35]Ofer Freedman, Pawel Gawrychowski, Patrick K. Nicholson, Oren Weimann:
Optimal Distance Labeling Schemes for Trees. CoRR abs/1608.00212 (2016) - [i34]Pawel Gawrychowski, Tomasz Kociumaka:
Sparse Suffix Tree Construction in Optimal Time and Space. CoRR abs/1608.00865 (2016) - [i33]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) - [i32]Pawel Gawrychowski, Przemyslaw Uznanski:
A note on distance labeling in planar graphs. CoRR abs/1611.06529 (2016) - 2015
- [j8]Travis Gagie, Pawel Gawrychowski, Simon J. Puglisi:
Approximate pattern matching in LZ77-compressed texts. J. Discrete Algorithms 32: 64-68 (2015) - [c44]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Longest Common Extensions in Trees. CPM 2015: 52-64 - [c43]Johannes Fischer, Pawel Gawrychowski:
Alphabet-Dependent String Searching with Wexponential Search Trees. CPM 2015: 160-171 - [c42]Pawel Gawrychowski, Patrick K. Nicholson:
Encodings of Range Maximum-Sum Segment Queries and Applications. CPM 2015: 196-206 - [c41]Djamal Belazzougui, Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Alberto Ordóñez Pereira, Simon J. Puglisi, Yasuo Tabei:
Queries on LZ-Bounded Encodings. DCC 2015: 83-92 - [c40]Johannes Fischer, Travis Gagie, Pawel Gawrychowski, Tomasz Kociumaka:
Approximating LZ77 via Small-Space Multiple-Pattern Matching. ESA 2015: 533-544 - [c39]Pawel Gawrychowski, Florin Manea:
Longest α-Gapped Repeat and Palindrome. FCT 2015: 27-40 - [c38]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search. ICALP (1) 2015: 580-592 - [c37]Pawel Gawrychowski, Patrick K. Nicholson:
Optimal Encodings for Range Top- k k , Selection, and Min-Max. ICALP (1) 2015: 593-604 - [c36]Pawel Gawrychowski, Damian Straszak:
Strong Inapproximability of the Shortest Reset Word. MFCS (1) 2015: 243-255 - [c35]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya:
Wavelet Trees Meet Suffix Trees. SODA 2015: 572-591 - [c34]Pawel Gawrychowski, Gregory Kucherov, Benjamin Sach, Tatiana Starikovskaya:
Computing the Longest Unbordered Substring. SPIRE 2015: 246-257 - [c33]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Tight Bound for the Number of Distinct Palindromes in a Tree. SPIRE 2015: 270-276 - [c32]Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Universal Reconstruction of a String. WADS 2015: 386-397 - [c31]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 - [i31]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Submatrix Maximum Queries in Monge Matrices are Equivalent to Predecessor Search. CoRR abs/1502.07663 (2015) - [i30]Johannes Fischer, Travis Gagie, Pawel Gawrychowski, Tomasz Kociumaka:
Approximating LZ77 via Small-Space Multiple-Pattern Matching. CoRR abs/1504.06647 (2015) - [i29]Pawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski:
Even Simpler Distance Labeling for (Sparse) Graphs. CoRR abs/1507.06240 (2015) - [i28]Dominik D. Freydenberger, Pawel Gawrychowski, Juhani Karhumäki, Florin Manea, Wojciech Rytter:
Testing k-binomial equivalence. CoRR abs/1509.00622 (2015) - [i27]Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea:
Efficiently Finding All Maximal $α$-gapped Repeats. CoRR abs/1509.09237 (2015) - [i26]Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski:
Optimal Dynamic Strings. CoRR abs/1511.02612 (2015) - [i25]Marius Dumitran, Pawel Gawrychowski, Florin Manea:
Longest Gapped Repeats and Palindromes. CoRR abs/1511.07180 (2015) - 2014
- [j7]Pawel Gawrychowski:
Simple and efficient LZW-compressed multiple pattern matching. J. Discrete Algorithms 25: 34-41 (2014) - [j6]Pawel Gawrychowski, Artur Jez, Lukasz Jez:
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online. Theory Comput. Syst. 54(2): 337-372 (2014) - [c30]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya:
Computing Minimal and Maximal Suffixes of a Substring Revisited. CPM 2014: 30-39 - [c29]Pawel Gawrychowski, Przemyslaw Uznanski:
Order-Preserving Pattern Matching with k Mismatches. CPM 2014: 130-139 - [c28]Pawel Gawrychowski, Moshe Lewenstein, Patrick K. Nicholson:
Weighted Ancestors in Suffix Trees. ESA 2014: 455-466 - [c27]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Improved Submatrix Maximum Queries in Monge Matrices. ICALP (1) 2014: 525-537 - [c26]Pawel Gawrychowski, Damian Rusak:
Euclidean TSP with Few Inner Points in Linear Space. ISAAC 2014: 701-713 - [c25]Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi:
LZ77-Based Self-indexing with Faster Pattern Matching. LATIN 2014: 731-742 - [c24]Pawel Gawrychowski, Florin Manea, Dirk Nowotka:
Testing Generalised Freeness of Words. STACS 2014: 337-349 - [i24]Pawel Gawrychowski, Damian Rusak:
Euclidean TSP with few inner points in linear space. CoRR abs/1406.2154 (2014) - [i23]Pawel Gawrychowski, Moshe Lewenstein, Patrick K. Nicholson:
Weighted ancestors in suffix trees. CoRR abs/1406.7716 (2014) - [i22]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) - [i21]Pawel Gawrychowski, Damian Straszak:
Strong inapproximability of the shortest reset word. CoRR abs/1408.5248 (2014) - [i20]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya:
Wavelet Trees Meet Suffix Trees. CoRR abs/1408.6182 (2014) - [i19]Patrick K. Nicholson, Pawel Gawrychowski:
Encodings of Range Maximum-Sum Segment Queries and Applications. CoRR abs/1410.2847 (2014) - [i18]Pawel Gawrychowski, Przemyslaw Uznanski:
Tight tradeoffs for approximating palindromes in streams. CoRR abs/1410.6433 (2014) - [i17]Pawel Gawrychowski, Patrick K. Nicholson:
Optimal Encodings for Range Min-Max and Top-k. CoRR abs/1411.6581 (2014) - [i16]Djamal Belazzougui, Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Alberto Ordóñez Pereira, Simon J. Puglisi, Yasuo Tabei:
Queries on LZ-Bounded Encodings. CoRR abs/1412.0967 (2014) - 2013
- [j5]Pawel Gawrychowski, Travis Gagie:
Minimax trees in linear time with applications. Eur. J. Comb. 34(1): 82-90 (2013) - [j4]Pawel Gawrychowski:
Optimal Pattern Matching in LZW Compressed Strings. ACM Trans. Algorithms 9(3): 25:1-25:17 (2013) - [c23]Travis Gagie, Pawel Gawrychowski, Yakov Nekrich:
Heaviest Induced Ancestors and Longest Common Substrings. CCCG 2013 - [c22]Pawel Gawrychowski, Florin Manea, Dirk Nowotka:
Discovering Hidden Repetitions in Words. CiE 2013: 210-219 - [c21]Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda:
Converting SLP to LZ78 in almost Linear Time. CPM 2013: 38-49 - [c20]Pawel Gawrychowski:
Alphabetic Minimax Trees in Linear Time. CSR 2013: 36-48 - [c19]Pawel Gawrychowski, Damian Straszak:
Beating $\mathcal{O}(nm)$ in Approximate LZW-Compressed Pattern Matching. ISAAC 2013: 78-88 - [c18]Pawel Gawrychowski, Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya:
Minimal Discriminating Words Problem Revisited. SPIRE 2013: 129-140 - [c17]Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka, Catalin Tiseanu:
Finding Pseudo-repetitions. STACS 2013: 257-268 - [i15]Johannes Fischer, Pawel Gawrychowski:
Alphabet-Dependent String Searching with Wexponential Search Trees. CoRR abs/1302.3347 (2013) - [i14]Travis Gagie, Pawel Gawrychowski, Yakov Nekrich:
Heaviest Induced Ancestors and Longest Common Substrings. CoRR abs/1305.3164 (2013) - [i13]Pawel Gawrychowski, Damian Straszak:
Beating O(nm) in approximate LZW-compressed pattern matching. CoRR abs/1308.6509 (2013) - [i12]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya:
Substring Suffix Selection. CoRR abs/1309.5618 (2013) - [i11]Pawel Gawrychowski, Przemyslaw Uznanski:
Order-preserving pattern matching with k mismatches. CoRR abs/1309.6453 (2013) - 2012
- [c16]Pawel Gawrychowski:
Simple and Efficient LZW-Compressed Multiple Pattern Matching. CPM 2012: 232-242 - [c15]Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi:
A Faster Grammar-Based Self-index. LATA 2012: 240-251 - [c14]Pawel Gawrychowski:
Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings. SPIRE 2012: 229-236 - [c13]Pawel Gawrychowski:
Tying up the loose ends in fully LZW-compressed pattern matching. STACS 2012: 624-635 - [i10]Travis Gagie, Pawel Gawrychowski:
Linear-Space Substring Range Counting over Polylogarithmic Alphabets. CoRR abs/1202.3208 (2012) - [i9]Pawel Gawrychowski:
(Really) Tight bounds for dispatching binary methods. CoRR abs/1202.5670 (2012) - 2011
- [c12]Pawel Gawrychowski:
Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic. ESA 2011: 421-432 - [c11]Travis Gagie, Pawel Gawrychowski, Simon J. Puglisi:
Faster Approximate Pattern Matching in Compressed Repetitive Texts. ISAAC 2011: 653-662 - [c10]Pawel Gawrychowski, Artur Jez, Andreas Maletti:
On Minimising Automata with Errors. MFCS 2011: 327-338 - [c9]Pawel Gawrychowski:
Optimal pattern matching in LZW compressed strings. SODA 2011: 362-372 - [c8]Pawel Gawrychowski:
Chrobak Normal Form Revisited, with Applications. CIAA 2011: 142-153 - [i8]Pawel Gawrychowski, Artur Jez, Andreas Maletti:
On minimising automata with errors. CoRR abs/1102.5682 (2011) - [i7]Pawel Gawrychowski:
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic. CoRR abs/1104.4203 (2011) - [i6]Travis Gagie, Pawel Gawrychowski, Simon J. Puglisi:
Faster Approximate Pattern Matching in Compressed Repetitive Texts. CoRR abs/1109.2930 (2011) - [i5]Travis Gagie, Pawel Gawrychowski:
A Faster LZ77-Based Index. CoRR abs/1109.3954 (2011) - [i4]Pawel Gawrychowski:
Tying up the loose ends in fully LZW-compressed pattern matching. CoRR abs/1109.4034 (2011) - 2010
- [j3]Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey O. Shallit:
Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time. Int. J. Found. Comput. Sci. 21(4): 597-618 (2010) - [j2]Jaroslaw Byrka, Pawel Gawrychowski, Katharina T. Huber, Steven Kelk:
Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks. J. Discrete Algorithms 8(1): 65-75 (2010) - [j1]Pawel Gawrychowski, Marin Gutan, Andrzej Kisielewicz:
On the problem of freeness of multiplicative matrix semigroups. Theor. Comput. Sci. 411(7-9): 1115-1120 (2010) - [c7]Pawel Gawrychowski, Artur Jez, Lukasz Jez:
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online. CSR 2010: 132-143 - [c6]Travis Gagie, Pawel Gawrychowski:
Grammar-Based Compression in a Streaming Model. LATA 2010: 273-284
2000 – 2009
- 2009
- [c5]Pawel Gawrychowski, Travis Gagie:
Minimax Trees in Linear Time with Applications. IWOCA 2009: 278-288 - [c4]Pawel Gawrychowski, Artur Jez:
Hyper-minimisation Made Efficient. MFCS 2009: 356-368 - [i3]Pawel Gawrychowski, Travis Gagie:
Minimax Trees in Linear Time with Applications. Search Methodologies 2009 - [i2]Pawel Gawrychowski, Artur Jez, Lukasz Jez:
Optimal, online validation of the pi and pi' failure functions. CoRR abs/0901.2897 (2009) - 2008
- [c3]Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey O. Shallit:
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time. Developments in Language Theory 2008: 339-358 - [c2]Pawel Gawrychowski, Andrzej Kisielewicz:
2-Synchronizing Words. LATA 2008: 221-231 - [i1]Pawel Gawrychowski, Travis Gagie:
Minimax Trees in Linear Time. CoRR abs/0812.2868 (2008) - 2006
- [c1]Alessandra Cherubini, Pawel Gawrychowski, Andrzej Kisielewicz, Brunetto Piochi:
A Combinatorial Approach to Collapsing Words. MFCS 2006: 256-266
Coauthor Index
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 2024-10-18 19:27 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:
