Fast on-line integer multiplication

DOI10.1145/800125.804037zbMath0306.68029OpenAlexW2075146792MaRDI QIDQ5966837

Michael J. Fischer, Larry J. Stockmeyer

Publication date: 1973

Published in: Proceedings of the fifth annual ACM symposium on Theory of computing - STOC '73 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/800125.804037

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Mathematical problems of computer architecture (68M07) Online algorithms; streaming algorithms (68W27)

Related Items (4)

Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model ⋮ Pattern matching in pseudo real-time ⋮ Two fast simulations which imply some fast string matching and palindrome-recognition algorithms ⋮ A black box for online approximate pattern matching

This page was built for publication: Fast on-line integer multiplication