• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium:
    
    • Online (12)
  • 
    Type:
    
    • Article (11)
    • Miscellaneous (1)
  • 
    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 – 12 of 12 1 Dynamic Suffix Array with Polylogarithmic Queries and Updates ... Kempa, Dominik; Kociumaka, Tomasz. - : arXiv, 2022 BASE Show details 2 Breaking the $O(n)$-Barrier in the Construction of Compressed Suffix Arrays ... Kempa, Dominik; Kociumaka, Tomasz. - : arXiv, 2021 BASE Show details 3 String Attractors: Verification and Optimization Kempa, Dominik; Policriti, Alberto; Prezza, Nicola. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. : LIPIcs - Leibniz International Proceedings in Informatics. 26th Annual European Symposium on Algorithms (ESA 2018), 2018 BASE Show details 4 String Attractors: Verification and Optimization ... Kempa, Dominik; Policriti, Alberto; Prezza, Nicola. - : arXiv, 2018 BASE Show details 5 String Attractors: Verification and Optimization ... Kempa, Dominik; Policriti, Alberto; Prezza, Nicola. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2018 BASE Show details 6 Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet Kempa, Dominik. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. : LIPIcs - Leibniz International Proceedings in Informatics. 16th International Symposium on Experimental Algorithms (SEA 2017), 2017 BASE Show details 7 Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet ... Kärkkäinen, Juha; Kempa, Dominik. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2017 BASE Show details 8 Optimal Construction of Compressed Indexes for Highly Repetitive Texts ... Kempa, Dominik. - : arXiv, 2017 BASE Show details 9 Faster External Memory LCP Array Construction Kempa, Dominik. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. : LIPIcs - Leibniz International Proceedings in Informatics. 24th Annual European Symposium on Algorithms (ESA 2016), 2016 BASE Show details 10 Faster External Memory LCP Array Construction ... Kärkkäinen, Juha; Kempa, Dominik. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2016 BASE Show details 11 Faster Sparse Suffix Sorting I, Tomohiro; Kempa, Dominik. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014. : LIPIcs - Leibniz International Proceedings in Informatics. 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014 BASE Show details 12 Faster Sparse Suffix Sorting ... I, Tomohiro; Kärkkäinen, Juha; Kempa, Dominik. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2014 Abstract: The sparse suffix sorting problem is to sort b=o(n) arbitrary suffixes of a string of length n using o(n) words of space in addition to the string. We present an O(n) time Monte Carlo algorithm using O(b.log(b)) space and an O(n.log(b)) time Las Vegas algorithm using O(b) space. This is a significant improvement over the best prior solutions of [Bille et al., ICALP 2013]: a Monte Carlo algorithm running in O(n.log(b)) time and O(b^(1+e)) space or O(n.log^2(b)) time and O(b) space, and a Las Vegas algorithm running in O(n.log^2(b)+b^2.log(b)) time and O(b) space. All the above results are obtained with high probability not just in expectation. ... Keyword: Computer Science URL: http://drops.dagstuhl.de/opus/volltexte/2014/4473/ https://dx.doi.org/10.4230/lipics.stacs.2014.386 BASE Hide 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 12 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0