Erasmo Tani

According to our database, Erasmo Tani authored at least 13 papers between 2023 and 2026.

Collaborative distances:

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

2026

Learning Multinomial Logits in O(n log n) time.

Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Erasmo Tani, Andrew Tomkins

CoRR, January, 2026

On the LSH Distortion of Ulam and Cayley Similarities.

Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Erasmo Tani

Electron. Colloquium Comput. Complex., 2026

Tight Bounds for Sketching Intersecting Sets, with Applications.

Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Alessandro Panconesi, Erasmo Tani, Andrew Tomkins

Electron. Colloquium Comput. Complex., 2026

Man, These New York Times Games Are Hard! A Computational Perspective.

Alessandro Giovanni Alberti, Flavio Chierichetti, Mirko Giacchini, Daniele Muscillo, Alessandro Panconesi, Erasmo Tani

Proceedings of the 13th International Conference on Fun with Algorithms, 2026

2025

Non-Adaptive Learning of Random Hypergraphs with Queries.

Bethany Austhof, Lev Reyzin, Erasmo Tani

Proceedings of the IEEE International Symposium on Information Theory, 2025

Submodular Hypergraph Partitioning: Metric Relaxations and Fast Algorithms via an Improved Cut-Matching Game.

Antares Chen, Lorenzo Orecchia, Erasmo Tani

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

Optimal Algorithms for Learning Partitions with Faulty Oracles.

Adela Frances DePavia, Olga Medrano Martín del Campo, Erasmo Tani

Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

Fast Algorithms for Hypergraph PageRank with Applications to Semi-Supervised Learning.

Konstantinos Ameranis, Adela Frances DePavia, Lorenzo Orecchia, Erasmo Tani

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Approximation Algorithms for 𝓁_p-Shortest Path and 𝓁_p-Group Steiner Tree.

Yury Makarychev, Max Ovsiankin, Erasmo Tani

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

Learning-Based Algorithms for Graph Searching Problems.

Adela Frances DePavia, Erasmo Tani, Ali Vakilian

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023

Hypergraph Diffusions and Resolvents for Norm-Based Hypergraph Laplacians.

Konstantinos Ameranis, Antares Chen, Adela Frances DePavia, Lorenzo Orecchia, Erasmo Tani

CoRR, 2023

Error-Tolerant Exact Query Learning of Finite Set Partitions with Same-Cluster Oracle.

Adela Frances DePavia, Olga Medrano Martín del Campo, Erasmo Tani

CoRR, 2023

Efficient Flow-based Approximation Algorithms for Submodular Hypergraph Partitioning via a Generalized Cut-Matching Game.

Konstantinos Ameranis, Antares Chen, Lorenzo Orecchia, Erasmo Tani

CoRR, 2023