scientific article; zbMATH DE number 7053294
From MaRDI portal
Publication:5743415
zbMath1422.68090MaRDI QIDQ5743415
Qin Zhang, Elad Verbin, Jeff M. Phillips
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095158
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
The Range of Topological Effects on Communication ⋮ The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free ⋮ Connectivity and connected components in the number-in-hand computation model ⋮ Distributed and Robust Support Vector Machine
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An information statistics approach to data stream and communication complexity
- Top-\(k\) vectorial aggregation queries in a distributed environment
- Finding repeated elements
- On the distributional complexity of disjointness
- Lower bounds on the multiparty communication complexity
- Super-logarithmic depth lower bounds via the direct sum in communication complexity
- Optimal tracking of distributed heavy hitters and quantiles
- Approximate distributed top-\(k\) queries
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- How to compress interactive communication
- Towards polynomial lower bounds for dynamic problems
- Approximating extent measures of points
- Functional Monitoring without Monotonicity
- Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
- The Probabilistic Communication Complexity of Set Intersection
- Communication Complexity
- Practical methods for shape fitting and kinetic data structures using core sets
- Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence
- Continuous sampling from distributed streams
- Efficient top-K query calculation in distributed networks
This page was built for publication:
