An \(O(\log N)\) algorithm to solve linear recurrences on hypercubes

DOI10.1016/0020-0190(94)90106-6zbMath0803.68003MaRDI QIDQ1321823

Ernst L. Leiss, Hari N. Reddy

Publication date: 3 May 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90106-6

zbMATH Keywords

hypercube; linear recurrences; parallel algorithms; interconnection networks; parallel processing

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68M10: Network design and communication in computer systems

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68M07: Mathematical problems of computer architecture

68W15: Distributed algorithms

Cites Work

• Unnamed Item
• Parallel Computers 2