The Simultaneous Communication of Disjointness with Applications to Data Streams (Q3448862): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-662-47672-7_88 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2401312511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming Algorithms via Precision Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The space complexity of approximating the frequency moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Lower Bound for Linear Sketches of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler algorithm for estimating frequency moments of data streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Lower Bounds via Self-reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Large Frequency Moments with Pick-and-Drop Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An information statistics approach to data stream and communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fast Cauchy Transform and Faster Robust Linear Regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Complexity versus Corruption and Applications to Orthogonality and Gap-Hamming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal approximations of the frequency moments of data streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Communication Complexity of Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turnstile streaming algorithms might as well be linear sketches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Lower Bound for High Frequency Moment Estimation with Small Error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Lower Bounds Using Directional Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space lower bounds for distance approximation in the data stream model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace embeddings for the L <sub>1</sub> -norm with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for distributed functional monitoring / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:49, 10 July 2024

scientific article
Language Label Description Also known as
English
The Simultaneous Communication of Disjointness with Applications to Data Streams
scientific article

    Statements

    The Simultaneous Communication of Disjointness with Applications to Data Streams (English)
    0 references
    0 references
    0 references
    27 October 2015
    0 references
    multiparty communication complexity
    0 references
    information complexity
    0 references
    frequency moments
    0 references
    information theory
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references