STOC 2013

Bottom-k and priority sampling, set similarity and subset sums with minimal independence

Conference Paper 5A Algorithms and Complexity · Theoretical Computer Science

Abstract

No abstract is available in the live database for this paper.

Authors

Mikkel Thorup

Keywords

No keywords are indexed for this paper.

Context

Venue: ACM Symposium on Theory of Computing
Archive span: 1969-2025
Indexed papers: 4364
Paper id: 980200140974768235