Combinatorial Algorithms on Words

  • Alberto Apostolico
  • Zvi Galil
Conference proceedings

Part of the NATO ASI Series book series (volume 12)

Table of contents

  1. Front Matter
    Pages I-VIII
  2. Open Problems in Stringology

    1. Zvi Galil
      Pages 1-8
  3. String Matching

    1. Front Matter
      Pages 9-9
    2. Maxime Crochemore
      Pages 31-43
    3. Renato M. Capocelli, Christoph M. Hoffmann
      Pages 59-81
  4. Subword Trees

    1. Front Matter
      Pages 83-83
    2. Alberto Apostolico
      Pages 85-96
    3. M. T. Chen, Joel Seiferas
      Pages 97-107
  5. Data Compression

    1. Front Matter
      Pages 109-109
    2. Victor S. Miller, Mark N. Wegman
      Pages 131-140
    3. Abraham Lempel, Jacob Ziv
      Pages 141-154
    4. Alan Hartman, Michael Rodeh
      Pages 155-167
    5. Aviezri S. Fraenkel, Shmuel T. Klein
      Pages 169-183
  6. Counting

    1. Front Matter
      Pages 185-185
    2. Aviezri S. Fraenkel
      Pages 187-203
    3. A. M. Odlyzko
      Pages 205-228
    4. Philippe Flajolet, Mireille Regnier, Robert Sedgewick
      Pages 241-254
  7. Periods and Other Regularities

    1. Front Matter
      Pages 255-255
    2. Leo J. Guibas
      Pages 257-269
    3. Michael G. Main, Richard J. Lorentz
      Pages 271-278
    4. Michael O. Rabin
      Pages 279-288
    5. Antonio Restivo, Sergio Salemi
      Pages 289-295
  8. Miscellaneous

  9. Back Matter
    Pages 363-363

About these proceedings


Combinatorial Algorithms on Words refers to the collection of manipulations of strings of symbols (words) - not necessarily from a finite alphabet - that exploit the combinatorial properties of the logical/physical input arrangement to achieve efficient computational performances. The model of computation may be any of the established serial paradigms (e.g. RAM's, Turing Machines), or one of the emerging parallel models (e.g. PRAM ,WRAM, Systolic Arrays, CCC). This book focuses on some of the accomplishments of recent years in such disparate areas as pattern matching, data compression, free groups, coding theory, parallel and VLSI computation, and symbolic dynamics; these share a common flavor, yet ltave not been examined together in the past. In addition to being theoretically interest­ ing, these studies have had significant applications. It happens that these works have all too frequently been carried out in isolation, with contributions addressing similar issues scattered throughout a rather diverse body of literature. We felt that it would be advantageous to both current and future researchers to collect this work in a sin­ gle reference. It should be clear that the book's emphasis is on aspects of combinatorics and com­ plexity rather than logic, foundations, and decidability. In view of the large body of research and the degree of unity already achieved by studies in the theory of auto­ mata and formal languages, we have allocated very little space to them.


Area Combinatorics Matching Pattern Matching Turing VLSI calculus coding coding theory combinatorial algorithm data compression formal language formal languages language model

Editors and affiliations

  • Alberto Apostolico
    • 1
  • Zvi Galil
    • 2
  1. 1.Department of Computer SciencesWest LafayetteUSA
  2. 2.Department of Computer ScienceColumbia UniversityNew YorkUSA

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1985
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-82458-6
  • Online ISBN 978-3-642-82456-2
  • Buy this book on publisher's site
Industry Sectors
Finance, Business & Banking