Oneshot Differentially Private Top-k Selection

                      Gang Qiao 1 Weijie J. Su 2 Li Zhang 3

             Abstract                 k items with (approximately) the maximum values among
                                 m given values. The problem of privately reporting the
   Being able to efficiently and accurately select the
                                 k largest elements is an essential building block in many
   top-k elements with differential privacy is an in-
            ...