Skip to:Content
|
Bottom
Cover image for Discrete mathematics for computer scientists
Title:
Discrete mathematics for computer scientists
Personal Author:
Edition:
New ed.
Publication Information:
Boston, Mass. : Pearson/Addison-Wesley, c2011
Physical Description:
xxviii, 495 p. : ill. ; 23 cm.
ISBN:
9780131377103

9780132122719

Available:*

Library
Item Barcode
Call Number
Material Type
Item Category 1
Status
Searching...
30000010275173 QA76.9.M35 S74 2011 Open Access Book Book
Searching...
Searching...
30000010316188 QA76.9.M35 S74 2011 Open Access Book Gift Book
Searching...

On Order

Summary

Summary

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.


Author Notes

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.


Table of Contents

The Product Principlep. 4
1.2 Counting Lists, Pe
1.3 Binomial Coefficients
A Proof Using the Sum Principlep. 24
The Binomial Theoremp. 26
What Is a relation?p. 32
Go to:Top of Page