ProportionNet: Balancing Fairness and Revenue for Auction Design with Deep Learning. - Kevin Kuo; Anthony Ostuni; Elizabeth Horishny; Michael J. Curry; Samuel Dooley; Ping-yeh Chiang; Tom Goldstein; John P. Dickerson (CoRR, 2020)

The toughness of Kneser graphs. - Davin Park; Anthony Ostuni; Nathan Hayes; Amartya Banerjee; Tanay V. Wakhare; Wiseley Wong; Sebastian M. Cioaba (Discret. Math., 2021)

Extremal Graphs for a Spectral Inequality on Edge-Disjoint Spanning Trees. - Sebastian M. Cioaba; Anthony Ostuni; Davin Park; Sriya Potluri; Tanay V. Wakhare; Wiseley Wong (Electron. J. Comb., 2022)

The Complexity of Chromatic Number When Restricted to graphs with Bounded Genus or Bounded Crossing Number. - William Gasarch; Nathan Hayes; Anthony Ostuni; Davin Park (SIGACT News, 2022)

A tight lower bound on non-adaptive group testing estimation. - Tsun-Ming Cheung; Hamed Hatami; Anthony Ostuni (CoRR, 2023)

Refuting approaches to the log-rank conjecture for XOR functions. - Hamed Hatami; Kaave Hosseini; Shachar Lovett; Anthony Ostuni (Electron. Colloquium Comput. Complex., 2023)

Locally Sampleable Uniform Symmetric Distributions. - Daniel Kane 001; Anthony Ostuni; Kewen Wu 001 (Electron. Colloquium Comput. Complex., 2024)

Corners in Quasirandom Groups via Sparse Mixing. - Michael Jaber; Shachar Lovett; Anthony Ostuni (Electron. Colloquium Comput. Complex., 2024)

Locality Bounds for Sampling Hamming Slices. - Daniel M. Kane; Anthony Ostuni; Kewen Wu 001 (Electron. Colloquium Comput. Complex., 2024)

A tight lower bound on non-adaptive group testing estimation. - Nader H. Bshouty; Tsun-Ming Cheung; Gergely Harcos; Hamed Hatami; Anthony Ostuni (Discret. Appl. Math., 2025)

Quasipolynomial bounds for the corners theorem. - Michael Jaber; Yang P. Liu; Shachar Lovett; Anthony Ostuni; Mehtaab Sawhney (Electron. Colloquium Comput. Complex., 2025)