Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Efficient massively parallel methods for dynamic programming

From MaRDI portal
Publication:4978024
Jump to:navigation, search

DOI10.1145/3055399.3055460zbMath1370.68316OpenAlexW2626928698MaRDI QIDQ4978024

Xiaorui Sun, Benjamin Moseley, Sungjin Im

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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


zbMATH Keywords

dynamic programmingmassively parallel computing


Mathematics Subject Classification ID

Dynamic programming (90C39) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)


Related Items (2)

Equivalence classes and conditional hardness in massively parallel computations ⋮ Unnamed Item







This page was built for publication: Efficient massively parallel methods for dynamic programming

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4978024&oldid=19426002"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 09:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki