↓ 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 Algorithms for Energy Management
  3. Altmetric Badge
    Chapter 2 Sofic and Almost of Finite Type Tree-Shifts
  4. Altmetric Badge
    Chapter 3 Proof-Based Design of Security Protocols
  5. Altmetric Badge
    Chapter 4 Approximating the Minimum Length of Synchronizing Words Is Hard
  6. Altmetric Badge
    Chapter 5 Realizability of Dynamic MSC Languages
  7. Altmetric Badge
    Chapter 6 The max quasi-independent set Problem
  8. Altmetric Badge
    Chapter 7 Equilibria in Quantitative Reachability Games
  9. Altmetric Badge
    Chapter 8 Quotient complexity of closed languages
  10. Altmetric Badge
    Chapter 9 Right-Sequential Functions on Infinite Words
  11. Altmetric Badge
    Chapter 10 Kernelization
  12. Altmetric Badge
    Chapter 11 Zigzags in Turing Machines
  13. Altmetric Badge
    Chapter 12 Frameworks for Logically Classifying Polynomial-Time Optimisation Problems
  14. Altmetric Badge
    Chapter 13 Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
  15. Altmetric Badge
    Chapter 14 Identical Relations in Symmetric Groups and Separating Words with Reversible Automata
  16. Altmetric Badge
    Chapter 15 Time Optimal d-List Colouring of a Graph
  17. Altmetric Badge
    Chapter 16 The Cantor Space as a Generic Model of Topologically Presented Knowledge
  18. Altmetric Badge
    Chapter 17 Algorithmics – Is There Hope for a Unified Theory?
  19. Altmetric Badge
    Chapter 18 Classifying Rankwidth k-DH-Graphs
  20. Altmetric Badge
    Chapter 19 Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms
  21. Altmetric Badge
    Chapter 20 A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
  22. Altmetric Badge
    Chapter 21 Balancing Bounded Treewidth Circuits
  23. Altmetric Badge
    Chapter 22 Obtaining Online Ecological Colourings by Generalizing First-Fit
  24. Altmetric Badge
    Chapter 23 Classical Simulation and Complexity of Quantum Computations
  25. Altmetric Badge
    Chapter 24 Prefix-Free and Prefix-Correct Complexities with Compound Conditions
  26. Altmetric Badge
    Chapter 25 Monotone Complexity of a Pair
  27. Altmetric Badge
    Chapter 26 Symbolic Models for Single-Conclusion Proof Logics
  28. Altmetric Badge
    Chapter 27 Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA
  29. Altmetric Badge
    Chapter 28 Advancing Matrix Computations with Randomized Preprocessing
  30. Altmetric Badge
    Chapter 29 Transfinite Sequences of Constructive Predicate Logics
  31. Altmetric Badge
    Chapter 30 The Quantitative Analysis of User Behavior Online — Data, Models and Algorithms
  32. Altmetric Badge
    Chapter 31 A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem
  33. Altmetric Badge
    Chapter 32 Complexity of Propositional Proofs
  34. Altmetric Badge
    Chapter 33 Quantization of Random Walks: Search Algorithms and Hitting Time
  35. Altmetric Badge
    Chapter 34 Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
  36. Altmetric Badge
    Chapter 35 Growth of Power-Free Languages over Large Alphabets
  37. Altmetric Badge
    Chapter 36 A Partially Synchronizing Coloring
  38. Altmetric Badge
    Chapter 37 An Encoding Invariant Version of Polynomial Time Computable Distributions
  39. Altmetric Badge
    Chapter 38 Prehistoric Phenomena and Self-referentiality
Attention for Chapter 21: Balancing Bounded Treewidth Circuits
Altmetric Badge

About this Attention Score

  • Above-average Attention Score compared to outputs of the same age and source (58th percentile)

Mentioned by

q&a
1 Q&A thread

Citations

dimensions_citation
1 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
Balancing Bounded Treewidth Circuits
Chapter number 21
Book title
Computer Science – Theory and Applications
Published in
Lecture notes in computer science, June 2010
DOI 10.1007/978-3-642-13182-0_21
Book ISBNs
978-3-64-213181-3, 978-3-64-213182-0
Authors

Maurice Jansen, Jayalal Sarma M.N.

Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. 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 10 October 2014.
All research outputs
#12,943,390
of 22,844,985 outputs
Outputs from Lecture notes in computer science
#3,776
of 8,126 outputs
Outputs of similar age
#64,236
of 83,736 outputs
Outputs of similar age from Lecture notes in computer science
#18
of 48 outputs
Altmetric has tracked 22,844,985 research outputs across all sources so far. This one is in the 42nd percentile – i.e., 42% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,126 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 51% 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 83,736 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 22nd percentile – i.e., 22% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 48 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 58% of its contemporaries.