• Refine your search:
  • 
    Keyword:
    
    • Data Structures and Algorithms cs.DS (222)
    • FOS Computer and information sciences (222)
    • Computation and Language cs.CL (11)
    • F.2.2 (10)
    • Computational Complexity cs.CC (8)
    • Formal Languages and Automata Theory cs.FL (7)
    • 68W32 (6)
    • Databases cs.DB (6)
    • Distributed, Parallel, and Cluster Computing cs.DC (6)
    • FOS Mathematics (6)
    •   more
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium
  • 
    Type
  • 
    BLLDB-Access:
    • free (222)
    • subject to license (0)

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 3 4 5...12 Hits 1 – 20 of 222 1 Ranked Enumeration of Join Queries with Projections ... Deep, Shaleen; Hu, Xiao; Koutris, Paraschos. - : arXiv, 2022 BASE Show details 2 A theoretical and experimental analysis of BWT variants for string collections ... Cenzato, Davide; Lipták, Zsuzsanna. - : arXiv, 2022 BASE Show details 3 String Rearrangement Inequalities and a Total Order Between Primitive Words ... Luo, Ruixi; Zhu, Taikun; Jin, Kai. - : arXiv, 2022 BASE Show details 4 Dynamic Suffix Array with Polylogarithmic Queries and Updates ... Kempa, Dominik; Kociumaka, Tomasz. - : arXiv, 2022 BASE Show details 5 An Optimal-Time RLBWT Construction in BWT-runs Bounded Space ... Nishimoto, Takaaki; Kanda, Shunsuke; Tabei, Yasuo. - : arXiv, 2022 BASE Show details 6 Suffix tree-based linear algorithms for multiple prefixes, single suffix counting and listing problems ... Leonard, Laurentius; Tanaka, Ken. - : arXiv, 2022 BASE Show details 7 Reduction ratio of the IS-algorithm: worst and random cases ... Jugé, Vincent. - : arXiv, 2022 BASE Show details 8 Complexity of optimizing over the integers ... Basu, Amitabh. - : arXiv, 2021 BASE Show details 9 Learning-based Support Estimation in Sublinear Time ... Eden, Talya; Indyk, Piotr; Narayanan, Shyam. - : arXiv, 2021 BASE Show details 10 String Sampling with Bidirectional String Anchors ... Loukides, Grigorios; Pissis, Solon P.; Sweering, Michelle. - : arXiv, 2021 BASE Show details 11 HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances ... Köppl, Dominik; Navarro, Gonzalo; Prezza, Nicola. - : arXiv, 2021 BASE Show details 12 Space-Efficient Huffman Codes Revisited ... Grabowski, Szymon; Köppl, Dominik. - : arXiv, 2021 BASE Show details 13 A Note on the Performance of Algorithms for Solving Linear Diophantine Equations in the Naturals ... Motroi, Valeriu; Ciobaca, Stefan. - : arXiv, 2021 BASE Show details 14 Absent Subsequences in Words ... Kosche, Maria; Koß, Tore; Manea, Florin. - : arXiv, 2021 BASE Show details 15 Lexicographically Fair Learning: Algorithms and Generalization ... Diana, Emily; Gill, Wesley; Globus-Harris, Ira. - : arXiv, 2021 BASE Show details 16 Near-Optimal Quantum Algorithms for String Problems ... Akmal, Shyan; Jin, Ce. - : arXiv, 2021 Abstract: We study quantum algorithms for several fundamental string problems, including Longest Common Substring, Lexicographically Minimal String Rotation, and Longest Square Substring. These problems have been widely studied in the stringology literature since the 1970s, and are known to be solvable by near-linear time classical algorithms. In this work, we give quantum algorithms for these problems with near-optimal query complexities and time complexities. Specifically, we show that: - Longest Common Substring can be solved by a quantum algorithm in $\tilde O(n^{2/3})$ time, improving upon the recent $\tilde O(n^{5/6})$-time algorithm by Le Gall and Seddighin (2020). Our algorithm uses the MNRS quantum walk framework, together with a careful combination of string synchronizing sets (Kempa and Kociumaka, 2019) and generalized difference covers. - Lexicographically Minimal String Rotation can be solved by a quantum algorithm in $n^{1/2 + o(1)}$ time, improving upon the recent $\tilde O(n^{3/4})$-time algorithm by ... : To appear in SODA 2022. Fixed cleveref issues ... Keyword: Data Structures and Algorithms cs.DS; FOS Computer and information sciences; FOS Physical sciences; Quantum Physics quant-ph URL: https://arxiv.org/abs/2110.09696 https://dx.doi.org/10.48550/arxiv.2110.09696 BASE Hide details 17 Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time ... Amir, Amihood; Boneh, Itai. - : arXiv, 2021 BASE Show details 18 The Labeled Direct Product Optimally Solves String Problems on Graphs ... Rizzo, Nicola; Tomescu, Alexandru I.; Policriti, Alberto. - : arXiv, 2021 BASE Show details 19 Weighted Ancestors in Suffix Trees Revisited ... Belazzougui, Djamal; Kosolobov, Dmitry; Puglisi, Simon J.. - : arXiv, 2021 BASE Show details 20 Load-Balancing Succinct B Trees ... I, Tomohiro; Köppl, Dominik. - : arXiv, 2021 BASE Show details Page: 1 2 3 4 5...12

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