• Refine your search:
  • 
    Keyword:
    
    • Data processing Computer science (3)
    • longest common substring (3)
    • 430 Deutsch (2)
    • 53 Deutsche Sprach- und Literaturwissenschaft (2)
    • CAT algorithm (2)
    • ES 965 (2)
    • Key words. bracelet (2)
    • Morphological Induction (2)
    • Morphologische Induktion (2)
    • Stilometrie (2)
    •   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 – 17 of 17 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 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 Weighted Ancestors in Suffix Trees Revisited ... Belazzougui, Djamal; Kosolobov, Dmitry; Puglisi, Simon J.. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 4 Complete Variable-Length Codes: An Excursion into Word Edit Operations Néraud, Jean In: LATA 2020 ; https://hal.archives-ouvertes.fr/hal-02389403 ; LATA 2020, Mar 2020, Milan, Italy (2020) BASE Show details 5 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 6 Longest Common Substring Made Fully Dynamic Amir, Amihood; Charalampopoulos, Panagiotis; Pissis, Solon P.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. : LIPIcs - Leibniz International Proceedings in Informatics. 27th Annual European Symposium on Algorithms (ESA 2019), 2019 BASE Show details 7 Searching Long Repeats in Streams Merkurev, Oleg; Shur, Arseny M.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. : LIPIcs - Leibniz International Proceedings in Informatics. 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 2019 BASE Show details 8 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 9 Wiederholungen in Texten ... Golcher, Felix. - : Humboldt-Universität zu Berlin, Philosophische Fakultät II, 2013 BASE Show details 10 LEMPEL-ZIV SLIDING WINDOW UPDATE WITH SUFFIX ARRAYS ... Ferreira, Artur; Oliveira, Arlindo; Figueiredo, Mario. - : ISEL - High Institute of Engineering of Lisbon, 2013 BASE Show details 11 Wiederholungen in Texten Golcher, Felix. - : Humboldt-Universität zu Berlin, Philosophische Fakultät II, 2013 BASE Show details 12 Measures of Diversity for Populations and Distances between Individuals with Highly Reorganizable Genomes Reorganizable Genomes; Claudio Mattiussi; Markus Waibel... In: http://lis.epfl.ch/~claudio/publications/MattiussiWaibelFloreano_MeasuresOfDiversity.pdf (2004) BASE Show details 13 Mining Emerging Substrings Sarah Chan; Ben Kao; C. L. Yip... In: http://www.csis.hku.hk/research/techreps/document/TR-2002-11.pdf (2002) BASE Show details 14 Generating Bracelets in Constant Amortized Time Joe Sawada In: http://www.cis.uoguelph.ca/~sawada/papers/brace.pdf (2001) BASE Show details 15 Generating Bracelets in Constant Amortized Time Joe Sawada In: http://www.cs.usyd.edu.au/~sawada/papers/brace.ps (2001) BASE Show details 16 Computation of the Probability of the Best derivation of an Initial Substring from a . . . Joan-Andreu Sánchez; José-Miguel Benedí In: http://www.iti.upv.es/~prhlt/PAPERS/papers96-00/1997/sb97b.ps.gz (1997) BASE Show details 17 Efficient repeat finding in sets of strings via suffix arrays Pablo Barenbaum; Verónica Becher; Ro Deymonnaz... In: http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/viewFile/2130/4123/ 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 17 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0