• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium:
    
    • Online (30)
    • Print (5)
  • 
    Type:
    
    • Article (28)
    • Miscellaneous (4)
    • Book (3)
  • 
    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 Page: 1 2 Hits 1 – 20 of 35 1 Absent words in a sliding window with applications Crochemore, Maxime; Héliou, Alice; Kucherov, Gregory... In: ISSN: 0890-5401 ; EISSN: 1090-2651 ; Information and Computation ; https://hal.archives-ouvertes.fr/hal-02414839 ; Information and Computation, Elsevier, 2019, pp.104461. ⟨10.1016/j.ic.2019.104461⟩ (2019) BASE Show details 2 Suffix Tree Crochemore, Maxime; Lecroq, Thierry In: Encyclopedia of Database Systems (2nd ed.) ; https://hal.archives-ouvertes.fr/hal-02021444 ; Encyclopedia of Database Systems (2nd ed.), Springer New York, pp.3839-3843, 2018 (2018) BASE Show details 3 Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching Crochemore, Maxime; Héliou, Alice; Kucherov, Gregory... In: Fundamentals of Computation Theory ; https://hal-upec-upem.archives-ouvertes.fr/hal-01616485 ; Fundamentals of Computation Theory, Sep 2017, Bordeaux, France. pp.164 - 176, ⟨10.1007/978-3-662-55751-8_14⟩ ; http://fct2017.labri.fr/ (2017) BASE Show details 4 Linear-size suffix tries Crochemore, Maxime; Epifanio, Chiara; Grossi, Roberto... In: ISSN: 1879-2294 ; EISSN: 0304-3975 ; Theoretical Computer Science ; https://hal.inria.fr/hal-01388452 ; Theoretical Computer Science, Elsevier, 2016, 638, pp.171 - 178. ⟨10.1016/j.tcs.2016.04.002⟩ (2016) BASE Show details 5 Forty Years of Suffix Trees Apostolico, Alberto; Crochemore, Maxime; Farach-Colton, Martín... In: ISSN: 0001-0782 ; EISSN: 1557-7317 ; Communications of the ACM ; https://hal-upec-upem.archives-ouvertes.fr/hal-01830856 ; Communications of the ACM, Association for Computing Machinery, 2016, 59 (4), pp.66-73. ⟨10.1145/2810036⟩ (2016) BASE Show details 6 Computing the Burrows–Wheeler transform in place and in small space Crochemore, Maxime; Grossi, Roberto; Kärkkäinen, Juha... In: ISSN: 1570-8667 ; Journal of Discrete Algorithms ; https://hal.inria.fr/hal-01248855 ; Journal of Discrete Algorithms, Elsevier, 2015, 32, pp.44-52. ⟨10.1016/j.jda.2015.01.004⟩ (2015) BASE Show details 7 Forty Years of Text Indexing Apostolico, Alberto; Crochemore, Maxime; Farach-Colton, Martin... In: Proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching ; CPM 2013 ; https://hal-upec-upem.archives-ouvertes.fr/hal-01246128 ; CPM 2013, Jun 2013, Bad Herrenalb, Germany. pp.1-10, ⟨10.1007/978-3-642-38905-4_1⟩ (2013) BASE Show details 8 Suffix Tree of Alignment: An Efficient Index for Similar Data ... Na, Joong Chae; Park, Heejin; Crochemore, Maxime. - : arXiv, 2013 BASE Show details 9 Order-Preserving Suffix Trees and Their Algorithmic Applications ... Crochemore, Maxime; Iliopoulos, Costas S.; Kociumaka, Tomasz. - : arXiv, 2013 BASE Show details 10 On-line construction of a small automaton for a finite set of words Crochemore, Maxime; Giambruno, Laura; Langiu, Alessio In: ISSN: 0129-0541 ; International Journal of Foundations of Computer Science ; https://hal-upec-upem.archives-ouvertes.fr/hal-00836951 ; International Journal of Foundations of Computer Science, World Scientific Publishing, 2012, 23 (2), pp.281-301. ⟨10.1142/S0129054112400138⟩ (2012) BASE Show details 11 The Rightmost Equal-Cost Position Problem ... Crochemore, Maxime; Langiu, Alessio; Mignosi, Filippo. - : arXiv, 2012 BASE Show details 12 Note on the Greedy Parsing Optimality for Dictionary-Based Text Compression ... Crochemore, Maxime; Langiu, Alessio; Mignosi, Filippo. - : arXiv, 2012 BASE Show details 13 Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) Crochemore, Maxime; Kari, Lila; Mohri, Mehryar. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011. : Dagstuhl Reports. Dagstuhl Reports, Volume 1, Issue 2, 2011 BASE Show details 14 Gapped Suffix Arrays: a New Index Structure for Fast Approximate Matching Crochemore, Maxime; Tischler, German In: String Processing and Information Retrieval ; SPIRE ; https://hal-upec-upem.archives-ouvertes.fr/hal-00742048 ; SPIRE, 2010, Los Cabos, Mexico. pp.359-364, ⟨10.1007/978-3-642-16321-0_37⟩ (2010) BASE Show details 15 Number of occurrences of powers in strings Crochemore, Maxime; Fazekas, Szilard Zsolt; Iliopoulos, Costas S.... In: ISSN: 0129-0541 ; International Journal of Foundations of Computer Science ; https://hal-upec-upem.archives-ouvertes.fr/hal-00693448 ; International Journal of Foundations of Computer Science, World Scientific Publishing, 2010, 21 (4), pp.535--547. ⟨10.1142/S0129054110007416⟩ (2010) BASE Show details 16 Suffix tree Crochemore, Maxime; Lecroq, Thierry In: Encyclopedia of Database Systems ; https://hal.archives-ouvertes.fr/hal-00470102 ; Ling Liu and M. Tamer Özsu. Encyclopedia of Database Systems, Springer Verlag, pp.2876-2880, 2009 (2009) BASE Show details 17 From Nerode's congruence to Suffix Automata with mismatches Crochemore, Maxime; Epifanio, Chiara; Gabriele, Alessandra... In: ISSN: 1879-2294 ; EISSN: 0304-3975 ; Theoretical Computer Science ; https://hal-upec-upem.archives-ouvertes.fr/hal-00741871 ; Theoretical Computer Science, Elsevier, 2009, 410 (37), pp.3471-3480. ⟨10.1016/j.tcs.2009.03.011⟩ (2009) BASE Show details 18 Reverse Engineering Prefix Tables Clément, Julien; Crochemore, Maxime; Rindone, Giuseppina In: 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 ; https://hal.inria.fr/inria-00359304 ; 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.289-300 (2009) BASE Show details 19 Reverse Engineering Prefix Tables Clement, Julien; Crochemore, Maxime; Rindone, Giuseppina. - : LIPIcs - Leibniz International Proceedings in Informatics. 26th International Symposium on Theoretical Aspects of Computer Science, 2009 BASE Show details 20 Reverse Engineering Prefix Tables ... Clement, Julien; Crochemore, Maxime; Rindone, Giuseppina. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2009 Abstract: The Prefix table of a string reports for each position the maximal length of its prefixes starting here. The Prefix table and its dual Suffix table are basic tools used in the design of the most efficient string-matching and pattern extraction algorithms. These tables can be computed in linear time independently of the alphabet size. We give an algorithmic characterisation of a Prefix table (it can be adapted to a Suffix table). Namely, the algorithm tests if an integer table of size $n$ is the Prefix table of some word and, if successful, it constructs the lexicographically smallest string having it as a Prefix table. We show that the alphabet of the string can be bounded to $\log_2 n$ letters. The overall algorithm runs in $O(n)$ time. ... Keyword: Computer Science URL: http://drops.dagstuhl.de/opus/volltexte/2009/1825/ https://dx.doi.org/10.4230/lipics.stacs.2009.1825 BASE Hide details Page: 1 2

Mobile view All Catalogues UB Frankfurt Linguistik 2 IDS Mannheim 0 OLC Linguistik 1 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 1 Bibliographies BLLDB 1 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 1 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 30 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0