Publications

Preprints

• Towards Quantum Universal Hypothesis Testing

*Authors listed in alphabetical ordering of last names.

J: Journal. C: Conferences. W: Workshops.

2025

• [J] Low-Resolution Compressed Sensing and Beyond for Communications and Sensing: Trends and Opportunities.

Geethu Joseph, Venkata Gandikota; Ayush Bhandari; Junil Choi; In-soo Kim; Gyoseung Lee; Michail Matthaiou; 

Chandra R. Murthy; Hien Quoc Ngo; Pramod Varshney; Thakshila Wimalajeewa; Wei Yi; Ye Yuan; Guoxin Zhang.

Elsevier Signal Processing.

• [J] Robust Distributed Clustering with Redundant Data Assignment*

• [C] Combinatorial Group Testing with Deletion Noise

• [C] Sublinear Time Support Recovery in 1-bit Compressed Sensing

• [C] Density-Dependent Group Testing

• [C] Support Recovery in 1-Bit Compressed Sensing with Burst Sparse Noise

• [C] Locally Correctable Lattices

2023

• [C] 1-Bit Compressed Sensing with Local Sparsity

2022

• [J] vqSGD: Vector Quantized Stochastic Gradient Descent*

• [W] Optimization using Parallel Gradient Evaluations on Multiple Parameters 

2021

• [C] Support Recovery of Sparse Signals from a Mixture of Linear Measurements*

• [C] Byzantine Resilient Distributed Clustering with Redundant Data Assignment*

• [C] vqSGD: Vector Quantized Stochastic Gradient Descent*

• [J] Relaxed Locally Correctable Codes in Computationally Bounded Channels*

2020

• [C] Recovery of Sparse Linear Classifiers from Mixture of Responses*

• [C] Reliable Distributed Clustering with Redundant Data Assignment*

2019

• [C] Superset Technique for Approximate Recovery in One-Bit Compressed Sensing*

• [W] Reliable Distributed Clustering with Redundant Data Assignment*

• [W] Private vqSGD: Vector Quantized Stochastic Gradient Descent*

• [C] Relaxed Locally Correctable Codes in Computationally Bounded Channels*

• [J] Nearly Optimal Sparse Group Testing*

2018

• [W] Relaxed Locally Correctable Codes in Computationally Bounded Channels*

• [C] Lattice-based Locality Sensitive Hashing*

• [J] NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott Problem*

• [J] Local Testing for Membership in Lattices*

2017

• Local and Global Computation on Algebraic Data

• [C] Maximally Recoverable Codes: the Bounded Case*

• [J] Deciding Orthogonality in Construction-A Lattices*

2016

• [C] Local Testing for Membership in Lattices*

• [C] NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott Problem*

• [C] Nearly Optimal Sparse Group Testing*

2015

• [C] On the NP-hardness of Bounded Distance Decoding of Reed-Solomon Codes*

• [C] Deciding Orthogonality in Construction-A Lattices*