default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRomain Cosson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Romain Cosson, Laurent Massoulié:
Collective Tree Exploration via Potential Function Method. ITCS 2024: 35:1-35:22- [c7]Romain Cosson:
Breaking the k/ log k Barrier in Collective Tree Exploration via Tree-Mining. SODA 2024: 4264-4282 - [i11]Romain Cosson:
Ariadne and Theseus: Exploration and Rendezvous with Two Mobile Agents in an Unknown Graph. CoRR abs/2403.07748 (2024) - [i10]Romain Cosson, Laurent Massoulié:
Barely Random Algorithms for Metrical Task Systems. CoRR abs/2403.11267 (2024) - [i9]Xingjian Bai, Christian Coester, Romain Cosson:
Unweighted Layered Graph Traversal. CoRR abs/2404.16176 (2024) - 2023
- [c6]Romain Cosson, Ali Jadbabaie, Anuran Makur, Amirhossein Reisizadeh, Devavrat Shah:
Gradient Descent with Low-Rank Objective Functions. CDC 2023: 3309-3314 - [c5]Romain Cosson
, Laurent Massoulié, Laurent Viennot:
Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next. PODC 2023: 24-27 - [c4]Romain Cosson, Laurent Massoulié, Laurent Viennot:
Efficient Collaborative Tree Exploration with Breadth-First Depth-Next. DISC 2023: 14:1-14:21 - [i8]Romain Cosson, Laurent Massoulié, Laurent Viennot:
Breadth-First Depth-Next: Optimal Collaborative Exploration of Trees with Low Diameter. CoRR abs/2301.13307 (2023) - [i7]Romain Cosson:
Asynchronous Collective Tree Exploration by Tree-Mining. CoRR abs/2309.07011 (2023) - [i6]Romain Cosson, Laurent Massoulié:
Collective Tree Exploration via Potential Function Method. CoRR abs/2311.01354 (2023) - 2022
- [c3]Moïse Blanchard, Romain Cosson, Steve Hanneke:
Universal Online Learning with Unbounded Losses: Memory Is All You Need. ALT 2022: 107-127 - [c2]Moïse Blanchard, Romain Cosson:
Universal Online Learning with Bounded Loss: Reduction to Binary Classification. COLT 2022: 479-495 - [i5]Moïse Blanchard, Romain Cosson, Steve Hanneke:
Universal Online Learning with Unbounded Losses: Memory Is All You Need. CoRR abs/2201.08903 (2022) - [i4]Romain Cosson, Ali Jadbabaie, Anuran Makur, Amirhossein Reisizadeh, Devavrat Shah:
Gradient Descent for Low-Rank Functions. CoRR abs/2206.08257 (2022) - 2021
- [c1]Romain Cosson, Devavrat Shah:
Quantifying Variational Approximation for Log-Partition Function. COLT 2021: 1330-1357 - [i3]Romain Cosson, Devavrat Shah:
Approximating the Log-Partition Function. CoRR abs/2102.10196 (2021) - [i2]Moïse Blanchard, Romain Cosson:
Universal Online Learning with Bounded Loss: Reduction to Binary Classification. CoRR abs/2112.14638 (2021) - 2020
- [i1]Anish Agarwal, Abdullah Alomar, Romain Cosson, Devavrat Shah, Dennis Shen:
Synthetic Interventions. CoRR abs/2006.07691 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-04 20:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
