• Refine your search:
  • 
    Keyword
  • 
    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; Kociumaka, Tomasz; Kurpicz, Florian. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 Abstract: For a text T[1,n], a Longest Common Extension (LCE) query lce_T(i,j) asks for the length of the longest common prefix of the suffixes T[i,n] and T[j,n] identified by their starting positions 1 ≤ i,j ≤ n. A classic problem in stringology asks to preprocess a static text T[1,n] over an alphabet of size σ so that LCE queries can be efficiently answered on-line. Since its introduction in the 1980’s, this problem has found numerous applications: in suffix sorting, edit distance computation, approximate pattern matching, regularities finding, string mining, and many more. Text-book solutions offer O(n) preprocessing time and O(1) query time, but they employ memory-heavy data structures, such as suffix arrays, in practice several times bigger than the text itself. Very recently, more space efficient solutions using O(nlogσ) bits of total space or even only O(log n) bits of extra space have been proposed: string synchronizing sets [Kempa and Kociumaka, STOC'19, and Birenzwige et al., SODA'20] and in-place ... Keyword: longest common prefix; space efficient data structures; text indexing; Theory of computation → Pattern matching URL: https://drops.dagstuhl.de/opus/volltexte/2020/12905/ https://dx.doi.org/10.4230/lipics.esa.2020.39 BASE Hide 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. - : arXiv, 2015 BASE Show 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