Cristina Cornelio, Judy Goldsmith, et al.
JAIR
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.
Cristina Cornelio, Judy Goldsmith, et al.
JAIR
Anurag Ajay, Seungwook Han, et al.
NeurIPS 2023
Daniel Karl I. Weidele, Hendrik Strobelt, et al.
SysML 2019
Sashi Novitasari, Takashi Fukuda, et al.
INTERSPEECH 2025