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