• Refine your search:
  • 
    Keyword:
    
    • Data Structures and Algorithms cs.DS (14)
    • FOS Computer and information sciences (14)
    • Data processing Computer science (3)
    • Computer Science (2)
    • E.1; F.2.2 (2)
    • F.2.2 (2)
    • Theory of computation → Pattern matching (2)
    • longest common substring (2)
    • 68P05 Primary, 68W05 Secondary (1)
    • 68P05, 68W32 (1)
    •   more
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium:
    
    • Online (22)
  • 
    Type
  • 
    BLLDB-Access

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Page: 1 2 Hits 1 – 20 of 22 1 Dynamic Suffix Array with Polylogarithmic Queries and Updates ... Kempa, Dominik; Kociumaka, Tomasz. - : arXiv, 2022 BASE Show details 2 Faster Algorithms for Longest Common Substring ... Charalampopoulos, Panagiotis; Kociumaka, Tomasz; Pissis, Solon P.. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 3 Breaking the $O(n)$-Barrier in the Construction of Compressed Suffix Arrays ... Kempa, Dominik; Kociumaka, Tomasz. - : arXiv, 2021 BASE Show details 4 Faster Algorithms for Longest Common Substring ... Charalampopoulos, Panagiotis; Kociumaka, Tomasz; Pissis, Solon P.. - : arXiv, 2021 BASE Show details 5 Time-Space Tradeoffs for Finding a Long Common Substring ... Ben-Nun, Stav; Golan, Shay; Kociumaka, Tomasz. - : arXiv, 2020 BASE Show details 6 Time-Space Tradeoffs for Finding a Long Common Substring ... Ben-Nun, Stav; Golan, Shay; Kociumaka, Tomasz. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 BASE Show details 7 Practical Performance of Space Efficient Data Structures for Longest Common Extensions ... Dinklage, Patrick; Fischer, Johannes; Herlez, Alexander. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 BASE Show details 8 Faster Approximate Pattern Matching: A Unified Approach ... Charalampopoulos, Panagiotis; Kociumaka, Tomasz; Wellnitz, Philip. - : arXiv, 2020 BASE Show details 9 Longest Unbordered Factor in Quasilinear Time Kociumaka, Tomasz; Kundu, Ritu; Mohamed, Manal. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. : LIPIcs - Leibniz International Proceedings in Informatics. 29th International Symposium on Algorithms and Computation (ISAAC 2018), 2018 BASE Show details 10 Longest Unbordered Factor in Quasilinear Time ... Kociumaka, Tomasz; Kundu, Ritu; Mohamed, Manal. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2018 BASE Show details 11 Longest Unbordered Factor in Quasilinear Time ... Kociumaka, Tomasz; Kundu, Ritu; Mohamed, Manal. - : arXiv, 2018 BASE Show details 12 Maximal Unbordered Factors of Random Strings ... Cording, Patrick Hagge; Gagie, Travis; Knudsen, Mathias Bæk Tejs. - : arXiv, 2017 BASE Show details 13 Efficient Index for Weighted Sequences Barton, Carl; Kociumaka, Tomasz; Pissis, Solon P.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. : LIPIcs - Leibniz International Proceedings in Informatics. 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016 BASE Show details 14 Minimal Suffix and Rotation of a Substring in Optimal Time Kociumaka, Tomasz. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. : LIPIcs - Leibniz International Proceedings in Informatics. 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016 BASE Show details 15 Minimal Suffix and Rotation of a Substring in Optimal Time ... Kociumaka, Tomasz. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2016 BASE Show details 16 Sparse Suffix Tree Construction in Optimal Time and Space ... Gawrychowski, Paweł; Kociumaka, Tomasz. - : arXiv, 2016 BASE Show details 17 Minimal Suffix and Rotation of a Substring in Optimal Time ... Kociumaka, Tomasz. - : arXiv, 2016 BASE Show details 18 Optimal Dynamic Strings ... Gawrychowski, Paweł; Karczmarz, Adam; Kociumaka, Tomasz; Łącki, Jakub; Sankowski, Piotr. - : arXiv, 2015 Abstract: In this paper we study the fundamental problem of maintaining a dynamic collection of strings under the following operations: concat - concatenates two strings, split - splits a string into two at a given position, compare - finds the lexicographical order (less, equal, greater) between two strings, LCP - calculates the longest common prefix of two strings. We present an efficient data structure for this problem, where an update requires only $O(\log n)$ worst-case time with high probability, with $n$ being the total length of all strings in the collection, and a query takes constant worst-case time. On the lower bound side, we prove that even if the only possible query is checking equality of two strings, either updates or queries take amortized $Ω(\log n)$ time; hence our implementation is optimal. Such operations can be used as a basic building block to solve other string problems. We provide two examples. First, we can augment our data structure to provide pattern matching queries that may locate ... Keyword: 68P05, 68W32; Data Structures and Algorithms cs.DS; F.2.2; FOS Computer and information sciences URL: https://dx.doi.org/10.48550/arxiv.1511.02612 https://arxiv.org/abs/1511.02612 BASE Hide details 19 Wavelet Trees Meet Suffix Trees ... Babenko, Maxim; Gawrychowski, Paweł; Kociumaka, Tomasz. - : arXiv, 2014 BASE Show details 20 Substring Suffix Selection ... Babenko, Maxim; Gawrychowski, Paweł; Kociumaka, Tomasz. - : arXiv, 2013 BASE Show details Page: 1 2

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 22 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0