↓ Skip to main content

Theory and Applications of Models of Computation

Overview of attention for book
Cover of 'Theory and Applications of Models of Computation'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Semilattices of Punctual Numberings
  3. Altmetric Badge
    Chapter 2 Partial Sums on the Ultra-Wide Word RAM
  4. Altmetric Badge
    Chapter 3 Securely Computing the n -Variable Equality Function with 2 n Cards
  5. Altmetric Badge
    Chapter 4 Polynomial Kernels for Paw-Free Edge Modification Problems
  6. Altmetric Badge
    Chapter 5 Floorplans with Walls
  7. Altmetric Badge
    Chapter 6 A Primal-Dual Randomized Algorithm for the Online Weighted Set Multi-cover Problem
  8. Altmetric Badge
    Chapter 7 Sumcheck-Based Delegation of Quantum Computing to Rational Server
  9. Altmetric Badge
    Chapter 8 Online Removable Knapsack Problems for Integer-Sized Items
  10. Altmetric Badge
    Chapter 9 An Improved Approximation Algorithm for the Prize-Collecting Red-Blue Median Problem
  11. Altmetric Badge
    Chapter 10 LP-Based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors
  12. Altmetric Badge
    Chapter 11 A Constant Factor Approximation for Lower-Bounded k -Median
  13. Altmetric Badge
    Chapter 12 Reverse Mathematics, Projective Modules and Invertible Modules
  14. Altmetric Badge
    Chapter 13 Two-Stage Submodular Maximization Problem Beyond Non-negative and Monotone
  15. Altmetric Badge
    Chapter 14 Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications
  16. Altmetric Badge
    Chapter 15 On the Complexity of Acyclic Modules in Automata Networks
  17. Altmetric Badge
    Chapter 16 Eternal Connected Vertex Cover Problem
  18. Altmetric Badge
    Chapter 17 Parametric Streaming Two-Stage Submodular Maximization
  19. Altmetric Badge
    Chapter 18 Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint
  20. Altmetric Badge
    Chapter 19 A Novel Initialization Algorithm for Fuzzy C -means Problem
  21. Altmetric Badge
    Chapter 20 On the Parameterized Complexity of d -Restricted Boolean Net Synthesis
  22. Altmetric Badge
    Chapter 21 Approximate #Knapsack Computations to Count Semi-fair Allocations
  23. Altmetric Badge
    Chapter 22 Characterizations and Approximability of Hard Counting Classes Below $$\#\mathsf {P}$$
  24. Altmetric Badge
    Chapter 23 On Existence of Equilibrium Under Social Coalition Structures
  25. Altmetric Badge
    Chapter 24 Space Complexity of Streaming Algorithms on Universal Quantum Computers
  26. Altmetric Badge
    Chapter 25 On Coresets for Support Vector Machines
  27. Altmetric Badge
    Chapter 26 Tractabilities for Tree Assembly Problems
  28. Altmetric Badge
    Chapter 27 On Characterization of Petrie Partitionable Plane Graphs
  29. Altmetric Badge
    Chapter 28 Disjunctive Propositional Logic and Scott Domains
  30. Altmetric Badge
    Chapter 29 Dispersing and Grouping Points on Segments in the Plane
  31. Altmetric Badge
    Chapter 30 Synchronizing Words and Monoid Factorization: A Parameterized Perspective
  32. Altmetric Badge
    Chapter 31 Hidden Community Detection on Two-Layer Stochastic Models: A Theoretical Perspective
  33. Altmetric Badge
    Chapter 32 A Primal-Dual Algorithm for Euclidean k -Means Problem with Penalties
  34. Altmetric Badge
    Chapter 33 The Complexity of the Partition Coloring Problem
  35. Altmetric Badge
    Chapter 34 FPT Algorithms for Generalized Feedback Vertex Set Problems
  36. Altmetric Badge
    Chapter 35 Fixed-Order Book Thickness with Respect to the Vertex-Cover Number: New Observations and Further Analysis
  37. Altmetric Badge
    Chapter 36 Acyclic Edge Coloring Conjecture Is True on Planar Graphs Without Intersecting Triangles
  38. Altmetric Badge
    Chapter 37 On Pure Space vs Catalytic Space
Attention for Chapter 24: Space Complexity of Streaming Algorithms on Universal Quantum Computers
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
3 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
Space Complexity of Streaming Algorithms on Universal Quantum Computers
Chapter number 24
Book title
Theory and Applications of Models of Computation
Published in
arXiv, October 2020
DOI 10.1007/978-3-030-59267-7_24
Book ISBNs
978-3-03-059266-0, 978-3-03-059267-7
Authors

Yanglin Hu, Darya Melnyk, Yuyi Wang, Roger Wattenhofer, Hu, Yanglin, Melnyk, Darya, Wang, Yuyi, Wattenhofer, Roger

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user 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 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 33%
Student > Bachelor 1 33%
Researcher 1 33%
Readers by discipline Count As %
Computer Science 2 67%
Physics and Astronomy 1 33%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. 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 November 2020.
All research outputs
#20,653,779
of 23,248,929 outputs
Outputs from arXiv
#684,212
of 958,529 outputs
Outputs of similar age
#357,994
of 418,880 outputs
Outputs of similar age from arXiv
#23,717
of 34,383 outputs
Altmetric has tracked 23,248,929 research outputs across all sources so far. This one is in the 1st percentile – i.e., 1% of other outputs scored the same or lower than it.
So far Altmetric has tracked 958,529 research outputs from this source. They receive a mean Attention Score of 3.9. This one is in the 1st percentile – i.e., 1% of its peers scored the same or lower than it.
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 418,880 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 1st percentile – i.e., 1% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 34,383 others from the same source and published within six weeks on either side of this one. This one is in the 1st percentile – i.e., 1% of its contemporaries scored the same or lower than it.