scientific article; zbMATH DE number 5764835

MaRDI QIDQ3579427zbMATH OpenFDO

Authors

Publication date 6 August 2010

Mathematics Subject Classification ID

Distributed systems (68M14) Nonnumerical algorithms (68W05) Communication theory (94A05)

Cited in

(9)

• Improved algorithms for distributed entropy monitoring
• Continuous monitoring of distributed data streams over a time-based sliding window
• Lower bounds for number-in-hand multiparty communication complexity, made easy
• Optimal Random Sampling from Distributed Streams Revisited
• Streaming techniques and data aggregation in networks of tiny artefacts
• New algorithms for distributed sliding windows
• Lower bounds for number-in-hand multiparty communication complexity, made easy
• A Dynamic Distributed Data Structure for Top-k and k-Select Queries
• Efficient decentralized algorithms for the distributed trigger counting problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579427)