Using induction to design algorithms
Manber, Udi
1988-11-01 00:00:00
An analogy between proving mathematical theorems and designing computer algorithms provides an elegant methodology for designing algorithms, explaining their behavior, and understanding their key ideas.
http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.pngCommunications of the ACMAssociation for Computing Machineryhttp://www.deepdyve.com/lp/association-for-computing-machinery/using-induction-to-design-algorithms-skRi3MIvMN
An analogy between proving mathematical theorems and designing computer algorithms provides an elegant methodology for designing algorithms, explaining their behavior, and understanding their key ideas.
Journal
Communications of the ACM
– Association for Computing Machinery
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.