↓ 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 Approximability and Inapproximability for Maximum k -Edge-Colored Clustering Problem
  3. Altmetric Badge
    Chapter 2 The Non-hardness of Approximating Circuit Size
  4. Altmetric Badge
    Chapter 3 Reconstructing a Convex Polygon from Its $$\omega $$ ω -cloud
  5. Altmetric Badge
    Chapter 4 A Space-Efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraization
  6. Altmetric Badge
    Chapter 5 Quantum Algorithm for Distribution-Free Junta Testing
  7. Altmetric Badge
    Chapter 6 On Induced Online Ramsey Number of Paths, Cycles, and Trees
  8. Altmetric Badge
    Chapter 7 Approximations of Schatten Norms via Taylor Expansions
  9. Altmetric Badge
    Chapter 8 Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes
  10. Altmetric Badge
    Chapter 9 Belga B-Trees
  11. Altmetric Badge
    Chapter 10 Eventually Dendric Shifts
  12. Altmetric Badge
    Chapter 11 On Decidability of Regular Languages Theories
  13. Altmetric Badge
    Chapter 12 Minimizing Branching Vertices in Distance-Preserving Subgraphs
  14. Altmetric Badge
    Chapter 13 On Tseitin Formulas, Read-Once Branching Programs and Treewidth
  15. Altmetric Badge
    Chapter 14 Matched Instances of Quantum Satisfiability (QSat) – Product State Solutions of Restrictions
  16. Altmetric Badge
    Chapter 15 Notes on Resolution over Linear Equations
  17. Altmetric Badge
    Chapter 16 Undecidable Word Problem in Subshift Automorphism Groups
  18. Altmetric Badge
    Chapter 17 Parameterized Complexity of Conflict-Free Set Cover
  19. Altmetric Badge
    Chapter 18 Forward Looking Huffman Coding
  20. Altmetric Badge
    Chapter 19 Computational Complexity of Real Powering and Improved Solving Linear Differential Equations
  21. Altmetric Badge
    Chapter 20 On the Quantum and Classical Complexity of Solving Subtraction Games
  22. Altmetric Badge
    Chapter 21 Derandomization for Sliding Window Algorithms with Strict Correctness
  23. Altmetric Badge
    Chapter 22 On the Complexity of Restarting
  24. Altmetric Badge
    Chapter 23 On the Complexity of Mixed Dominating Set
  25. Altmetric Badge
    Chapter 24 Uniform CSP Parameterized by Solution Size is in W[1]
  26. Altmetric Badge
    Chapter 25 On the Parameterized Complexity of Edge-Linked Paths
  27. Altmetric Badge
    Chapter 26 The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs
  28. Altmetric Badge
    Chapter 27 Transition Property for Cube-Free Words
  29. Altmetric Badge
    Chapter 28 A Polynomial Time Delta-Decomposition Algorithm for Positive DNFs
  30. Altmetric Badge
    Chapter 29 Unpopularity Factor in the Marriage and Roommates Problems
  31. Altmetric Badge
    Chapter 30 AND Protocols Using only Uniform Shuffles
  32. Altmetric Badge
    Chapter 31 Sybil-Resilient Conductance-Based Community Growth
Attention for Chapter 30: AND Protocols Using only Uniform Shuffles
Altmetric Badge

About this Attention Score

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

Mentioned by

twitter
3 X users
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
AND Protocols Using only Uniform Shuffles
Chapter number 30
Book title
Computer Science – Theory and Applications
Published in
arXiv, July 2019
DOI 10.1007/978-3-030-19955-5_30
Book ISBNs
978-3-03-019954-8, 978-3-03-019955-5
Authors

Suthee Ruangwises, Toshiya Itoh, Ruangwises, Suthee, Itoh, Toshiya

X Demographics

X Demographics

The data shown below were collected from the profiles of 3 X users who shared this research output. Click here to find out more about how the information was compiled.
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 2. 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 23 March 2021.
All research outputs
#15,118,934
of 24,002,307 outputs
Outputs from arXiv
#305,869
of 1,011,770 outputs
Outputs of similar age
#195,120
of 351,839 outputs
Outputs of similar age from arXiv
#9,229
of 28,606 outputs
Altmetric has tracked 24,002,307 research outputs across all sources so far. This one is in the 34th percentile – i.e., 34% of other outputs scored the same or lower than it.
So far Altmetric has tracked 1,011,770 research outputs from this source. They receive a mean Attention Score of 4.0. This one has gotten more attention than average, scoring higher than 65% 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 351,839 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 41st percentile – i.e., 41% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 28,606 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 64% of its contemporaries.