_id,doi,title
11183,10.4230/LIPIcs.OPODIS.2021.15,"Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters"
10854,10.1145/3410220.3453923,Input-dynamic distributed algorithms for communication networks
10855,10.1145/3447384,Input-dynamic distributed algorithms for communication networks
11464,,Towards tight communication lower bounds for distributed optimisation
7939,10.1007/s00446-020-00380-5,Fast approximate shortest paths in the congested clique
10219,10.4230/LIPIcs.DISC.2021.58,Brief announcement: Sinkless orientation is hard also in the supported LOCAL model
9631,,Scalable belief propagation via relaxed scheduling
6933,10.1145/3293611.3331633,Fast approximate shortest paths in the congested clique
6935,10.1145/3293611.3331581,Does preprocessing help under congestion?
7150,10.1007/s00446-016-0270-2,Algebraic methods in the congested clique