The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Maxime Crochemore: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Maxime Crochemore
    String Matching with Constraints. [Citation Graph (1, 0)][DBLP]
    MFCS, 1988, pp:44-58 [Conf]
  2. Maxime Crochemore, Renaud Vérin
    On Compact Directed Acyclic Word Graphs. [Citation Graph (0, 0)][DBLP]
    Structures in Logic and Computer Science, 1997, pp:192-211 [Conf]
  3. Maxime Crochemore, Jean Neraud
    Unitary Monoid with Two Generators: An Algorithmic Point of View. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:117-131 [Conf]
  4. Nadia El-Mabrouk, Maxime Crochemore
    Boyer-Moore Strategy to Efficient Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:24-38 [Conf]
  5. Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot
    Efficient Experimental String Matching by Weak Factor Recognition. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:51-72 [Conf]
  6. Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps
    Two-Dimensional Pattern Matching with Rotations. [Citation Graph (0, 0)][DBLP]
    CPM, 2003, pp:17-31 [Conf]
  7. Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi
    A Trie-Based Approach for Compacting Automata. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:145-158 [Conf]
  8. Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
    Three Heuristics for delta-Matching: delta-BM Algorithms. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:178-189 [Conf]
  9. Maxime Crochemore, Renaud Vérin
    Direct Construction of Compact Directed Acyclic Word Graphs. [Citation Graph (0, 0)][DBLP]
    CPM, 1997, pp:116-129 [Conf]
  10. Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette
    Approximating the 2-Interval Pattern Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:426-437 [Conf]
  11. Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter
    Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:248-258 [Conf]
  12. Maxime Crochemore
    Constant-Space String-Matching. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:80-87 [Conf]
  13. Maxime Crochemore
    Linear Searching for a Squre in a Word (Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:137- [Conf]
  14. Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi
    Text Compression Using Antidictionaries. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:261-270 [Conf]
  15. Maxime Crochemore, Wojciech Rytter
    Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    ICPIA, 1992, pp:100-112 [Conf]
  16. Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
    A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories. [Citation Graph (0, 0)][DBLP]
    ISMIR, 2005, pp:167-174 [Conf]
  17. Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon
    Finding Motifs with Gaps. [Citation Graph (0, 0)][DBLP]
    ISMIR, 2000, pp:- [Conf]
  18. Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
    Longest Repeats with a Block of Don't Cares. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:271-278 [Conf]
  19. Maxime Crochemore, Wojciech Rytter
    On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:220-229 [Conf]
  20. Maxime Crochemore
    Data Compression with Substitution. [Citation Graph (0, 0)][DBLP]
    Electronic Dictionaries and Automata in Computational Linguistics, 1987, pp:1-16 [Conf]
  21. Maxime Crochemore
    Algorithms and automata. [Citation Graph (0, 0)][DBLP]
    Formal Properties of Finite Automata and Applications, 1988, pp:166-175 [Conf]
  22. Maxime Crochemore, Filippo Mignosi, Antonio Restivo
    Minimal Forbidden Words and Factor Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:665-673 [Conf]
  23. Maxime Crochemore, Wojciech Rytter
    Parallel Construction of Minimal Suffix and Factor Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:217-223 [Conf]
  24. Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot
    A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:622-631 [Conf]
  25. Maxime Crochemore, Gonzalo Navarro
    Improved Antidictionary Based Compression. [Citation Graph (0, 0)][DBLP]
    SCCC, 2002, pp:7-13 [Conf]
  26. Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson
    A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:679-688 [Conf]
  27. Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot
    Factor Oracle: A New Structure for Pattern Matching. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1999, pp:295-310 [Conf]
  28. Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon
    Fast Evolutionary Chains. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2000, pp:307-318 [Conf]
  29. Maxime Crochemore, Raffaele Giancarlo, Marie-France Sagot
    Longest Motifs with a Functionally Equivalent Central Block. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:298-209 [Conf]
  30. Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzon
    A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2003, pp:211-223 [Conf]
  31. Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon
    Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2001, pp:59-67 [Conf]
  32. Maxime Crochemore, Zdenek Tronícek
    On the Size of DASG for Multiple Texts. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2002, pp:58-64 [Conf]
  33. Maxime Crochemore, Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter
    Two-Dimensional Pattern Matching in Linear Time and Small Space. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:181-192 [Conf]
  34. Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter
    Speeding Up Two String-Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:589-600 [Conf]
  35. Maxime Crochemore, Wojciech Rytter
    Parallel Computations on Strings and Arrays. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:109-125 [Conf]
  36. Maxime Crochemore
    Longest Common Factor of Two Words. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:26-36 [Conf]
  37. Jan Holub, Maxime Crochemore
    On the Implementation of Compact DAWG's. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:289-294 [Conf]
  38. Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi
    Factor Oracles. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:78-89 [Conf]
  39. Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
    Speeding Up Two String-Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:4/5, pp:247-267 [Journal]
  40. Maxime Crochemore, Costas S. Iliopoulos, Maureen Korda
    Two-Dimensional Prefix String Matching and Covering on Square Matrices. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:4, pp:353-373 [Journal]
  41. Maxime Crochemore, Wojciech Rytter
    Sqares, Cubes, and Time-Space Efficient String Searching. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:13, n:5, pp:405-425 [Journal]
  42. Maxime Crochemore, Renaud Vérin
    Zones of Low Entropy in Genomic Sequences. [Citation Graph (0, 0)][DBLP]
    Computers & Chemistry, 1999, v:23, n:3-4, pp:275-282 [Journal]
  43. Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon
    Computing Evolutionary Chains in Musical Sequences. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:2, pp:- [Journal]
  44. Maxime Crochemore, Thierry Lecroq
    Pattern-Matching and Text-Compression Algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:1, pp:39-41 [Journal]
  45. Maxime Crochemore
    Computing LCF in linear time. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1986, v:30, n:, pp:57-60 [Journal]
  46. Maxime Crochemore
    String-matching and periods. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1989, v:39, n:, pp:149-153 [Journal]
  47. Maxime Crochemore, Dominique Perrin
    Critical factorizations of words. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:34, n:, pp:47-51 [Journal]
  48. Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi
    Computing forbidden words of regular languages. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:56, n:1-2, pp:121-135 [Journal]
  49. Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq
    Occurrence and Substring Heuristics for i-Matching. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:56, n:1-2, pp:1-21 [Journal]
  50. Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon
    Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:56, n:1-2, pp:89-103 [Journal]
  51. Alberto Apostolico, Maxime Crochemore
    Optimal Canonization of All Substrings of a String [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:95, n:1, pp:76-95 [Journal]
  52. Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzon
    Algorithms for Computing Approximate Repetitions in Musical Sequences. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2002, v:79, n:11, pp:1135-1148 [Journal]
  53. Maxime Crochemore
    An Optimal Algorithm for Computing the Repetitions in a Word. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:5, pp:244-250 [Journal]
  54. Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
    Fast Practical Multi-Pattern Matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:3-4, pp:107-113 [Journal]
  55. Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter
    Two-Dimensional Pattern Matching by Sampling. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:46, n:4, pp:159-162 [Journal]
  56. Maxime Crochemore, Thierry Lecroq
    Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:4, pp:195-203 [Journal]
  57. Maxime Crochemore, Filippo Mignosi, Antonio Restivo
    Automata and Forbidden Words. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:3, pp:111-117 [Journal]
  58. Maxime Crochemore, Wojciech Rytter
    Parallel Construction of Minimal Suffix and Factor Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:3, pp:121-128 [Journal]
  59. Maxime Crochemore, Wojciech Rytter
    Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:2, pp:57-60 [Journal]
  60. Maxime Crochemore, Michael Le Rest, Philippe Wender
    An Optimal Test on Finite Unavoidable Sets of Words. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:4, pp:179-180 [Journal]
  61. Maxime Crochemore, Valery T. Stefanov
    Waiting time and complexity for matching patterns with automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:3, pp:119-125 [Journal]
  62. A. Cardon, Maxime Crochemore
    Détermination de la Représentation Standard d'une Série Reconnaissable. [Citation Graph (0, 0)][DBLP]
    ITA, 1980, v:14, n:4, pp:371-379 [Journal]
  63. Jean-Jacques Hébrard, Maxime Crochemore
    Calcul de La Distance Par Les Sous-Mots. [Citation Graph (0, 0)][DBLP]
    ITA, 1986, v:20, n:4, pp:441-456 [Journal]
  64. Maxime Crochemore, Dominique Perrin
    Two-Way String Matching. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1991, v:38, n:3, pp:651-675 [Journal]
  65. Ricardo A. Baeza-Yates, Maxime Crochemore
    Foreword. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:125- [Journal]
  66. Maxime Crochemore, Christophe Hancart, Thierry Lecroq
    A unifying look at the Apostolico-Giancarlo string-matching algorithm. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:1, pp:37-52 [Journal]
  67. Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzon, Alejandro Salinger
    Bit-parallel (delta, gamma)-matching and suffix automata. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:198-214 [Journal]
  68. Maxime Crochemore, Borivoj Melichar, Zdenek Tronícek
    Directed acyclic subsequence graph - Overview. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:3-4, pp:255-280 [Journal]
  69. Alberto Apostolico, Maxime Crochemore
    Fast Parallel Lyndon Factorization with Applications. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1995, v:28, n:2, pp:89-108 [Journal]
  70. Maxime Crochemore, Costas S. Iliopoulos, Christos Makris, Wojciech Rytter, Athanasios K. Tsakalidis, T. Tsichlas
    Approximate String Matching with Gaps. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2002, v:9, n:1, pp:54-65 [Journal]
  71. Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Rytter
    Constant-Time Randomized Parallel String Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:4, pp:950-960 [Journal]
  72. Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson
    A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1654-1673 [Journal]
  73. Maxime Crochemore, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Wojciech Rytter
    A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:668-681 [Journal]
  74. Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot
    Bases of Motifs for Generating Repeated Patterns with Wild Cards. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2005, v:2, n:1, pp:40-50 [Journal]
  75. Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps
    Two-dimensional pattern matching with rotations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:314, n:1-2, pp:173-187 [Journal]
  76. A. Cardon, Maxime Crochemore
    Partitioning a Graph in O(|A| log2 |V|). [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:85-98 [Journal]
  77. Michal Chytil, Maxime Crochemore, Burkhard Monien, Wojciech Rytter
    On the Parallel Recognition of Unambiguous Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:311-316 [Journal]
  78. Maxime Crochemore
    Sharp Characterizations of Squarefree Morphisms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:221-226 [Journal]
  79. Maxime Crochemore
    Reducing space for index implementation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:185-197 [Journal]
  80. Maxime Crochemore
    Transducers and Repetitions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:45, n:1, pp:63-86 [Journal]
  81. Maxime Crochemore
    String-Matching on Ordered Alphabets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:92, n:1, pp:33-47 [Journal]
  82. Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter
    Constant-Space String-Matching in Sublinear Average Time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:218, n:1, pp:197-203 [Journal]
  83. Maxime Crochemore, Jacques Désarménien, Dominique Perrin
    A note on the Burrows - CWheeler transformation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:567-572 [Journal]
  84. Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
    Longest repeats with a block of k don't cares. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:248-254 [Journal]
  85. Maxime Crochemore, Wojciech Rytter
    On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:132, n:2, pp:403-414 [Journal]
  86. Maxime Crochemore, Wojciech Rytter
    Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:88, n:1, pp:59-82 [Journal]
  87. Jean Neraud, Maxime Crochemore
    A String-Matching Interpretation of the Equation xmyn = zp. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:92, n:1, pp:145-164 [Journal]
  88. Marie-Pierre Béal, Maxime Crochemore, Gabriele Fici
    Presentations of constrained systems with unconstrained positions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:5, pp:1891-1900 [Journal]
  89. Maxime Crochemore, Lucian Ilie
    Analysis of Maximal Repetitions in Strings. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:465-476 [Conf]
  90. Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman
    Finding Patterns in Given Intervals. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:645-656 [Conf]
  91. Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi
    On the Suffix Automaton with Mismatches. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:144-156 [Conf]
  92. Maxime Crochemore, Jacques Désarménien, Dominique Perrin
    A note on the Burrows-Wheeler transformation [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  93. Jean Berstel, Maxime Crochemore, Jean-Eric Pin
    Thue-Morse sequence and p-adic topology for the free monoid. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:76, n:2, pp:89-94 [Journal]
  94. Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
    All maximal-pairs in step-leap representation of melodic sequence. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2007, v:177, n:9, pp:1954-1962 [Journal]

  95. A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches. [Citation Graph (, )][DBLP]


  96. Towards a Solution to the "Runs" Conjecture. [Citation Graph (, )][DBLP]


  97. Cover Array String Reconstruction. [Citation Graph (, )][DBLP]


  98. Algorithms for Three Versions of the Shortest Common Superstring Problem. [Citation Graph (, )][DBLP]


  99. A Simple Algorithm for Computing the Lempel Ziv Factorization. [Citation Graph (, )][DBLP]


  100. Bounds on Powers in Strings. [Citation Graph (, )][DBLP]


  101. On the Longest Common Factor Problem. [Citation Graph (, )][DBLP]


  102. Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. [Citation Graph (, )][DBLP]


  103. Understanding Maximal Repetitions in Strings. [Citation Graph (, )][DBLP]


  104. Improved Algorithms for the Range Next Value Problem and Applications. [Citation Graph (, )][DBLP]


  105. Reverse Engineering Prefix Tables. [Citation Graph (, )][DBLP]


  106. On-line Construction of a Small Automaton for a Finite Set of Words. [Citation Graph (, )][DBLP]


  107. Conservative String Covering of Indeterminate Strings. [Citation Graph (, )][DBLP]


  108. On the Maximal Number of Cubic Runs in a String. [Citation Graph (, )][DBLP]


  109. Computing a Longest Increasing Subsequence of Length k in Time O(n log log k). [Citation Graph (, )][DBLP]


  110. LPF Computation Revisited. [Citation Graph (, )][DBLP]


  111. Understanding maximal repetitions in strings [Citation Graph (, )][DBLP]


  112. On the maximal number of highly periodic runs in a string [Citation Graph (, )][DBLP]


  113. On the maximal sum of exponents of runs in a string [Citation Graph (, )][DBLP]


Search in 0.021secs, Finished in 0.025secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002