Moïse Blanchard
Orcid: 0000-0003-0593-8666
According to our database1,
Moïse Blanchard
authored at least 20 papers
between 2020 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2020
2021
2022
2023
2024
0
1
2
3
4
5
6
7
8
3
3
3
1
1
3
2
4
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Probabilistic Bounds on the <i>k</i>-Traveling Salesman Problem and the Traveling Repairman Problem.
Math. Oper. Res., 2024
CoRR, 2024
Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024
Proceedings of the International Conference on Algorithmic Learning Theory, 2024
2023
CoRR, 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023
2022
Additional Results and Extensions for the paper "Probabilistic bounds on the k-Traveling Salesman Problem and the Traveling Repairman Problem".
CoRR, 2022
Probabilistic bounds on the k-Traveling Salesman Problem and the Traveling Repairman Problem.
CoRR, 2022
Proceedings of the Tenth International Conference on Learning Representations, 2022
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022
2021
2020
CoRR, 2020