Contributor biographical information for How to think about algorithms : loop invariants and recursion / Jeff Edmonds.


Bibliographic record and links to related information available from the Library of Congress catalog


Biographical text provided by the publisher (may be incomplete or contain other coding). The Library of Congress makes no claims as to the accuracy of the information provided, and will not maintain or otherwise edit/update the information supplied by the publisher.


Counter
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.


Library of Congress subject headings for this publication:
Algorithms -- Study and teaching.
Loops (Group theory) -- Study and teaching.
Invariants -- Study and teaching.
Recursion theory -- Study and teaching.