The space complexity of approximating the frequency moments (Q1305928): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56386814, #quickstatements; #temporary_batch_1711094041063 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tracking join and self-join sizes in limited storage / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4004078 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4023085 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximate counting: a detailed analysis / 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: Counting large numbers of events in small registers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4038696 / rank | |||
Normal rank |
Latest revision as of 08:19, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The space complexity of approximating the frequency moments |
scientific article |
Statements
The space complexity of approximating the frequency moments (English)
0 references
22 September 1999
0 references
space complexity
0 references
0 references