000			03734cam a2200337 i 4500
999			_c6959 _d6959
001			16107011
005			20200928122550.0
008			100225s2011 maua b 001 0 eng
010			_a 2010003760
020			_a9780131377103 (pbk.)
020			_a0131377108 (pbk.)
040			_aDLC _cDLC _dYDX _dYDXCP _dBWX _dUV0 _dDLC _dEG-NcFUE _erda
050	0	4	_aQA76.9.M35 _bB64 2011
082	0	0	_a004.0151 _222 _bS.C.D
100	1		_aStein, Clifford, _d1965-
245	1	0	_aDiscrete mathematics for computer scientists / _cClifford Stein, Robert L. Drysdale, Kenneth Bogart.
250			_aNew edition
260			_aBoston, Mass. : _bPearson/Addison-Wesley, _cc2011.
300			_a525 pages. : _billustration ; _c23 cm.
336			_2rdacontent _atext
337			_2rdamedia _aunmediated
338			_2rdacarrier _avolume
504			_aIncludes bibliographical references (p. 477-478) and index.
520			_aClifford 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.
650		0	_aComputer science _xMathematics.
700	1		_aDrysdale, Robert L., _d1951-
700	1		_aBogart, Kenneth P.
942			_cBK _2ddc