• Refine your search:
  • 
    Keyword:
    
    • Data Structures and Algorithms cs.DS (4)
    • Data processing Computer science (4)
    • FOS Computer and information sciences (4)
    • Computer Science (2)
    • compression (2)
    • pattern matching (2)
    • string indexing (2)
    • Lempel-Ziv parsing (1)
    • Lyndon array (1)
    • Lyndon word (1)
    •   more
  • 
    Creator / Publisher
  • 
    Year:
    
    • 2020 (3)
    • 2019 (1)
    • 2017 (3)
    • 2015 (1)
    • 2012 (3)
    • 2011 (2)
  • 
    Medium
  • 
    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 Hits 1 – 13 of 13 1 String Indexing with Compressed Patterns Bille, Philip; Steiner, Teresa Anna. - : LIPIcs - Leibniz International Proceedings in Informatics. 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), 2020 BASE Show details 2 String Indexing with Compressed Patterns ... Bille, Philip; Gørtz, Inge Li; Steiner, Teresa Anna. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 BASE Show details 3 Space Efficient Construction of Lyndon Arrays in Linear Time ... Bille, Philip; Ellert, Jonas; Fischer, Johannes; Gørtz, Inge Li; Kurpicz, Florian; Munro, J. Ian; Rotenberg, Eva. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 Abstract: Given a string S of length n, its Lyndon array identifies for each suffix S[i..n] the next lexicographically smaller suffix S[j..n], i.e. the minimal index j > i with S[i..n] ≻ S[j..n]. Apart from its plain (n log₂ n)-bit array representation, the Lyndon array can also be encoded as a succinct parentheses sequence that requires only 2n bits of space. While linear time construction algorithms for both representations exist, it has previously been unknown if the same time bound can be achieved with less than Ω(n lg n) bits of additional working space. We show that, in fact, o(n) additional bits are sufficient to compute the succinct 2n-bit version of the Lyndon array in linear time. For the plain (n log₂ n)-bit version, we only need 𝒪(1) additional words to achieve linear time. Our space efficient construction algorithm makes the Lyndon array more accessible as a fundamental data structure in applications like full-text indexing. ... Keyword: Lyndon array; Lyndon word; nearest smaller suffixes; nearest smaller values; String algorithms; string suffixes; succinct data structures; Theory of computation → Design and analysis of algorithms URL: https://drops.dagstuhl.de/opus/volltexte/2020/12421/ https://dx.doi.org/10.4230/lipics.icalp.2020.14 BASE Hide details 4 String Indexing with Compressed Patterns ... Bille, Philip; Gørtz, Inge Li; Steiner, Teresa Anna. - : arXiv, 2019 BASE Show details 5 Deterministic Indexing for Packed Strings Bille, Philip; Skjoldjensen, Frederik Rye. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. : LIPIcs - Leibniz International Proceedings in Informatics. 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017 BASE Show details 6 Lempel-Ziv Compression in a Sliding Window Bille, Philip; Cording, Patrick Hagge; Fischer, Johannes. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. : LIPIcs - Leibniz International Proceedings in Informatics. 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017 BASE Show details 7 Lempel-Ziv Compression in a Sliding Window ... Bille, Philip; Cording, Patrick Hagge; Fischer, Johannes. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2017 BASE Show details 8 Longest Common Extensions in Sublinear Space ... Bille, Philip; Gørtz, Inge Li; Knudsen, Mathias Bæk Tejs. - : arXiv, 2015 BASE Show details 9 Time-Space Trade-Offs for Longest Common Extensions ... Bille, Philip; Goertz, Inge Li; Sach, Benjamin. - : arXiv, 2012 BASE Show details 10 Sparse Suffix Tree Construction with Small Space ... Bille, Philip; Gørtz, Inge Li; Kopelowitz, Tsvi. - : arXiv, 2012 BASE Show details 11 Time-space trade-offs for longest common extensions Bille, Philip; Gørtz, Inge Li; Sach, Benjamin. - : Springer, 2012 BASE Show details 12 Optimal Packed String Matching Ben-Kiki, Oren; Bille, Philip; Breslauer, Dany. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011. : LIPIcs - Leibniz International Proceedings in Informatics. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011), 2011 BASE Show details 13 Optimal Packed String Matching ... Ben-Kiki, Oren; Bille, Philip; Breslauer, Dany. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2011 BASE Show details

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 13 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0