Scholar
Romain Cosson
Google Scholar ID: 7TjCF4QAAAAJ
Inria Paris
Online algorithms
inference
optimization
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
83
H-index
5
i10-index
4
Publications
13
Co-authors
9
list available
Contact
CV
Open ↗
LinkedIn
Open ↗
Publications
4 items
Contextual Online Bilateral Trade
2026
Cited
1
The value of random zero-sum games
2026
Cited
0
Non-Clairvoyant Scheduling with Progress Bars
2025
Cited
0
Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound
2025
Cited
0
Resume (English only)
Academic Achievements
Published 'Non-clairvoyant scheduling with progress bars' at NeurIPS 2025 (Spotlight).
Published 'Unweighted Layered Graph Traversal' at SODA 2025.
Published 'Barely Random Algorithms for Metrical Task Systems' at NeurIPS 2024 (Spotlight).
Published 'Collective Tree Exploration via Potential Function Method' at ITCS 2024.
Published 'Breaking the k/log k Barrier in Collective Tree Exploration via Tree-Mining' at SODA 2024.
Published 'Efficient Collaborative Tree Exploration with Breadth-First Depth-Next' at DISC 2023, announced at PODC 2023.
Multiple publications at top venues including COLT 2022, ALT 2022, and COLT 2021.
Completed MIT Master's thesis 'Approximating the Log-Partition Function' in 2021.
Co-authors
9 total
Laurent Massoulié
Inria
Devavrat Shah
Massachusetts Institute of Technology
Ali Jadbabaie
JR East Professor of Engineering, MIT
Amirhossein Reisizadeh
Postdoctoral Associate, MIT
Moïse Blanchard
MIT
Laurent Viennot
Inria
Steve Hanneke
Purdue University
Xingjian Bai
Massachusetts Institute of Technology
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up