↓ Skip to main content

Computer Science – Theory and Applications

Overview of attention for book
Cover of 'Computer Science – Theory and Applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Lovász Local Lemma – A Survey
  3. Altmetric Badge
    Chapter 2 An Improved Knapsack Solver for Column Generation
  4. Altmetric Badge
    Chapter 3 QuickHeapsort: Modifications and Improved Analysis
  5. Altmetric Badge
    Chapter 4 Alphabetic Minimax Trees in Linear Time
  6. Altmetric Badge
    Chapter 5 Decidability and Enumeration for Automatic Sequences: A Survey
  7. Altmetric Badge
    Chapter 6 Walking on Data Words
  8. Altmetric Badge
    Chapter 7 Careful Synchronization of Partial Automata with Restricted Alphabets
  9. Altmetric Badge
    Chapter 8 Random Generation of Deterministic Acyclic Automata Using the Recursive Method
  10. Altmetric Badge
    Chapter 9 Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height
  11. Altmetric Badge
    Chapter 10 A Short Tutorial on Order-Invariant First-Order Logic
  12. Altmetric Badge
    Chapter 11 Exponential Lower Bounds for Refuting Random Formulas Using Ordered Binary Decision Diagrams
  13. Altmetric Badge
    Chapter 12 Parameterized Resolution with Bounded Conjunction
  14. Altmetric Badge
    Chapter 13 Lower and Upper Bounds for the Length of Joins in the Lambek Calculus
  15. Altmetric Badge
    Chapter 14 Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP
  16. Altmetric Badge
    Chapter 15 Towards NEXP versus BPP?
  17. Altmetric Badge
    Chapter 16 Information Lower Bounds via Self-reducibility
  18. Altmetric Badge
    Chapter 17 On the Encoding Invariance of Polynomial Time Computable Distribution Ensembles
  19. Altmetric Badge
    Chapter 18 Improving on Gutfreund, Shaltiel,and Ta-Shma’s Paper “If NP Languages Are Hard on the Worst-Case, Then It Is Easy to Find Their Hard Instances”
  20. Altmetric Badge
    Chapter 19 Amortized Communication Complexity of an Equality Predicate
  21. Altmetric Badge
    Chapter 20 On Coloring of Sparse Graphs
  22. Altmetric Badge
    Chapter 21 On Recognizing Words That Are Squares for the Shuffle Product
  23. Altmetric Badge
    Chapter 22 Cyclic Shift on Prefix-Free Languages
  24. Altmetric Badge
    Chapter 23 Weak Abelian Periodicity of Infinite Words
  25. Altmetric Badge
    Chapter 24 Universality of Regular Realizability Problems
  26. Altmetric Badge
    Chapter 25 Potential Functions in Strategic Games
  27. Altmetric Badge
    Chapter 26 The Probabilistic Min Dominating Set Problem
  28. Altmetric Badge
    Chapter 27 Dichotomy of the H-Quasi-Cover Problem
  29. Altmetric Badge
    Chapter 28 QCSP on Partially Reflexive Cycles – The Wavy Line of Tractability
  30. Altmetric Badge
    Chapter 29 Quantum Alternation
  31. Altmetric Badge
    Chapter 30 Real Numbers, Chaos, and the Principle of a Bounded Density of Information
  32. Altmetric Badge
    Chapter 31 Random Selection in Few Rounds
  33. Altmetric Badge
    Chapter 32 One-Counter Verifiers for Decidable Languages
  34. Altmetric Badge
    Chapter 33 Computer Science – Theory and Applications
  35. Altmetric Badge
    Chapter 34 Composition with Algebra at the Background
  36. Altmetric Badge
    Chapter 35 Model-Checking Bounded Multi-Pushdown Systems
  37. Altmetric Badge
    Chapter 36 Multi-weighted Automata and MSO Logic
  38. Altmetric Badge
    Chapter 37 Overlapping Tile Automata
Attention for Chapter 21: On Recognizing Words That Are Squares for the Shuffle Product
Altmetric Badge

Mentioned by

q&a
1 Q&A thread

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
1 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.
Chapter title
On Recognizing Words That Are Squares for the Shuffle Product
Chapter number 21
Book title
Computer Science – Theory and Applications
Published by
Springer Berlin Heidelberg, January 2013
DOI 10.1007/978-3-642-38536-0_21
Book ISBNs
978-3-64-238535-3, 978-3-64-238536-0
Authors

Romeo Rizzi, Stéphane Vialette

Editors

Andrei A. Bulatov, Arseny M. Shur

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Canada 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 2 200%
Other 1 100%
Professor 1 100%
Student > Ph. D. Student 1 100%
Student > Master 1 100%
Other 0 0%
Readers by discipline Count As %
Computer Science 6 600%