Erasmo Tani

According to our database1, Erasmo Tani authored at least 9 papers between 2023 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Non-adaptive Learning of Random Hypergraphs with Queries.
CoRR, January, 2025

Submodular Hypergraph Partitioning: Metric Relaxations and Fast Algorithms via an Improved Cut-Matching Game.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024
Optimal Algorithms for Learning Partitions with Faulty Oracles.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Fast Algorithms for Hypergraph PageRank with Applications to Semi-Supervised Learning.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Approximation Algorithms for 𝓁<sub>p</sub>-Shortest Path and 𝓁<sub>p</sub>-Group Steiner Tree.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Learning-Based Algorithms for Graph Searching Problems.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Hypergraph Diffusions and Resolvents for Norm-Based Hypergraph Laplacians.
CoRR, 2023

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

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


  Loading...