How to Think About Algorithms Hardback - Hardcover

Edmonds

Hardcover

ISBN 10: 0521849314 ISBN 13: 9780521849319

Verlag: Cambridge University Press, 2008

Inhaltsangabe

Gives insights, notations, and analogies to help students describe and think about algorithms like an expert, without grinding through lots of formal proof. Solutions to many problems are included to let students test their progress, while class-tested PowerPoint slides are on the web to help course instructors.

Über diesen Titel

Críticas

'Reading this is like sitting at the feet of the master: it leads an apprentice from knowing how to program to understanding deep principles of algorithms.' Harold Thimbleby, The Times Higher Education Supplement

'... a great book to learn how to design and create new algorithms ... a good book that the reader will appreciate in the first and subsequent reads, and it will make better developers and programmers.' Journal of Functional Programming

Biografía del autor

Jeff Edmonds received his Ph.D. in 1992 at University of Toronto in theoretical computer science. His thesis proved that certain computation problems require a given amount of time and space. He did his postdoctorate work at the ICSI in Berkeley on secure multi-media data transmission and in 1995 became an Associate Professor in the Department of Computer Science at York University, Canada. He has taught their algorithms course thirteen times to date. He has worked extensively at IIT Mumbai, India, and University of California San Diego. He is well published in the top theoretical computer science journals in topics including complexity theory, scheduling, proof systems, probability theory, combinatorics, and, of course, algorithms.

Details zur Ausgabe

• Verlag: Cambridge University Press
• Erscheinungsdatum: 2008
• ISBN 10: 0521849314
• ISBN 13: 9780521849319
• Einband: Tapa dura
• Sprache: Englisch
• Auflage: 1
• Anzahl der Seiten: 472