| Publication | Date of Publication | Type |
|---|
Tree exploration in dual-memory model
| 2024-08-06 | Paper |
Noidy conmunixatipn: on the convergence of the averaging population protocol
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561455 (Why is no real title available?)
| 2022-07-21 | Paper |
Generalized framework for group testing: queries, feedbacks and adversaries
Theoretical Computer Science | 2022-05-10 | Paper |
Fast size approximation of a radio network in beeping model
Theoretical Computer Science | 2020-02-06 | Paper |
On simple back-off in unreliable radio networks
Theoretical Computer Science | 2020-01-16 | Paper |
Does adding more agents make a difference? A case study of cover time for the rotor-router
Journal of Computer and System Sciences | 2019-08-30 | Paper |
Linear search by a pair of distinct-speed robots
Algorithmica | 2019-01-11 | Paper |
Multiple random walks on paths and grids
| 2018-04-19 | Paper |
On location hiding in distributed systems
| 2018-04-12 | Paper |
The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks
Distributed Computing | 2017-10-06 | Paper |
Time and space optimality of rotor-router graph exploration
Information Processing Letters | 2017-08-16 | Paper |
Collision-free network exploration
Journal of Computer and System Sciences | 2017-05-26 | Paper |
Distributed patrolling with two-speed robots (and an application to transportation)
Operations Research and Enterprise Systems | 2017-04-28 | Paper |
Bounds on the cover time of parallel rotor walks
| 2017-03-03 | Paper |
Linear search by a pair of distinct-speed robots
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Approximating the size of a radio network in beeping model
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Setting ports in an anonymous network: how to reduce the level of symmetry?
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Bounds on the cover time of parallel rotor walks
Journal of Computer and System Sciences | 2016-04-18 | Paper |
Information spreading by mobile particles on a line
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Fast collaborative graph exploration
Information and Computation | 2015-06-09 | Paper |
Distinguishing views in symmetric networks: a tight lower bound
Theoretical Computer Science | 2015-04-29 | Paper |
The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Evacuating robots via unknown exit in a disk
Lecture Notes in Computer Science | 2015-02-10 | Paper |
Patrolling by robots equipped with visibility
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router
Automata, Languages, and Programming | 2014-07-01 | Paper |
Collision-free network exploration
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Maximum matching in multi-interface networks
Theoretical Computer Science | 2014-01-16 | Paper |
Fast collaborative graph exploration
Automata, Languages, and Programming | 2013-08-07 | Paper |
Maximum matching in multi-interface networks
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
