Journal: Journal of the ACM

Volume 71, Issue 5

0 -- 0Namiko Matsumoto, Arya Mazumdar. Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing
0 -- 0Antoine Mottet, Michael Pinsker. Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structures
0 -- 0Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc. Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
0 -- 0Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva. p-Regression
0 -- 0Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos. Pure-Circuit: Tight Inapproximability for PPAD
0 -- 0Maria-Florina Balcan, Dan F. DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, Ellen Vitercik. How Much Data Is Sufficient to Learn High-Performing Algorithms?