ACM Symposium on Theory of Computing, STOC 2016


Article Details
Title: A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
Article URLs:
Alternative Article URLs:
Authors: Monika Henzinger
  • University of Vienna, Faculty of Computer Science
Sebastian Krinninger
  • Max Planck Institute for Informatics
Danupon Nanongkai
  • KTH Royal Institute of Technology
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/HenzingerKN16
Author Comments:

Discuss this paper and its artifacts below