Stein/Drysdale/Bogart's Discrete Mathematics for Computer Scientists is ideal for computer science students taking the discrete math course.
Written specifically for computer science students, this unique textbook directly addresses their needs by providing a foundation in discrete math while using motivating, relevant CS applications. This text takes an active-learning approach where activities are presented as exercises and the material is then fleshed out through explanations and extensions of the exercises.
"synopsis" may belong to another edition of this title.
Clifford Stein is a Professor of IEOR at Columbia University. He also holds an appointment in the Department of Computer Science. He is the director of Undergraduate Programs for the IEOR Department. Prior to joining Columbia, he spent 9 years as an Assistant and Associate Professor in the Dartmouth College Department of Computer Science.
His research interests include the design and analysis of algorithms, combinatorial optimization, operations research, network algorithms, scheduling, algorithm engineering and computational biology. Professor Stein has published many influential papers in the leading conferences and journals in his field, and has occupied a variety of editorial positions including the journals ACM Transactions on Algorithms, Mathematical Programming, Journal of Algorithms, SIAM Journal on Discrete Mathematics and Operations Research Letters. His work has been supported by the National Science Foundation and Sloan Foundation. He is the winner of several prestigious awards including an NSF Career Award, an Alfred Sloan Research Fellowship and the Karen Wetterhahn Award for Distinguished Creative or Scholarly Achievement. He is also the co-author of two textbooks: Discrete Math for Computer Science with Scot Drysdale and Introduction to Algorithms, with T. Cormen, C. Leiserson and R. Rivest—the best-selling textbook in algorithms, which has been translated into 8 languages.
(Robert L.) Scot Drysdale, III is a professor of Computer Science at Dartmouth College and served as Chair of the Computer Science department for eight years. His main research area is algorithms, primarily computational geometry. He is best known for papers describing algorithms for computing variants of a geometric structure called the Voronoi Diagram and algorithms that use the Voronoi Diagram to solve other problems in computational geometry. He has also developed algorithms for planning and testing the correctness of tool path movements in Numerical Control (NC) machining. His work has been supported by grants from the National Science Foundation and Ford Motor Company and he was awarded a Fulbright Fellowship.
He has also made contributions to education. He is a winner of the Dartmouth Distinguished Teaching award. He was a member of the development committee for the AP exam in computer science for four years during its transition from C++ to Java and then chaired the committee for three years. He has been Principal Lecturer for DIMACS and NSF workshops and was co-director of a DIMACS institute. He was a faculty member of the ACM/MAA Institute for Retraining in Computer Science for five years.From the Back Cover:
Discrete Mathematics for Computer Scientists provides computer science students the foundation they need in discrete mathematics. It gives thorough coverage to topics that have great importance to computer scientists and provides a motivating computer science example for each math topic, helping answer the age-old question, "Why do we have to learn this?"
Save money. Lighten your backpack. Access your textbooks anytime, from anywhere.
This title is available as an eTextbook from CourseSmart. Purchase your assigned textbook as a CourseSmart eTextbook, and stop lugging books around campus! You can also access CourseSmart eTextbooks from your iPhone.
Instructors, request your exam copies online and get instant access. Learn more at coursesmart.com.
"About this title" may belong to another edition of this title.
Book Description Addison-Wesley Longman, Incorporated. Book Condition: Brand New. Softcover, International Edition. This is an International Edition. Bookseller Inventory # 26796314A
Book Description Pearson Education (US), 2010. Paperback. Book Condition: New. book. Bookseller Inventory # 0131377108
Book Description Softcover. Book Condition: New. Paperback. Book Condition: INTERNATIONAL EDITION, brand New, International/Global Edition, NOT LOOSE LEAF VERSION,NO SOLUTION MANUAL, NO CD, NO ACCESS CARD, Soft Cover/ Paper Back written in English, Different ISBN and Cover Image from US Edition; Sometimes, the title is different from US Edition, and the exercises and homework problem are in different orders or maybe completely different than the US edition, Please email us for confirmation. Some books may show some word such as Not for Sale or Restricted in US on the cover page. However, it is absolutely legal to use in USA. Bookseller Inventory # 9780131377103
Book Description Pearson, Taiwan, 2011. Soft cover. Book Condition: Brand New. 1st Edition. 12mo - over 6¾ - 7¾" tall. International edition Brand New SOFT COVER expedite delivery. Bookseller Inventory # 001646
Book Description Pearson Education (US), 2010. Paperback. Book Condition: New. book. Bookseller Inventory # 131377108