Please note, this offer price only applies to individual customers when ordering direct from Oxford University Press, while stock lasts. No further discounts will apply. If you are a bookseller, please contact your OUP sales representative.
Readership: Students and teachers of algorithm courses, puzzle enthusiasts, and anyone wishing to learn more about how to solve puzzles and/or develop algorithmic thinking
Anany Levitin, Professor of Computing Sciences, Department of Computing Sciences, Villanova University, and Maria Levitin, Software Developer, (independent consultant)
Anany Levitin is a professor of Computing Sciences at Villanova University. He is the author of a popular textbook on design and analysis of algorithms, which has been translated into Chinese, Greek, Korean, and Russian. He has also published papers on mathematical optimization theory, software engineering, data management, algorithm design techniques, and computer science education.
Maria Levitin is an independent consultant specializing in web applications and data compression. She has previously worked for several leading software companies.
"Indeed, I would say that this is a book that any mathematical puzzle enthusiast ought to consider buying." - Martin Griffiths, The Mathematical Gazette
List of Puzzles
Main Section Puzzles
General Strategies for Algorithm Design
Easier Puzzles (#1 - #50)
Medium Dic culty Puzzles (51 - 110)
Harder Puzzles (#111 - 150)
Design Strategy and Analysis Index
Index of Terms and Names