Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDPawel Gawrychowski
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 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]