↓ 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 Battery Scheduling Problem
  3. Altmetric Badge
    Chapter 2 The Volume of a Crosspolytope Truncated by a Halfspace
  4. Altmetric Badge
    Chapter 3 Computable Isomorphisms of Distributive Lattices
  5. Altmetric Badge
    Chapter 4 Minmax-Regret Evacuation Planning for Cycle Networks
  6. Altmetric Badge
    Chapter 5 Planar Digraphs for Automatic Complexity
  7. Altmetric Badge
    Chapter 6 Approximation Algorithms for Graph Burning
  8. Altmetric Badge
    Chapter 7 Sublinear Decoding Schemes for Non-adaptive Group Testing with Inhibitors
  9. Altmetric Badge
    Chapter 8 Compacting and Grouping Mobile Agents on Dynamic Rings
  10. Altmetric Badge
    Chapter 9 Maximum Independent and Disjoint Coverage
  11. Altmetric Badge
    Chapter 10 Algorithms for Closest and Farthest String Problems via Rank Distance
  12. Altmetric Badge
    Chapter 11 Computable Analysis of Linear Rearrangement Optimization
  13. Altmetric Badge
    Chapter 12 On the Power of Oritatami Cotranscriptional Folding with Unary Bead Sequence
  14. Altmetric Badge
    Chapter 13 Stochastic Programming for Energy Plant Operation
  15. Altmetric Badge
    Chapter 14 Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts
  16. Altmetric Badge
    Chapter 15 Unshuffling Permutations: Trivial Bijections and Compositions
  17. Altmetric Badge
    Chapter 16 Continuous Team Semantics
  18. Altmetric Badge
    Chapter 17 Exact Satisfiabitity with Jokers
  19. Altmetric Badge
    Chapter 18 Theoretical Model of Computation and Algorithms for FPGA-Based Hardware Accelerators
  20. Altmetric Badge
    Chapter 19 On the Complexity of and Algorithms for Min-Max Target Coverage On a Line Boundary
  21. Altmetric Badge
    Chapter 20 Online Travelling Salesman Problem on a Circle
  22. Altmetric Badge
    Chapter 21 Second-Order Linear-Time Computability with Applications to Computable Analysis
  23. Altmetric Badge
    Chapter 22 Consistency as a Branching Time Notion
  24. Altmetric Badge
    Chapter 23 Finite Choice, Convex Choice and Sorting
  25. Altmetric Badge
    Chapter 24 The Number of Languages with Maximum State Complexity
  26. Altmetric Badge
    Chapter 25 Deterministic Coresets for Stochastic Matrices with Applications to Scalable Sparse PageRank
  27. Altmetric Badge
    Chapter 26 GPU Based Horn-Schunck Method to Estimate Optical Flow and Occlusion
  28. Altmetric Badge
    Chapter 27 Robot Computing for Music Visualization
  29. Altmetric Badge
    Chapter 28 Combinatorial Properties of Fibonacci Arrays
  30. Altmetric Badge
    Chapter 29 Watson-Crick Jumping Finite Automata
  31. Altmetric Badge
    Chapter 30 Dispersion of Mobile Robots: The Power of Randomness
  32. Altmetric Badge
    Chapter 31 Building Resource Auto-scaler with Functional-Link Neural Network and Adaptive Bacterial Foraging Optimization
  33. Altmetric Badge
    Chapter 32 On the Enumeration of Bicriteria Temporal Paths
  34. Altmetric Badge
    Chapter 33 An Output-Sensitive Algorithm for the Minimization of 2-Dimensional String Covers
  35. Altmetric Badge
    Chapter 34 Introducing Fluctuation into Increasing Order of Symmetric Uncertainty for Consistency-Based Feature Selection
  36. Altmetric Badge
    Chapter 35 Card-Based Cryptography with Invisible Ink
  37. Altmetric Badge
    Chapter 36 Read-Once Certification of Linear Infeasibility in UTVPI Constraints
  38. Altmetric Badge
    Chapter 37 Generalizations of Weighted Matroid Congestion Games: Pure Nash Equilibrium, Sensitivity Analysis, and Discrete Convex Function
  39. Altmetric Badge
    Chapter 38 The Complexity of Synthesis for 43 Boolean Petri Net Types
  40. Altmetric Badge
    Chapter 39 Space Lower Bounds for Graph Stream Problems
  41. Altmetric Badge
    Chapter 40 Bounded Jump and the High/Low Hierarchy
  42. Altmetric Badge
    Chapter 41 Supportive Oracles for Parameterized Polynomial-Time Sub-Linear-Space Computations in Relation to L, NL, and P
  43. Altmetric Badge
    Chapter 42 Dynamic Average Value-at-Risk Allocation on Worst Scenarios in Asset Management
  44. Altmetric Badge
    Chapter 43 First-Order vs. Second-Order Encodings for $$\textsc {ltl}_f$$ -to-Automata Translation
Attention for Chapter 39: Space Lower Bounds for Graph Stream Problems
Altmetric Badge

Mentioned by

twitter
1 X user
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 Lower Bounds for Graph Stream Problems
Chapter number 39
Book title
Theory and Applications of Models of Computation
Published in
arXiv, April 2019
DOI 10.1007/978-3-030-14812-6_39
Book ISBNs
978-3-03-014811-9, 978-3-03-014812-6
Authors

Paritosh Verma, Verma, Paritosh

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.
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 24 November 2020.
All research outputs
#20,941,392
of 23,577,654 outputs
Outputs from arXiv
#692,607
of 973,463 outputs
Outputs of similar age
#304,403
of 354,142 outputs
Outputs of similar age from arXiv
#18,765
of 26,849 outputs
Altmetric has tracked 23,577,654 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 973,463 research outputs from this source. They receive a mean Attention Score of 4.0. 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 354,142 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 26,849 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.