Mirko Giacchini

Orcid: 0009-0009-5704-098X

According to our database1, Mirko Giacchini authored at least 8 papers between 2023 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Learning Multinomial Logits in O(n log n) time.
CoRR, January, 2026

On the LSH Distortion of Ulam and Cayley Similarities.
Electron. Colloquium Comput. Complex., 2026

Tight Bounds for Sketching Intersecting Sets, with Applications.
Electron. Colloquium Comput. Complex., 2026

Man, These New York Times Games Are Hard! A Computational Perspective.
Proceedings of the 13th International Conference on Fun with Algorithms, 2026

2025
A New Impossibility Result for Online Bipartite Matching Problems.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024
Tight Bounds for Learning RUMs from Small Slates.
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

Coordinating "7 Billion Humans" Is Hard.
Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2023
Approximating a RUM from Distributions on k-Slates.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023


  Loading...