scientific article; zbMATH DE number 7561590

DOI10.4230/LIPICS.ICALP.2019.97MaRDI QIDQ5091258

David P. Woodruff, Guang Yang

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1905.07135

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

communication complexityone-way communicationmulti-player communicationstreaming complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Towards a reverse Newman's theorem in interactive information complexity
• An information statistics approach to data stream and communication complexity
• Communication complexity
• On randomized one-round communication complexity
• Lower bounds for one-way probabilistic communication complexity and their application to space complexity
• Stable distributions, pseudorandom generators, embeddings, and data stream computation
• Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
• Public vs Private Coin in Bounded-Round Information
• Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness
• Tight bounds for distributed functional monitoring
• Fast moment estimation in data streams in optimal space

This page was built for publication: