| 1233 | -- | 1234 | Jan Holub. Foreword |
| 1235 | -- | 1252 | Domenico Cantone, Simone Faro. A Space Efficient Bit-parallel Algorithm for the Multiple String Matching Problem |
| 1253 | -- | 1272 | Loek G. Cleophas, Kees Hemerik, Gerard Zwaan. Two Related Algorithms for Root-to-frontier Tree Pattern Matching |
| 1273 | -- | 1280 | Sergio De Agostino. Bounded Size Dictionary Compression: Relaxing the Lru Deletion Heuristic |
| 1281 | -- | 1296 | Frantisek Franek, William F. Smyth. Reconstructing a Suffix Array |
| 1297 | -- | 1306 | Shmuel T. Klein, Dana Shapira. Compressed Pattern Matching in Jpeg Images |
| 1307 | -- | 1324 | Ernest Ketcha Ngassam, Bruce W. Watson, Derrick G. Kourie. Dynamic Allocation of Finite Automata States for Fast String Recognition |
| 1325 | -- | 1344 | Heikki Hyyrö, Gonzalo Navarro. Bit-parallel Computation of Local Similarity Score Matrices with Unitary Weights |
| 1345 | -- | 1364 | Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro. Flexible Music Retrieval in Sublinear Time |
| 1365 | -- | 1384 | Szymon Grabowski, Gonzalo Navarro, Rafal Przywarski, Alejandro Salinger, Veli Mäkinen. A Simple Alphabet-independent Fm-index |
| 1385 | -- | 1402 | Élise Prieur, Thierry Lecroq. From Suffix Trees to Suffix Vectors |
| 1403 | -- | 1422 | Joseph K. Liu, Duncan S. Wong. Enhanced Security Models and a Generic Construction Approach for Linkable Ring Signature |
| 1423 | -- | 1440 | Michel Paquette, Andrzej Pelc. Fast Broadcasting with Byzantine Faults |
| 1441 | -- | 1454 | Shuguang Li, Guojun Li, Xingqin Qi. Minimizing Total Weighted Completion Time on Identical Parallel Batch Machines |
| 1455 | -- | 1466 | Amr Elmasry. A Priority Queue with the Working-set Property |
| 1467 | -- | 1484 | Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier. The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions |