Presents constant-time CRCW PRAM algorithms for acyclic queries, semijoin algebra queries, and worst-case optimal joins that achieve work O(T^{1+ε}) for any ε>0 relative to optimal sequential time T.
Cook, Cynthia Dwork, and R \" u diger Reischuk
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
LTBs-KAN delivers linear-time B-spline evaluation in KANs plus parameter reduction via product-of-sums factorization, with competitive results on MNIST, Fashion-MNIST, and CIFAR-10.
citing papers explorer
-
Work-Efficient Query Evaluation in Constant Time with PRAMs
Presents constant-time CRCW PRAM algorithms for acyclic queries, semijoin algebra queries, and worst-case optimal joins that achieve work O(T^{1+ε}) for any ε>0 relative to optimal sequential time T.
-
LTBs-KAN: Linear-Time B-splines Kolmogorov-Arnold Networks
LTBs-KAN delivers linear-time B-spline evaluation in KANs plus parameter reduction via product-of-sums factorization, with competitive results on MNIST, Fashion-MNIST, and CIFAR-10.