1. Foreword

   • Manolis Christodoulakis
   • Costas S. Iliopoulos

   OriginalPaper 15 April 2010 Pages: 371 - 371

2. Fast, Practical Algorithms for Computing All the Repeats in a String

   • Simon J. Puglisi
   • W. F. Smyth
   • Munina Yusufu

   OriginalPaper 15 April 2010 Pages: 373 - 389

3. Scalability and Communication in Parallel Low-Complexity Lossless Compression

   • Luigi Cinque
   • Sergio De Agostino
   • Luca Lombardi

   OriginalPaper 15 April 2010 Pages: 391 - 406

4. BLIM: A New Bit-Parallel Pattern Matching Algorithm Overcoming Computer Word Size Limitation

   • M. Oğuzhan Külekci

   OriginalPaper 13 April 2010 Pages: 407 - 420

5. A Randomized Algorithm for 3-SAT

   • Subhas Kumar Ghosh
   • Janardan Misra

   OriginalPaper 16 April 2010 Pages: 421 - 431

6. Cache Oblivious Algorithms for the RMQ and the RMSQ Problems

   • Masud Hasan
   • Tanaeem M. Moosa
   • M. Sohel Rahman

   OriginalPaper 13 April 2010 Pages: 433 - 442

7. Analytical Studies of Energy–Time Efficiency of Blocking Expanding Ring Search

   • Ida M. Pu
   • Yuji Shen

   OriginalPaper 15 April 2010 Pages: 443 - 456

8. Estimating the Volumes of the Cones in a Gröbner Fan

   • Elena S. Dimitrova

   OriginalPaper 13 April 2010 Pages: 457 - 463

9. Analysis of Local Search Landscapes for k-SAT Instances

   • A. A. Albrecht
   • P. C. R. Lane
   • K. Steinhöfel

   OriginalPaper 13 April 2010 Pages: 465 - 488

10. Scale Free Properties of Random k-Trees

    • Colin Cooper
    • Ryuhei Uehara

    OriginalPaper 16 April 2010 Pages: 489 - 496