ACM Transactions on Programming Languages and Systems (TOPLAS)
Computational geometry: an introduction
Computational geometry: an introduction
Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Algorithm design: a recursion transformation framework
Algorithm design: a recursion transformation framework
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Multidimensional divide-and-conquer
Communications of the ACM
Server-Side Programming Techniques
Server-Side Programming Techniques
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
The Science of Programming
A Discipline of Programming
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Application programming as the construction of language interpreters
ACM SIGPLAN Notices
From specific problem instances to algorithms in the introductory course
SIGCSE '94 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education
Loop invariants and mathematical games
SIGCSE '95 Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education
How to design dynamic programming algorithms sans recursion
ACM SIGACT News
What (else) should CS educators know?
Communications of the ACM
Discrete mathematics as a precursor to programming
SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
| Hi-index | 48.23 |
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.