by Jerome L. Paul (Author), Kenneth A. Berman (Author)
The objectives of this book are to provide a solid foundation for the theory of algorithms. The book is intended to serve as a text for a core upper division undergraduate course in the design and analysis of algorithms.
Author Biography
Kenneth A. Berman is Professor of Computer Science and Engineering in EECS at the University of Cincinnati. He published over 70 research papers and has taught both undergraduate and graduate courses in algorithms for many years.
Jerome L. Paul is Professor Emeritus of Computer Science and Engineering in EECS at the University of Cincinnati. He has published over 30 research papers and taught both undergraduate and graduate courses in algorithms for many years.
Number of Pages: 508
Dimensions: 1.02 x 9.25 x 7.52 IN
Publication Date: December 18, 2017