Baihan Lin, Guillermo Cecchi, et al.
IJCAI 2023
For any fixed dimension d, thelinear programming problem with ninequality constraints can be solved on a probabilistic CRCW PRAM withO1994processors almost surely in constant time. The algorithm always findsthe correct solution. Withnd/log2dprocessors, the probability that the algorithm will not finish withinO(d2log2dtime tends to zero exponentially withn. © 1994, ACM. All rights reserved.
Baihan Lin, Guillermo Cecchi, et al.
IJCAI 2023
Paula Harder, Venkatesh Ramesh, et al.
EGU 2023
Fearghal O'Donncha, Albert Akhriev, et al.
Big Data 2021
Amy Lin, Sujit Roy, et al.
AGU 2024