↓ 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 On High-Quality Synthesis
  3. Altmetric Badge
    Chapter 2 Sensitivity Versus Certificate Complexity of Boolean Functions
  4. Altmetric Badge
    Chapter 3 Algorithmic Decidability of Engel’s Property for Automaton Groups
  5. Altmetric Badge
    Chapter 4 The Next Whisky Bar
  6. Altmetric Badge
    Chapter 5 Parameterizing Edge Modification Problems Above Lower Bounds
  7. Altmetric Badge
    Chapter 6 Completing Partial Schedules for Open Shop with Unit Processing Times and Routing
  8. Altmetric Badge
    Chapter 7 Max-Closed Semilinear Constraint Satisfaction
  9. Altmetric Badge
    Chapter 8 Computer Science – Theory and Applications
  10. Altmetric Badge
    Chapter 9 Compositional Design of Stochastic Timed Automata
  11. Altmetric Badge
    Chapter 10 Online Bounded Analysis
  12. Altmetric Badge
    Chapter 11 Affine Computation and Affine Automaton
  13. Altmetric Badge
    Chapter 12 On Approximating (Connected) 2-Edge Dominating Set by a Tree
  14. Altmetric Badge
    Chapter 13 Graph Editing to a Given Degree Sequence
  15. Altmetric Badge
    Chapter 14 Subclasses of Baxter Permutations Based on Pattern Avoidance
  16. Altmetric Badge
    Chapter 15 On Slepian–Wolf Theorem with Interaction
  17. Altmetric Badge
    Chapter 16 Level Two of the Quantifier Alternation Hierarchy over Infinite Words
  18. Altmetric Badge
    Chapter 17 The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy
  19. Altmetric Badge
    Chapter 18 Some Complete and Intermediate Polynomials in Algebraic Complexity Theory
  20. Altmetric Badge
    Chapter 19 Sums of Read-Once Formulas: How Many Summands Suffice?
  21. Altmetric Badge
    Chapter 20 Algorithmic Statistics: Normal Objects and Universal Models
  22. Altmetric Badge
    Chapter 21 Subquadratic Algorithms for Succinct Stable Matching
  23. Altmetric Badge
    Chapter 22 Depth-4 Identity Testing and Noether’s Normalization Lemma
  24. Altmetric Badge
    Chapter 23 Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems
  25. Altmetric Badge
    Chapter 24 The Hardest Language for Conjunctive Grammars
  26. Altmetric Badge
    Chapter 25 Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions
  27. Altmetric Badge
    Chapter 26 Representations of Analytic Functions and Weihrauch Degrees
  28. Altmetric Badge
    Chapter 27 On Expressive Power of Regular Expressions over Infinite Orders
  29. Altmetric Badge
    Chapter 28 Prediction of Infinite Words with Automata
  30. Altmetric Badge
    Chapter 29 Fourier Sparsity of GF(2) Polynomials
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

news
1 news outlet
twitter
6 X users

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
2 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
Computer Science – Theory and Applications
Published by
Springer International Publishing, June 2016
DOI 10.1007/978-3-319-34171-2
ISBNs
978-3-31-934170-5, 978-3-31-934171-2
Editors

Kulikov, Alexander S., Woeginger, Gerhard J.

X Demographics

X Demographics

The data shown below were collected from the profiles of 6 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 50%
Unknown 1 50%
Readers by discipline Count As %
Mathematics 1 50%
Unknown 1 50%