Exponentially Faster Shortest Paths in the Congested Clique

From MaRDI portal

Revision as of 06:06, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5889790

Jump to:navigation, search

DOI10.1145/3527213OpenAlexW3009187765MaRDI QIDQ5889790

Michal Dory, Merav Parter

Publication date: 27 April 2023

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3527213

zbMATH Keywords

shortest paths congested clique near-additive emulator

Mathematics Subject Classification ID

Computer science (68-XX)

This page was built for publication: Exponentially Faster Shortest Paths in the Congested Clique

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5889790&oldid=30760640"