Parallel computational algorithms for generalized Chinese remainder theorem.
From MaRDI portal
Publication:1427328
DOI10.1016/S0045-7906(03)00013-2zbMath1062.68063MaRDI QIDQ1427328
Publication date: 14 March 2004
Published in: Computers and Electrical Engineering (Search for Journal in Brave)
Euclidean algorithm; Parallel computation; Chinese remainder theorem; Butterfly network; Residue number system
68W30: Symbolic computation and algebraic computation
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68W10: Parallel algorithms in computer science