1

A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up

Brief Announcement: Optimal Time and Space Leader Election in Population Protocols

Improved Scheduling with a Shared Resource via Structural Insights

Optimal time and space leader election in population protocols

On the Complexity of Anchored Rectangle Packing

Tight & Simple Load Balancing

Towards Efficient Reconstruction of Attacker Lateral Movement

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States

Simple and Efficient Leader Election

Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs