Anthony Ostuni

According to our database, Anthony Ostuni authored at least 7 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Locality Bounds for Sampling Hamming Slices.

Daniel M. Kane, Anthony Ostuni, Kewen Wu

Electron. Colloquium Comput. Complex., 2024

2023

Refuting approaches to the log-rank conjecture for XOR functions.

Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni

Electron. Colloquium Comput. Complex., 2023

A tight lower bound on non-adaptive group testing estimation.

Tsun-Ming Cheung, Hamed Hatami, Anthony Ostuni

CoRR, 2023

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

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

2021

The toughness of Kneser graphs.

Davin Park, Anthony Ostuni, Nathan Hayes, Amartya Banerjee, Tanay V. Wakhare, Wiseley Wong, Sebastian M. Cioaba

Discret. Math., 2021

2020

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