• About communications
  • Current Issue
  • Digital Edition
  • Sample Issue
  • FAQs
  • Author Center
  • Author Guidelines
  • ACM Copyright Form
  • ACM Copyright Policy
  • ACM Author Rights
  • Submit a Video
  • Editor's Letters
  • Third-Party Material
  • Kudos Service
  • 2016 Editorial Calendar
  • Editorial Board
  • Editor's Letters
  • Editorial Staff
  • Contact Us
  • Mobile Apps
  • For Advertisers
  • Research Archive


    Latest Research Research Archive 2019AugustJulyJuneMayAprilMarchFebruaryJanuary2018DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2017DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2016DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2015DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2014DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2013DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2012DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2011DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2010DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2009DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2008DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary Refine your search:
    Archives

    The Research archive provides access to all Research articles published in past issues of Communications of the ACM.

    August 2019


    From Communications of the ACM

    Heavy Hitters via Cluster-Preserving Clustering

    Heavy Hitters via Cluster-Preserving Clustering

    We develop a new algorithm for the turnstile heavy hitters problem in general turnstile streams, the EXPANDERSKETCH, which finds the approximate top-k items in a universe of size n using the same asymptotic O(k log n) words of…

    Kasper Green Larsen, Jelani Nelson, Huy L. Nguyễn, Mikkel Thorup | August 2019

    From Communications of the ACM

    Technical Perspective: The True Cost of Popularity

    The main focus of "Heavy Hitters via Cluster-Preserving Clustering" by Kasper Green Larsen et al. is on building up sufficient information to allow a more effective search process.

    Graham Cormode | August 2019