↓ Skip to main content

Combinatorial Algorithms on Words

Overview of attention for book
Cover of 'Combinatorial Algorithms on Words'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Open Problems in Stringology
  3. Altmetric Badge
    Chapter 2 Efficient String Matching with Don’t-Care Patterns
  4. Altmetric Badge
    Chapter 3 Optimal Factor Transducers
  5. Altmetric Badge
    Chapter 4 Relating the Average-Case Costs of the Brute-Force and Knuth-Morris-Pratt String Matching Algorithm
  6. Altmetric Badge
    Chapter 5 Algorithms for Factorizing and Testing Subsemigroups
  7. Altmetric Badge
    Chapter 6 The Myriad Virtues of Subword Trees
  8. Altmetric Badge
    Chapter 7 Efficient and Elegant Subword-Tree Construction
  9. Altmetric Badge
    Chapter 8 Textual Substitution Techniques for Data Compression
  10. Altmetric Badge
    Chapter 9 Variations on a theme by Ziv and Lempel
  11. Altmetric Badge
    Chapter 10 Compression of Two-Dimensional Images
  12. Altmetric Badge
    Chapter 11 Optimal Parsing of Strings
  13. Altmetric Badge
    Chapter 12 Novel Compression of Sparse Bit-Strings — Preliminary Report
  14. Altmetric Badge
    Chapter 13 The Use and Usefulness of Numeration Systems
  15. Altmetric Badge
    Chapter 14 Enumeration of Strings
  16. Altmetric Badge
    Chapter 15 Two counting problems solved via string encodings
  17. Altmetric Badge
    Chapter 16 Some Uses of the Mellin Integral Transform in the Analysis of Algorithms
  18. Altmetric Badge
    Chapter 17 Periodicities in Strings
  19. Altmetric Badge
    Chapter 18 Linear Time Recognition of Squarefree Strings
  20. Altmetric Badge
    Chapter 19 Discovering Repetitions in Strings
  21. Altmetric Badge
    Chapter 20 Some Decision Results on Nonrepetitive Words
  22. Altmetric Badge
    Chapter 21 On the Complexity of Some Word Problems That Arise in Testing the Security of Protocols
  23. Altmetric Badge
    Chapter 22 Code Properties and Derivatives of DOL Systems
  24. Altmetric Badge
    Chapter 23 Words over a Partially Commutative Alphabet
  25. Altmetric Badge
    Chapter 24 The Complexity of Two-Way Pushdown Automata and Recursive Programs
  26. Altmetric Badge
    Chapter 25 Context-Free Grammars and Random Number Generation
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

blogs
1 blog
syllabi
1 institution with syllabi
wikipedia
2 Wikipedia pages

Citations

dimensions_citation
36 Dimensions

Readers on

mendeley
10 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Combinatorial Algorithms on Words
Published by
Springer-Verlag Berlin Heidelberg, January 1985
DOI 10.1007/978-3-642-82456-2
ISBNs
978-3-64-282458-6, 978-3-64-282456-2
Editors

Alberto Apostolico, Zvi Galil

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 10 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 10 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 4 40%
Professor 2 20%
Researcher 2 20%
Student > Master 2 20%
Readers by discipline Count As %
Computer Science 8 80%
Agricultural and Biological Sciences 1 10%
Unknown 1 10%