Остановите войну!
for scientists:
default search action
Pawel Gawrychowski
- > Home > Persons > Pawel Gawrychowski
Publications
- 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) - 2015
- [j8]Travis Gagie, Pawel Gawrychowski, Simon J. Puglisi:
Approximate pattern matching in LZ77-compressed texts. J. Discrete Algorithms 32: 64-68 (2015) - [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 - [i30]Johannes Fischer, Travis Gagie, Pawel Gawrychowski, Tomasz Kociumaka:
Approximating LZ77 via Small-Space Multiple-Pattern Matching. CoRR abs/1504.06647 (2015) - 2014
- [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 - [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) - [c23]Travis Gagie, Pawel Gawrychowski, Yakov Nekrich:
Heaviest Induced Ancestors and Longest Common Substrings. CCCG 2013 - [i14]Travis Gagie, Pawel Gawrychowski, Yakov Nekrich:
Heaviest Induced Ancestors and Longest Common Substrings. CoRR abs/1305.3164 (2013) - 2012
- [c15]Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi:
A Faster Grammar-Based Self-index. LATA 2012: 240-251 - [i10]Travis Gagie, Pawel Gawrychowski:
Linear-Space Substring Range Counting over Polylogarithmic Alphabets. CoRR abs/1202.3208 (2012) - 2011
- [c11]Travis Gagie, Pawel Gawrychowski, Simon J. Puglisi:
Faster Approximate Pattern Matching in Compressed Repetitive Texts. ISAAC 2011: 653-662 - [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) - 2010
- [c6]Travis Gagie, Pawel Gawrychowski:
Grammar-Based Compression in a Streaming Model. LATA 2010: 273-284 - 2009
- [c5]Pawel Gawrychowski, Travis Gagie:
Minimax Trees in Linear Time with Applications. IWOCA 2009: 278-288 - [i3]Pawel Gawrychowski, Travis Gagie:
Minimax Trees in Linear Time with Applications. Search Methodologies 2009 - 2008
- [i1]Pawel Gawrychowski, Travis Gagie:
Minimax Trees in Linear Time. CoRR abs/0812.2868 (2008)
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-04-11 20:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint