_id,title
13147,Communication-efficient distributed optimization with quantized preconditioners
9541,Graph sparsification for derandomizing massively parallel computation with low space
9543,New bounds for distributed mean estimation and variance reduction
9571,NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization
9620,Collecting coupons is faster with friends
9678,Efficient load-balancing through distributed token dropping
10049,"Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement"
10180,Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks
10216,Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds
10217,Lower bounds for shared-memory leader election under bounded write contention
10218,Brief announcement: Fast graphical population protocols
10219,Brief announcement: Sinkless orientation is hard also in the supported LOCAL model
10429,On achieving scalability through relaxation
10432,Elastic consistency: A practical consistency model for distributed stochastic gradient descent
10435,Asynchronous decentralized SGD with quantized and local updates
9823,"Wait-free approximate agreement on graphs"
9827,Concurrent linearizable nearest neighbour search in LockFree-kD-tree
9933,Component stability in low-space massively parallel computation
9935,"Improved deterministic (Δ+1) coloring in low-space MPC"
9951,Comparison dynamics in population protocols