• Refine your search:
  • 
    Keyword:
    
    • Theory of computation → Design and analysis of algorithms (5)
    • Efficient algorithms (2)
    • Scattered factor (2)
    • Subsequence (2)
    • Theory of computation → Formal languages and automata theory (2)
    • ACM: D.: Software / D.4: OPERATING SYSTEMS / D.4.7: Organization and Design / D.4.7.4: Real-time systems and embedded systems (1)
    • ACM: F.: Theory of Computation / F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY / F.2.2: Nonnumerical Algorithms and Problems / F.2.2.3: Pattern matching (1)
    • ACM: H.: Information Systems / H.5: INFORMATION INTERFACES AND PRESENTATION (e.g. (1)
    • ACM: I.: Computing Methodologies / I.2: ARTIFICIAL INTELLIGENCE / I.2.11: Distributed Artificial Intelligence / I.2.11.1: Intelligent agents (1)
    • ACM: I.: Computing Methodologies / I.2: ARTIFICIAL INTELLIGENCE / I.2.8: Problem Solving (1)
    •   more
  • 
    Creator / Publisher
  • 
    Year
  • 
    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 – 6 of 6 1 Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems ... Le Gall, François; Seddighin, Saeed. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022 BASE Show details 2 Efficiently Testing Simon’s Congruence ... Gawrychowski, Paweł; Kosche, Maria; Koß, Tore. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 3 The Edit Distance to k-Subsequence Universality ... Day, Joel D.; Fleischmann, Pamela; Kosche, Maria. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 4 Lyndon Words Accelerate Suffix Sorting ... Bertram, Nico; Ellert, Jonas; Fischer, Johannes. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 5 Space Efficient Construction of Lyndon Arrays in Linear Time ... Bille, Philip; Ellert, Jonas; Fischer, Johannes. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 BASE Show details 6 ImproteK: introducing scenarios into human-computer music improvisation Nika, Jérôme; Chemillier, Marc; Assayag, Gérard In: ACM Computers in Entertainment ; https://hal.archives-ouvertes.fr/hal-01380163 ; ACM Computers in Entertainment, 2017, ⟨10.1145/3022635⟩ (2017) 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 6 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0