An information statistics approach to data stream and communication complexity (Q598248): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Lower bounds for one-way probabilistic communication complexity and their application to space complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting of inversions in a data stream / 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: Privacy, additional information and communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximate <i>L</i><sup>1</sup> -Difference Algorithm for Massive Data Streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, small-space algorithms for approximate histogram maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two applications of information complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On randomized one-round communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-logarithmic depth lower bounds via the direct sum in communication complexity / 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: Divergence measures based on the Shannon entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics in statistics: some basic concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Repetition Theorem / 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: Q3762226 / rank
 
Normal rank

Revision as of 18:12, 6 June 2024

scientific article
Language Label Description Also known as
English
An information statistics approach to data stream and communication complexity
scientific article

    Statements

    An information statistics approach to data stream and communication complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 August 2004
    0 references

    Identifiers