Using Additional Information in Streaming Algorithms

@inproceedings{Buff2016UsingAI,
  title={Using Additional Information in Streaming Algorithms},
  author={Raffael Buff},
  year={2016}
}
Streaming problems are algorithmic problems that are mainly characterized by their massive input streams. Because of these data streams, the algorithms for these problems are forced to be space-efficient, as the input stream length generally exceeds the available storage. In this thesis, the two streaming problems most frequent item and number of distinct items are studied in detail relating to their algorithmic complexities, and it is compared whether the verification of solution hypotheses… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 26 REFERENCES

Communication Complexity (for Algorithm Designers)

  • Electronic Colloquium on Computational Complexity
  • 2015

Efficient Delegation Algorithms for Outsourcing omputations on Massive Data Streams

Ved Prakash
  • PhD thesis, National University of Singapore,
  • 2015

Eine Einführung in Online-Algorithmen

Dennis Komm
  • Skript zur Vorlesung APPROXIMATIONS- und ONLINE-ALGORITHMEN, ETH Zürich,
  • 2015

An introduction to data streams. In Data Streams Models and Algorithms, pages

Charu C. Aggarwal
  • 2007