ACM Symposium on Theory of Computing, STOC 2016


Article Details
Title: Deterministic decremental single source shortest paths: beyond the o(mn) bound
Article URLs:
Alternative Article URLs:
Authors: Aaron Bernstein
  • Columbia University
Shiri Chechik
  • Tel-Aviv University
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/BernsteinC16
Author Comments:

Discuss this paper and its artifacts below