Volume 11, February 2012

• 
  Tomasz Radzik, German Tischler: Editorial. 1-2
• 
  Evguenia Kopylova, William F. Smyth: The three squares lemma revisited. 3-14
• 
  Jakub Radoszewski, Wojciech Rytter: On the structure of compacted subword graphs of Thue-Morse words and their applications. 15-24
• 
  Domenico Cantone, Simone Faro, Emanuele Giaquinta: On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns. 25-36
• 
  Francisco Claude, Gonzalo Navarro, Hannu Peltola, Leena Salmela, Jorma Tarhio: String matching with alphabet sampling. 37-50
• 
  Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen: Efficient algorithms for three variants of the LPF table. 51-61
• 
  Rafael Carrascosa, François Coste, Matthias Gallé, Gabriel G. Infante López: Searching for smallest grammars on large sequences and application to DNA. 62-72
• 
  Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen: Steiner tree reoptimization in graphs with sharpened triangle inequality. 73-86
• 
  Martine Léonard, Laurent Mouchard, Mikaël Salson: On the number of elements to reorder when updating a suffix array. 87-99

last updated on Mon May 20 03:23:47 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page