Sébastien Bouchard

From MaRDI portal
(Redirected from Sébastien Bouchard)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Almost-optimal deterministic treasure hunt in arbitrary graphs2026-05-12Paper
Want to gather? No need to chatter!
SIAM Journal on Computing
2025-01-14Paper
Impact of knowledge on the cost of treasure hunt in trees
Networks
2023-12-12Paper
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs
ACM Transactions on Algorithms
2023-10-23Paper
Asynchronous approach in the plane: a deterministic polynomial algorithm2023-02-03Paper
scientific article; zbMATH DE number 7561402 (Why is no real title available?)2022-07-21Paper
Byzantine gathering in polynomial time
Distributed Computing
2022-06-21Paper
Byzantine gathering in polynomial time
(available as arXiv preprint)
2021-07-28Paper
Want to Gather? No Need to Chatter!
Proceedings of the 39th Symposium on Principles of Distributed Computing
2021-03-15Paper
Deterministic treasure hunt in the plane with angular hints
Algorithmica
2020-10-21Paper
Deterministic treasure hunt in the plane with angular hints
Algorithmica
2020-10-21Paper
Asynchronous approach in the plane: a deterministic polynomial algorithm
Distributed Computing
2019-08-13Paper
Asynchronous approach in the plane: a deterministic polynomial algorithm
Distributed Computing
2019-08-13Paper
On deterministic rendezvous at a node of agents with arbitrary velocities
Information Processing Letters
2018-03-16Paper
Byzantine gathering in networks
Distributed Computing
2017-06-22Paper
Byzantine gathering in networks
Lecture Notes in Computer Science
2016-01-08Paper


Research outcomes over time


This page was built for person: Sébastien Bouchard