↓ 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 Can the Theory of Algorithms Ratify the “Invisible Hand of the Market”?
  3. Altmetric Badge
    Chapter 2 Resilient Quicksort and Selection
  4. Altmetric Badge
    Chapter 3 General Quantitative Specification Theories with Modalities
  5. Altmetric Badge
    Chapter 4 The Complexity of Intersecting Finite Automata Having Few Final States
  6. Altmetric Badge
    Chapter 5 News about Semiantichains and Unichain Coverings
  7. Altmetric Badge
    Chapter 6 Checking Tests for Read-Once Functions over Arbitrary Bases
  8. Altmetric Badge
    Chapter 7 Approximating Minimum Power Edge-Multi-Covers
  9. Altmetric Badge
    Chapter 8 A Lower Bound on Circuit Complexity of Vector Function in U 2
  10. Altmetric Badge
    Chapter 9 Computing All MOD-Functions Simultaneously
  11. Altmetric Badge
    Chapter 10 Bounded Synchronization Delay in Omega-Rational Expressions
  12. Altmetric Badge
    Chapter 11 Towards Optimal Degree-Distributions for Left-Perfect Matchings in Random Bipartite Graphs
  13. Altmetric Badge
    Chapter 12 Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs
  14. Altmetric Badge
    Chapter 13 Computer Science – Theory and Applications
  15. Altmetric Badge
    Chapter 14 The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs
  16. Altmetric Badge
    Chapter 15 Satisfiability Thresholds beyond k  −XORSAT
  17. Altmetric Badge
    Chapter 16 Finding Vertex-Surjective Graph Homomorphisms
  18. Altmetric Badge
    Chapter 17 Broadcast Domination on Block Graphs in Linear Time
  19. Altmetric Badge
    Chapter 18 Characterizing Certain Topological Specifications
  20. Altmetric Badge
    Chapter 19 Descriptional Complexity of Operations on Alternating and Boolean Automata
  21. Altmetric Badge
    Chapter 20 Consistency of Multidimensional Combinatorial Substitutions
  22. Altmetric Badge
    Chapter 21 Two-Way Automata Characterizations of L/poly versus NL
  23. Altmetric Badge
    Chapter 22 Cutting through Regular Post Embedding Problems
  24. Altmetric Badge
    Chapter 23 On the Advice Complexity of the Set Cover Problem
  25. Altmetric Badge
    Chapter 24 Constraint Satisfaction with Counting Quantifiers
  26. Altmetric Badge
    Chapter 25 Space-Bounded Kolmogorov Extractors
  27. Altmetric Badge
    Chapter 26 Some Results on more Flexible Versions of Graph Motif
  28. Altmetric Badge
    Chapter 27 A Characterization of Cellular Automata Generated by Idempotents on the Full Shift
  29. Altmetric Badge
    Chapter 28 Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time
  30. Altmetric Badge
    Chapter 29 Boolean Composition of Visual Secret Sharing Schemes
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
3 Wikipedia pages
q&a
1 Q&A thread

Citations

dimensions_citation
3 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.
Title
Computer Science – Theory and Applications
Published by
Springer Berlin Heidelberg, August 2012
DOI 10.1007/978-3-642-30642-6
ISBNs
978-3-64-230641-9, 978-3-64-230642-6
Editors

Hirsch, Edward A., Karhumäki, Juhani, Lepistö, Arto, Prilutskii, Michail

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 %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 100%
Readers by discipline Count As %
Computer Science 1 100%