Fast approximate shortest paths in the congested clique

Keren Censor Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf. Fast approximate shortest paths in the congested clique. Distributed Computing, 34(6):463-487, 2021. [doi]

Authors

Keren Censor Hillel

This author has not been identified. Look up 'Keren Censor Hillel' in Google

Michal Dory

This author has not been identified. Look up 'Michal Dory' in Google

Janne H. Korhonen

This author has not been identified. Look up 'Janne H. Korhonen' in Google

Dean Leitersdorf

This author has not been identified. Look up 'Dean Leitersdorf' in Google