DOI,IST REx ID,Research Group,Title of publication
10.4230/LIPICS.DISC.2019.29,6931,DaAl,Byzantine approximate agreement on graphs
10.1145/3293611.3331633,6933,DaAl,Fast approximate shortest paths in the congested clique
10.1145/3293611.3331581,6935,DaAl,Does preprocessing help under congestion?
10.1111/ecog.04444,6936,DaAl,What can observational data reveal about metacommunity processes?
10.1145/3339471,6972,DaAl,Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
10.1109/cdc.2018.8619625,7122,DaAl,Gradient compression for communication-limited convex optimization
10.1145/3295500.3356222,7201,DaAl,SparCML: High-performance sparse communication for machine learning
10.1186/s12859-019-3208-4,7214,DaAl,Recovering rearranged cancer chromosomes from karyotype graphs
10.1007/978-3-030-29400-7_23,7228,DaAl,Scalable FIFO channels for programming via communicating sequential processes
null,7542,DaAl,Powerset convolutional neural networks
null,7437,DaAl,Distributed learning over unreliable networks
10.1145/3288599.3288617,5947,DaAl,A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries
10.1007/s00446-017-0315-1,536,DaAl,Communication-efficient randomized consensus
10.1145/3212734.3212798,5961,DaAl,A brief tutorial on distributed and concurrent machine learning
10.1145/3212734.3212763,5962,DaAl,The convergence of stochastic gradient descent in asynchronous shared memory
10.1145/3212734.3212756,5963,DaAl,Relaxed schedulers can efficiently parallelize iterative algorithms
10.1145/3212734.3212785,5964,DaAl,Brief Announcement: Performance prediction for coarse-grained locking
10.1145/3210377.3210411,5965,DaAl,Distributionally linearizable data structures
10.1145/3210377.3210406,5966,DaAl,The transactional conflict problem
10.1145/3201897,6001,DaAl,ThreadScan: Automatic and scalable memory reclamation