DOI,IST REx ID,Research Group,Title of publication
10.1145/3558481.3591082,13262,"DaAl,GradSch",Provably-efficient and internally-deterministic parallel Union-Find
10.1145/3503221.3508432,11180,DaAl,Multi-queues can be state-of-the-art priority schedulers
10.5281/ZENODO.5733408,13076,DaAl,Multi-queues can be state-of-the-art priority schedulers
10.4230/LIPIcs.DISC.2021.4,10217,DaAl,Lower bounds for shared-memory leader election under bounded write contention
10.15479/at:ista:10429,10429,"GradSch,DaAl",On achieving scalability through relaxation
null,10432,DaAl,Elastic consistency: A practical consistency model for distributed stochastic gradient descent
null,10435,DaAl,Asynchronous decentralized SGD with quantized and local updates
10.1007/s00453-021-00905-9,8286,DaAl,Dynamic averaging load balancing on cycles
10.1109/TPDS.2020.3040606,8723,DaAl,Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging
10.4230/LIPIcs.ICALP.2020.7,15077,DaAl,Dynamic averaging load balancing on cycles
10.1145/3323165.3323201,6673,DaAl,Efficiency guarantees for parallel incremental algorithms under relaxed schedulers
10.1145/3087801.3087810,791,DaAl,The power of choice in priority scheduling