Amanote Research

Amanote Research

    RegisterSign In

Space Lower Bounds for Itemset Frequency Sketches

doi 10.1145/2902251.2902278
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2016

Authors
Edo LibertyMichael MitzenmacherJustin ThalerJonathan Ullman
Publisher

ACM Press


Related search

Comparison-Based Time–Space Lower Bounds for Selection

2009English

Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Lower Bounds

2016English

Lower Bounds for Subgraph Isomorphism

2019English

Lower Bounds for Z-Numbers

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2009English

Lower Bounds for Dynamic Connectivity

2004English

Lower Bounds for the Extrinsic Total Curvatures of a Space-Like Codimension $2$ Surface in Minkowski Space

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1990English

Lower Bounds for Measurable Chromatic Numbers

Geometric and Functional Analysis
GeometryAnalysisTopology
2009English

Calculating Lower Bounds for Caching Problems

Computing (Vienna/New York)
Numerical AnalysisComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTheoretical Computer ScienceSoftware
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy