Deterministic PRAM approximate shortest paths in polylogarithmic time and slightly super-linear work

Michael Elkin, Shaked Matar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Fingerprint

Dive into the research topics of 'Deterministic PRAM approximate shortest paths in polylogarithmic time and slightly super-linear work'. Together they form a unique fingerprint.

Keyphrases

Computer Science

Mathematics