| | | | | |
An Improved Line-Point Low-Degree Test | Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan | Tata Institute of Fundamental Research, Harvard University | FOCS | cryptography and residue arithmetic | link |
Bin Packing under Random-Order: Breaking the Barrier of 3/2 | Anish Arvind Hebbar, Arindam Khan, Kidambi Sreenivas | Duke University, Unknown, Indian Institute of Science Bangalore | SODA | optimization and packing problems | link |
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time | V. Arvind, Abhranil Chatterjee, Partha Mukhopadhyay | Chennai Mathematical Institute, Indian Statistical Institute | STOC | cryptography and data security | link |
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits | Mrinal Kumar, V. Ramanathan, Ramprasad Saptharishi | Tata Institute of Fundamental Research | SODA | cryptographic implementations and security | link |
Fast list decoding of univariate multiplicity and folded Reed-Solomon codes | Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar | Massachusetts Institute of Technology, Tata Institute of Fundamental Research | FOCS | coding theory and cryptography | link |
Learning the coefficients: A presentable version of border complexity and applications to circuit factoring | C. S. Bhargav, Prateek Dwivedi, Nitin Saxena | Indian Institute of Technology Kanpur | STOC | coding theory and cryptography | link |