Minimizing Processor Count for Fault Tolerant Toom-Cook Algorithms
Open Access
- 16 July 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 514-524
Abstract
No abstract availableFunding Information
- European Research Council (ERC) under the European Union?s Horizon 2020 research and innovation programme (818252,101113120, 101138056)
- Universitas Brawijaya (1354/23, 514/20)
- Science Accelerator
- Frontiers in Science initiative of the Ministry of Innovation, Science and Technology
- Len Blavatnik and the Blavatnik Family foundation
This publication has 63 references indexed in Scilit:
- Fast NEON-Based Multiplication for Lattice-Based NIST Post-quantum Cryptography Finalists2021
- Fault tolerant communication-optimal 2.5D matrix multiplicationJournal of Parallel and Distributed Computing, 2017
- Benefits and Drawbacks of Redundant Batch RequestsJournal of Grid Computing, 2007
- Communication lower bounds for distributed-memory matrix multiplicationJournal of Parallel and Distributed Computing, 2004
- A bandwidth latency tradeoff for broadcast and reductionInformation Processing Letters, 2003
- Memory-Efficient Matrix Multiplication in the BSP ModelAlgorithmica, 1999
- SUMMA: scalable universal matrix multiplication algorithmConcurrency: Practice and Experience, 1997
- Fast probabilistic algorithms1979
- Probabilistic algorithms for sparse polynomials1979
- On the minimum computation time of functionsTransactions of the American Mathematical Society, 1969