_id,doi,title
10216,10.4230/LIPIcs.DISC.2021.52,Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds
10217,10.4230/LIPIcs.DISC.2021.4,Lower bounds for shared-memory leader election under bounded write contention
10218,10.4230/LIPIcs.DISC.2021.43,Brief announcement: Fast graphical population protocols
10219,10.4230/LIPIcs.DISC.2021.58,Brief announcement: Sinkless orientation is hard also in the supported LOCAL model