Algorithms for dynamic geometric problems over data streams

@inproceedings{Indyk2004AlgorithmsFD,
  title={Algorithms for dynamic geometric problems over data streams},
  author={Piotr Indyk},
  booktitle={STOC},
  year={2004}
}
Computing over data streams is a recent phenomenon that is of growing interest in many areas of computer science, including databases, computer networks and theory of algorithms. In this scenario, it is assumed that the algorithm sees the elements of the input one-by-one in arbitrary order, and needs to compute a certain function of the input. However, it does not have enough memory to store the whole input. Therefore, it must maintain a “sketch” of the data. Designing a sketching method for a… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

206 Citations

01020'03'06'10'14'18
Citations per Year
Semantic Scholar estimates that this publication has 206 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

Estimating the weight of euclidean minimum spanning trees in data streams

  • G. Frahling, C. Sohler
  • Manuscript
  • 2004
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…