References
Akra, M., and L. Bazzi, On the solution of linear recurrence equations. Computational Optimization and Applications 10 (1998), 195–210.
Appel, K., and W. Haken, Every planar map is four colorable. Bulletin of the American Mathematical Society 82 (1976), 711–712.
Appel, K., and W. Haken, The solution of the four-color-map problem. Scientific American 237 (1977), 108–121.
Apt, K. R., Ten years of Hoare’s logic: A survey—Part 1. ACM Transactions on Programming Languages and Systems 3 (1981), 431–483.
Backus, J., Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. Communications of the ACM 21 (1978), 613–641.
Bates, G. E., Probability. Addison-Wesley, Reading, MA, 1965.
Bondy, J. A. ...
Get Discrete Structures, Logic, and Computability, 4th Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
