Anthony Ostuni

Orcid: 0000-0002-8530-6476

According to our database¹, Anthony Ostuni authored at least 11 papers between 2020 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2025

Quasipolynomial bounds for the corners theorem.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2025

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2025

Locally Sampleable Uniform Symmetric Distributions.

[BibT_eX]

[DOI]

Daniel M. Kane

Anthony Ostuni

Kewen Wu

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024

Corners in Quasirandom Groups via Sparse Mixing.

[BibT_eX]

[DOI]

Michael Jaber

Shachar Lovett

Anthony Ostuni

Electron. Colloquium Comput. Complex., 2024

Locality Bounds for Sampling Hamming Slices.

[BibT_eX]

[DOI]

Daniel M. Kane

Anthony Ostuni

Kewen Wu

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Refuting Approaches to the Log-Rank Conjecture for XOR Functions.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

SIGACT News, 2022

Extremal Graphs for a Spectral Inequality on Edge-Disjoint Spanning Trees.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

2021

The toughness of Kneser graphs.

[BibT_eX]

[DOI]

Discret. Math., 2021

2020

ProportionNet: Balancing Fairness and Revenue for Auction Design with Deep Learning.

[BibT_eX]

[DOI]

CoRR, 2020

Anthony Ostuni

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...