↓ Skip to main content
Altmetric
What is this page?
Embed badge
Share
Share on Twitter
Share on Facebook
Share by email
Combinatorial Algorithms on Words
Overview of attention for book
Table of Contents
Altmetric Badge
Book Overview
Altmetric Badge
Chapter 1
Open Problems in Stringology
Altmetric Badge
Chapter 2
Efficient String Matching with Don’t-Care Patterns
Altmetric Badge
Chapter 3
Optimal Factor Transducers
Altmetric Badge
Chapter 4
Relating the Average-Case Costs of the Brute-Force and Knuth-Morris-Pratt String Matching Algorithm
Altmetric Badge
Chapter 5
Algorithms for Factorizing and Testing Subsemigroups
Altmetric Badge
Chapter 6
The Myriad Virtues of Subword Trees
Altmetric Badge
Chapter 7
Efficient and Elegant Subword-Tree Construction
Altmetric Badge
Chapter 8
Textual Substitution Techniques for Data Compression
Altmetric Badge
Chapter 9
Variations on a theme by Ziv and Lempel
Altmetric Badge
Chapter 10
Compression of Two-Dimensional Images
Altmetric Badge
Chapter 11
Optimal Parsing of Strings
Altmetric Badge
Chapter 12
Novel Compression of Sparse Bit-Strings — Preliminary Report
Altmetric Badge
Chapter 13
The Use and Usefulness of Numeration Systems
Altmetric Badge
Chapter 14
Enumeration of Strings
Altmetric Badge
Chapter 15
Two counting problems solved via string encodings
Altmetric Badge
Chapter 16
Some Uses of the Mellin Integral Transform in the Analysis of Algorithms
Altmetric Badge
Chapter 17
Periodicities in Strings
Altmetric Badge
Chapter 18
Linear Time Recognition of Squarefree Strings
Altmetric Badge
Chapter 19
Discovering Repetitions in Strings
Altmetric Badge
Chapter 20
Some Decision Results on Nonrepetitive Words
Altmetric Badge
Chapter 21
On the Complexity of Some Word Problems That Arise in Testing the Security of Protocols
Altmetric Badge
Chapter 22
Code Properties and Derivatives of DOL Systems
Altmetric Badge
Chapter 23
Words over a Partially Commutative Alphabet
Altmetric Badge
Chapter 24
The Complexity of Two-Way Pushdown Automata and Recursive Programs
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
Book overview
1. Open Problems in Stringology
2. Efficient String Matching with Don’t-Care Patterns
3. Optimal Factor Transducers
4. Relating the Average-Case Costs of the Brute-Force and Knuth-Morris-Pratt String Matching Algorithm
5. Algorithms for Factorizing and Testing Subsemigroups
6. The Myriad Virtues of Subword Trees
7. Efficient and Elegant Subword-Tree Construction
8. Textual Substitution Techniques for Data Compression
9. Variations on a theme by Ziv and Lempel
10. Compression of Two-Dimensional Images
11. Optimal Parsing of Strings
12. Novel Compression of Sparse Bit-Strings — Preliminary Report
13. The Use and Usefulness of Numeration Systems
14. Enumeration of Strings
15. Two counting problems solved via string encodings
16. Some Uses of the Mellin Integral Transform in the Analysis of Algorithms
17. Periodicities in Strings
18. Linear Time Recognition of Squarefree Strings
19. Discovering Repetitions in Strings
20. Some Decision Results on Nonrepetitive Words
21. On the Complexity of Some Word Problems That Arise in Testing the Security of Protocols
22. Code Properties and Derivatives of DOL Systems
23. Words over a Partially Commutative Alphabet
24. The Complexity of Two-Way Pushdown Automata and Recursive Programs
25. Context-Free Grammars and Random Number Generation
Summary
Blogs
Syllabi
Wikipedia
Dimensions citations
This data is correct as of December 2015 - for more up to date information, please visit
https://opensyllabus.org/
So far, Altmetric has seen this research output assigned in
2
syllabi from
1
institutions on Open Syllabus Project.
Institution
Syllabi count
Course subject areas covered
Unknown
2
Unknown