↓ 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 Well-Founded and Partial Stable Semantics Logical Aspects
  3. Altmetric Badge
    Chapter 2 The Reachability Problem over Infinite Graphs
  4. Altmetric Badge
    Chapter 3 Kolmogorov Complexity and Model Selection
  5. Altmetric Badge
    Chapter 4 Automatic Verification of Heap-Manipulating Programs Using Separation Logic
  6. Altmetric Badge
    Chapter 5 Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism
  7. Altmetric Badge
    Chapter 6 Integrality Property in Preemptive Parallel Machine Scheduling
  8. Altmetric Badge
    Chapter 7 Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
  9. Altmetric Badge
    Chapter 8 k-SAT Is No Harder Than Decision-Unique-k-SAT
  10. Altmetric Badge
    Chapter 9 Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
  11. Altmetric Badge
    Chapter 10 Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
  12. Altmetric Badge
    Chapter 11 Approximability Distance in the Space of H-Colourability Problems
  13. Altmetric Badge
    Chapter 12 On Random Ordering Constraints
  14. Altmetric Badge
    Chapter 13 Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
  15. Altmetric Badge
    Chapter 14 A Feebly Secure Trapdoor Function
  16. Altmetric Badge
    Chapter 15 Partitioning Graphs into Connected Parts
  17. Altmetric Badge
    Chapter 16 Structural Complexity of AvgBPP
  18. Altmetric Badge
    Chapter 17 Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
  19. Altmetric Badge
    Chapter 18 Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
  20. Altmetric Badge
    Chapter 19 One-Nonterminal Conjunctive Grammars over a Unary Alphabet
  21. Altmetric Badge
    Chapter 20 Concatenation of Regular Languages and Descriptional Complexity
  22. Altmetric Badge
    Chapter 21 Approximability of the Maximum Solution Problem for Certain Families of Algebras
  23. Altmetric Badge
    Chapter 22 Complete Complexity Classification of Short Shop Scheduling
  24. Altmetric Badge
    Chapter 23 Compressed Word Problems in HNN-Extensions and Amalgamated Products
  25. Altmetric Badge
    Chapter 24 Variations on Muchnik’s Conditional Complexity Theorem
  26. Altmetric Badge
    Chapter 25 An Optimal Bloom Filter Replacement Based on Matrix Solving
  27. Altmetric Badge
    Chapter 26 Aperiodicity Measure for Infinite Sequences
  28. Altmetric Badge
    Chapter 27 On the Complexity of Matroid Isomorphism Problems
  29. Altmetric Badge
    Chapter 28 Breaking Anonymity by Learning a Unique Minimum Hitting Set
  30. Altmetric Badge
    Chapter 29 The Budgeted Unique Coverage Problem and Color-Coding
  31. Altmetric Badge
    Chapter 30 Formal Verification of Gate-Level Computer Systems
  32. Altmetric Badge
    Chapter 31 On Models of a Nondeterministic Computation
  33. Altmetric Badge
    Chapter 32 New Plain-Exponential Time Classes for Graph Homomorphism
  34. Altmetric Badge
    Chapter 33 Languages Recognized with Unbounded Error by Quantum Finite Automata
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (86th percentile)
  • High Attention Score compared to outputs of the same age and source (87th percentile)

Mentioned by

twitter
4 X users
wikipedia
2 Wikipedia pages
q&a
1 Q&A thread

Readers on

mendeley
29 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
ADS, January 2009
DOI 10.1007/978-3-642-03351-3
ISBNs
978-3-64-203350-6, 978-3-64-203351-3
Editors

Anna Frid, Andrey Morozov, Andrey Rybalchenko, Klaus W. Wagner

X Demographics

X Demographics

The data shown below were collected from the profiles of 4 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 29 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United Kingdom 1 3%
Portugal 1 3%
France 1 3%
Unknown 26 90%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 6 21%
Student > Master 5 17%
Other 3 10%
Student > Doctoral Student 2 7%
Professor > Associate Professor 2 7%
Other 8 28%
Unknown 3 10%
Readers by discipline Count As %
Computer Science 19 66%
Linguistics 1 3%
Mathematics 1 3%
Chemistry 1 3%
Engineering 1 3%
Other 0 0%
Unknown 6 21%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 8. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 03 August 2023.
All research outputs
#3,964,203
of 23,063,209 outputs
Outputs from ADS
#3,188
of 37,463 outputs
Outputs of similar age
#22,504
of 170,243 outputs
Outputs of similar age from ADS
#116
of 904 outputs
Altmetric has tracked 23,063,209 research outputs across all sources so far. Compared to these this one has done well and is in the 82nd percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 37,463 research outputs from this source. They receive a mean Attention Score of 4.6. This one has done particularly well, scoring higher than 91% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 170,243 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 86% of its contemporaries.
We're also able to compare this research output to 904 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 87% of its contemporaries.