↓ Skip to main content

STACS 2006

Overview of attention for book
Cover of 'STACS 2006'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Ubiquitous Digital Tree
  3. Altmetric Badge
    Chapter 2 Flat Holonomies on Automata Networks
  4. Altmetric Badge
    Chapter 3 Interprocedurally Analyzing Polynomial Identities
  5. Altmetric Badge
    Chapter 4 External String Sorting: Faster and Cache-Oblivious
  6. Altmetric Badge
    Chapter 5 Amortized Rigidness in Dynamic Cartesian Trees
  7. Altmetric Badge
    Chapter 6 Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes
  8. Altmetric Badge
    Chapter 7 On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms
  9. Altmetric Badge
    Chapter 8 Equivalence of $\mathbb{F}$ -Algebras and Cubic Forms
  10. Altmetric Badge
    Chapter 9 Complete Codes in a Sofic Shift
  11. Altmetric Badge
    Chapter 10 Kolmogorov Complexity with Error
  12. Altmetric Badge
    Chapter 11 Kolmogorov Complexity and the Recursion Theorem
  13. Altmetric Badge
    Chapter 12 Entanglement in Interactive Proof Systems with Binary Answers
  14. Altmetric Badge
    Chapter 13 Quantum Algorithms for Matching and Network Flows
  15. Altmetric Badge
    Chapter 14 The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
  16. Altmetric Badge
    Chapter 15 Estimating Entropy and Entropy Norm on Data Streams
  17. Altmetric Badge
    Chapter 16 Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems
  18. Altmetric Badge
    Chapter 17 STACS 2006
  19. Altmetric Badge
    Chapter 18 Oblivious Symmetric Alternation
  20. Altmetric Badge
    Chapter 19 Combining Multiple Heuristics
  21. Altmetric Badge
    Chapter 20 Conflict-Free Colorings of Rectangles Ranges
  22. Altmetric Badge
    Chapter 21 Grid Vertex-Unfolding Orthogonal Polyhedra
  23. Altmetric Badge
    Chapter 22 Theory and Application of Width Bounded Geometric Separator
  24. Altmetric Badge
    Chapter 23 Invariants of Automatic Presentations and Semi-synchronous Transductions
  25. Altmetric Badge
    Chapter 24 On the Accepting Power of 2-Tape Büchi Automata
  26. Altmetric Badge
    Chapter 25 Weighted Picture Automata and Weighted Logics
  27. Altmetric Badge
    Chapter 26 Markov Decision Processes with Multiple Objectives
  28. Altmetric Badge
    Chapter 27 The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms
  29. Altmetric Badge
    Chapter 28 Convergence and Approximation in Potential Games
  30. Altmetric Badge
    Chapter 29 Fast FPT-Algorithms for Cleaning Grids
  31. Altmetric Badge
    Chapter 30 Tradeoffs in Depth-Two Superconcentrators
  32. Altmetric Badge
    Chapter 31 On Hypergraph and Graph Isomorphism with Bounded Color Classes
  33. Altmetric Badge
    Chapter 32 Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences
  34. Altmetric Badge
    Chapter 33 Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets
  35. Altmetric Badge
    Chapter 34 Regularity Problems for Visibly Pushdown Languages
  36. Altmetric Badge
    Chapter 35 Regular Expressions and NFAs Without ε-Transitions
  37. Altmetric Badge
    Chapter 36 Redundancy in Complete Sets
  38. Altmetric Badge
    Chapter 37 Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds
  39. Altmetric Badge
    Chapter 38 Linear Advice for Randomized Logarithmic Space
  40. Altmetric Badge
    Chapter 39 Nested Pebbles and Transitive Closure
  41. Altmetric Badge
    Chapter 40 Definability of Languages by Generalized First-Order Formulas over (N,+)
  42. Altmetric Badge
    Chapter 41 Generalized Modal Satisfiability
  43. Altmetric Badge
    Chapter 42 Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games
  44. Altmetric Badge
    Chapter 43 DAG-Width and Parity Games
  45. Altmetric Badge
    Chapter 44 Reliable Computations Based on Locally Decodable Codes
  46. Altmetric Badge
    Chapter 45 Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
  47. Altmetric Badge
    Chapter 46 A Faster Algorithm for the Steiner Tree Problem
  48. Altmetric Badge
    Chapter 47 Generating Randomized Roundings with Cardinality Constraints and Derandomizations
  49. Altmetric Badge
    Chapter 48 Online Sorting Buffers on Line
  50. Altmetric Badge
    Chapter 49 Optimal Node Routing
  51. Altmetric Badge
    Chapter 50 Memoryless Facility Location in One Pass
  52. Altmetric Badge
    Chapter 51 Energy-Efficient Algorithms for Flow Time Minimization
  53. Altmetric Badge
    Chapter 52 Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games
  54. Altmetric Badge
    Chapter 53 Datalog and Constraint Satisfaction with Infinite Templates
  55. Altmetric Badge
    Chapter 54 Evaluating Monotone Circuits on Cylinders, Planes and Tori
  56. Altmetric Badge
    Chapter 55 Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
  57. Altmetric Badge
    Chapter 56 Weighted Asynchronous Cellular Automata
  58. Altmetric Badge
    Chapter 57 On the Complexity of the “Most General” Firing Squad Synchronization Problem
Attention for Chapter 12: Entanglement in Interactive Proof Systems with Binary Answers
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 (90th percentile)
  • High Attention Score compared to outputs of the same age and source (90th percentile)

Mentioned by

blogs
2 blogs

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
17 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
Entanglement in Interactive Proof Systems with Binary Answers
Chapter number 12
Book title
STACS 2006
Published in
arXiv, February 2006
DOI 10.1007/11672142_12
Book ISBNs
978-3-54-032301-3, 978-3-54-032288-7
Authors

Stephanie Wehner

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Japan 1 6%
Unknown 16 94%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 5 29%
Student > Ph. D. Student 4 24%
Researcher 3 18%
Student > Doctoral Student 1 6%
Student > Bachelor 1 6%
Other 1 6%
Unknown 2 12%
Readers by discipline Count As %
Computer Science 9 53%
Physics and Astronomy 3 18%
Mathematics 2 12%
Unknown 3 18%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 11. 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 30 January 2020.
All research outputs
#2,964,541
of 22,971,207 outputs
Outputs from arXiv
#54,685
of 942,116 outputs
Outputs of similar age
#6,520
of 70,979 outputs
Outputs of similar age from arXiv
#23
of 251 outputs
Altmetric has tracked 22,971,207 research outputs across all sources so far. Compared to these this one has done well and is in the 87th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 942,116 research outputs from this source. They receive a mean Attention Score of 3.9. This one has done particularly well, scoring higher than 94% 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 70,979 tracked outputs that were published within six weeks on either side of this one in any source. This one has done particularly well, scoring higher than 90% of its contemporaries.
We're also able to compare this research output to 251 others from the same source and published within six weeks on either side of this one. This one has done particularly well, scoring higher than 90% of its contemporaries.