_id,doi,title
11183,10.4230/LIPIcs.OPODIS.2021.15,"Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters"
11184,10.4230/LIPIcs.OPODIS.2021.14,Fast graphical population protocols
11420,,Mean-field analysis of piecewise linear solutions for wide ReLU networks
11707,10.1007/978-3-031-09993-9_1,Local mending
13076,10.5281/ZENODO.5733408,Multi-queues can be state-of-the-art priority schedulers
11844,10.1145/3519270.3538435,Near-optimal leader election in population protocols on graphs
12182,10.4230/LIPIcs.DISC.2022.52,Brief announcement: Temporal locality in online algorithms
12299,10.1109/cvpr52688.2022.01195,How well do sparse ImageNet models transfer?
12780,10.1145/3528535.3565248,CGX: Adaptive system support for communication-efficient deep learning
10853,10.1145/3409964.3461810,A scalable concurrent algorithm for dynamic connectivity
10854,10.1145/3410220.3453923,Input-dynamic distributed algorithms for communication networks
10855,10.1145/3447384,Input-dynamic distributed algorithms for communication networks
11436,,Asynchronous optimization methods for efficient training of deep neural networks with guarantees
11452,,Distributed principal component analysis with limited communication
11458,,AC/DC: Alternating Compressed/DeCompressed training of deep neural networks
11463,,M-FAC: Efficient matrix-free approximations of second-order information
11464,,Towards tight communication lower bounds for distributed optimisation
7939,10.1007/s00446-020-00380-5,Fast approximate shortest paths in the congested clique
8286,10.1007/s00453-021-00905-9,Dynamic averaging load balancing on cycles
8723,10.1109/TPDS.2020.3040606,Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging