![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Tomasz Kociumaka
Max Planck Institute for Informatics, Saarbrücken, Germany
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 231 matches
- 2024
- Hideo Bannai
, Tomohiro I
, Tomasz Kociumaka
, Dominik Köppl
, Simon J. Puglisi
:
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. Algorithmica 86(3): 735-756 (2024) - Tomasz Kociumaka, Gonzalo Navarro, Francisco Olivares
:
Near-Optimal Search Time in δ-Optimal Space, and Vice Versa. Algorithmica 86(4): 1031-1056 (2024) - Dvir Fried
, Shay Golan
, Tomasz Kociumaka
, Tsvi Kopelowitz
, Ely Porat
, Tatiana Starikovskaya
:
An Improved Algorithm for The k-Dyck Edit Distance Problem. ACM Trans. Algorithms 20(3): 26 (2024) - Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka:
Faster Sublinear-Time Edit Distance. SODA 2024: 3274-3301 - Karl Bringmann, Nick Fischer, Ivor van der Hoog
, Evangelos Kipouridis
, Tomasz Kociumaka
, Eva Rotenberg
:
Dynamic Dynamic Time Warping. SODA 2024: 208-242 - Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan:
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. SODA 2024: 3302-3332 - Debarati Das
, Jacob Gilbert
, MohammadTaghi Hajiaghayi
, Tomasz Kociumaka
, Barna Saha
:
Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC. SPAA 2024: 293-295 - Tomasz Kociumaka
, Jakob Nogler
, Philip Wellnitz
:
On the Communication Complexity of Approximate Pattern Matching. STOC 2024: 1758-1768 - Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz:
On the Communication Complexity of Approximate Pattern Matching. CoRR abs/2403.18812 (2024) - Egor Gorbachev, Tomasz Kociumaka:
Bounded Edit Distance: Optimal Static and Dynamic Algorithms for Small Integer Weights. CoRR abs/2404.06401 (2024) - 2023
- Tomasz Kociumaka
, Jakub Radoszewski
, Tatiana Starikovskaya:
Publisher Correction: Longest Common Substring with Approximately k Mismatches. Algorithmica 85(10): 3323 (2023) - 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) - Tomasz Kociumaka, Gonzalo Navarro
, Nicola Prezza
:
Toward a Definitive Compressibility Measure for Repetitive Sequences. IEEE Trans. Inf. Theory 69(4): 2074-2092 (2023) - Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. CPM 2023: 15:1-15:15 - Tomasz Kociumaka, Adam Polak
:
Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths. ESA 2023: 72:1-72:10 - Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz
:
Optimal Algorithms for Bounded Weighted Edit Distance. FOCS 2023: 2177-2187 - Dominik Kempa, Tomasz Kociumaka:
Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space. FOCS 2023: 1877-1886 - Tomasz Kociumaka, Anish Mukherjee, Barna Saha:
Approximating Edit Distance in the Fully Dynamic Model. FOCS 2023: 1628-1638 - Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha:
An Algorithmic Bridge Between Hamming and Levenshtein Distances. ITCS 2023: 58:1-58:23 - Gabriel Bathie, Tomasz Kociumaka, Tatiana Starikovskaya:
Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares. ISAAC 2023: 10:1-10:17 - Dominik Kempa
, Tomasz Kociumaka
:
Breaking the 𝒪(n)-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees. SODA 2023: 5122-5202 - Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha:
Weighted Edit Distance Computation: Strings, Trees, and Dyck. STOC 2023: 377-390 - Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha:
Weighted Edit Distance Computation: Strings, Trees and Dyck. CoRR abs/2302.04229 (2023) - Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz
:
Optimal Algorithms for Bounded Weighted Edit Distance. CoRR abs/2305.06659 (2023) - Tomasz Kociumaka, Anish Mukherjee, Barna Saha:
Approximating Edit Distance in the Fully Dynamic Model. CoRR abs/2307.07175 (2023) - Dominik Kempa, Tomasz Kociumaka:
Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space. CoRR abs/2308.03635 (2023) - Gabriel Bathie, Tomasz Kociumaka, Tatiana Starikovskaya:
Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares. CoRR abs/2309.14788 (2023) - Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg:
Dynamic Dynamic Time Warping. CoRR abs/2310.18128 (2023) - Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan:
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. CoRR abs/2311.01793 (2023) - Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka:
Faster Sublinear-Time Edit Distance. CoRR abs/2312.01759 (2023)
skipping 201 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 06:29 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint