3 citations · 6 across the 4 of their papers we have counts for
4 papers
Efficiently Computing Sparse Fourier Transforms of -ary Functions
Yigit Efe Erginbas, Justin Singh Kang, Amirali Aghazadeh +1
Fourier transformations of pseudo-Boolean functions are popular tools for analyzing functions of binary sequences. Real-world functions often have structures that manifest in a spa…
The Fair Value of Data Under Heterogeneous Privacy Constraints in Federated Learning
Justin Kang, Ramtin Pedarsani, Kannan Ramchandran
Modern data aggregation often involves a platform collecting data from a network of users with various privacy options. Platforms must solve the problem of how to allocate incentiv…
Scheduling Versus Contention for Massive Random Access in Massive MIMO Systems
Justin Kang, Wei Yu
Massive machine-type communications protocols have typically been designed under the assumption that coordination between users requires significant communication overhead and is t…
Minimum Feedback for Collision-Free Scheduling in Massive Random Access
Justin Singh Kang, Wei Yu
Consider a massive random access scenario in which a small set of active users out of a large number of potential users need to be scheduled in slots. What is the…