↓ Skip to main content
What is this page? Embed badge

Fundamentals of Computation Theory

Overview of attention for book
Cover of 'Fundamentals of Computation Theory'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Together or Separate? Algorithmic Aggregation Problems
  3. Altmetric Badge
    Chapter 2 Decision Problems for Linear Recurrence Sequences
  4. Altmetric Badge
    Chapter 3 Randomized Distributed Decision (Invited Lecture Abstract)
  5. Altmetric Badge
    Chapter 4 On the Complexity of Finding a Largest Common Subtree of Bounded Degree
  6. Altmetric Badge
    Chapter 5 On the Isomorphism Problem for Decision Trees and Decision Lists
  7. Altmetric Badge
    Chapter 6 Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree
  8. Altmetric Badge
    Chapter 7 One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata
  9. Altmetric Badge
    Chapter 8 Efficient Sampling of Non-strict Turnstile Data Streams
  10. Altmetric Badge
    Chapter 9 The Frequent Items Problem in Online Streaming under Various Performance Measures
  11. Altmetric Badge
    Chapter 10 On the Average Size of Glushkov and Equation Automata for KAT Expressions
  12. Altmetric Badge
    Chapter 11 An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem
  13. Altmetric Badge
    Chapter 12 Expressivity of Time-Varying Graphs
  14. Altmetric Badge
    Chapter 13 Parameterized Complexity of Weak Odd Domination Problems
  15. Altmetric Badge
    Chapter 14 Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree
  16. Altmetric Badge
    Chapter 15 A Formal Framework for Property-Driven Obfuscation Strategies
  17. Altmetric Badge
    Chapter 16 Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy
  18. Altmetric Badge
    Chapter 17 Cancellation-Free Circuits in Unbounded and Bounded Depth
  19. Altmetric Badge
    Chapter 18 The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design
  20. Altmetric Badge
    Chapter 19 On Independence Domination
  21. Altmetric Badge
    Chapter 20 Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks
  22. Altmetric Badge
    Chapter 21 New Sequential and Parallel Algorithms for Computing the β -Spectrum
  23. Altmetric Badge
    Chapter 22 Approximation Algorithms for the Antenna Orientation Problem
  24. Altmetric Badge
    Chapter 23 Improved Approximation Algorithms for Constrained Fault-Tolerant Resource Allocation
  25. Altmetric Badge
    Chapter 24 An Axiomatization of the Theory of Generalized Ultrametric Semilattices of Linear Signals
  26. Altmetric Badge
    Chapter 25 On the Structure of Equilibria in Basic Network Formation
  27. Altmetric Badge
    Chapter 26 Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs
  28. Altmetric Badge
    Chapter 27 Groups with a Recursively Enumerable Irreducible Word Problem
  29. Altmetric Badge
    Chapter 28 Real-Time Vector Automata
  30. Altmetric Badge
    Chapter 29 Guarding Thin Orthogonal Polygons Is Hard
Attention for Chapter 8: Efficient Sampling of Non-strict Turnstile Data Streams
Altmetric Badge

Citations

dimensions_citation
1 Dimensions
Summary Dimensions citations
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
Efficient Sampling of Non-strict Turnstile Data Streams
Chapter number 8
Book title
Fundamentals of Computation Theory
Published by
Springer, Berlin, Heidelberg, August 2013
DOI 10.1007/978-3-642-40164-0_8
Book ISBNs
978-3-64-240163-3, 978-3-64-240164-0
Authors

Neta Barkay, Ely Porat, Bar Shalem, Barkay, Neta, Porat, Ely, Shalem, Bar

View on publisher site

This page is provided by Altmetric.