J. Burman

From MaRDI portal
(Redirected from J. Burman)



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
Time-optimal self-stabilizing leader election in population protocols
Distributed Computing
2026-09-09Paper
Time-Optimal Self-Stabilizing Leader Election in Population Protocols
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing
2024-03-26Paper
Space-optimal naming in population protocols2023-02-03Paper
Data Collection in Population Protocols with Non-uniformly Random Scheduler
Algorithms for Sensor Systems
2022-12-09Paper
Self-stabilizing distributed stable marriage
Lecture Notes in Computer Science
2022-11-04Paper
Beeping a deterministic time-optimal leader election2022-07-21Paper
Can Uncoordinated Beeps tell Stories?
Proceedings of the 39th Symposium on Principles of Distributed Computing
2021-03-15Paper
Optimal multi-broadcast with beeps using group testing2020-03-03Paper
Data collection in population protocols with non-uniformly random scheduler
Theoretical Computer Science
2020-01-16Paper
On the power of oracle \(\varOmega ?\) for self-stabilizing leader election in population protocols2019-11-22Paper
Brief Announcement
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
2019-09-19Paper
Brief announcement: Space-optimal naming in population protocols
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
2019-09-19Paper
Space-optimal counting in population protocols2018-08-24Paper
Time and space optimal counting in population protocols
(available as arXiv preprint)
2018-07-18Paper
The benefits of entropy in population protocols2017-09-29Paper
Exclusive graph searching
Algorithmica
2017-04-12Paper
On utilizing speed in networks of mobile agents
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
2015-03-02Paper
Tight complexity analysis of population protocols with cover times -- the ZebraNet example
Theoretical Computer Science
2014-01-13Paper
Exclusive graph searching
Lecture Notes in Computer Science
2013-09-17Paper
A self-stabilizing transformer for population protocols with covering
Theoretical Computer Science
2011-07-22Paper
Time Optimal Asynchronous Self-stabilizing Spanning Tree
Lecture Notes in Computer Science
2008-09-02Paper


Research outcomes over time


This page was built for person: J. Burman