Volume 56,
Numbers 1-2,
2003
Special Issue:
Computing Patterns in Strings
- Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq:
Occurrence and Substring Heuristics for i-Matching.
1-21
- Josué Kuri, Gonzalo Navarro, Ludovic Mé:
Fast Multipattern Search Algorithms for Intrusion Detection.
23-49
- Stefan Burkhardt, Juha Kärkkäinen:
Better Filtering with Gapped q-Grams.
51-70
- Pierre Nicodème:
Regexpcount, a symbolic package for counting problems on regular expressions and words.
71-88
- Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon:
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms.
89-103
- Jesper Jansson, Andrzej Lingas:
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees.
105-120
- Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi:
Computing forbidden words of regular languages.
121-135
- Leszek Gasieniec, Igor Potapov:
Time/Space Efficient Compressed Pattern Matching.
137-154
- Foto N. Afrati, Hans Leiß, Michel de Rougemont:
Definability and Compression.
155-180
- Inbok Lee, Kunsoo Park, Yanghee Choi:
A Simple and Scalable Algorithm for the IP Address Lookup Problem.
181-190
- Veli Mäkinen:
Compact Suffix Array -- A Space-Efficient Full-Text Index.
191-210
Volume 56,
Number 3,
2003
- Philippe Balbiani:
Eliminating Unorthodox Derivation Rules in an Axiom System for Iteration-free PDL with Intersection.
211-242
- Hui-Feng Huang, Chin-Chen Chang:
An Efficient and Practical (t, n) Threshold Proxy Signature Scheme with Known Signers.
243-253
- Maurice Margenstern:
On the Infinigons of the Hyperbolic Plane, A combinatorial approach.
255-272
- Toby Ord, Tien D. Kieu:
On the existence of a new family of Diophantine equations for z.
273-284
- Arkadiusz Wojna:
Center-Based Indexing in Vector and Metric Spaces.
285-310
Volume 56,
Number 4,
2003
Copyright © Tue Feb 9 19:43:30 2010
by Michael Ley (ley@uni-trier.de)
