Handbook of Discrete and Combinatorial Mathematics | Agenda Bookshop Skip to content
Age Group_Uncategorized
Age Group_Uncategorized
Alfred J. Menezes
automatic-update
AVL Tree
B01=Kenneth H. Rosen
BCH Code
Binary Search Tree
Binary Tree
Category1=Non-Fiction
Category=PBD
Category=PBV
Category=PBW
Category=UMB
Category=UY
Category=UYA
Charles C. Y. Lam
chromatic
connected
Connected Graph
Convolutional Codes
COP=United States
curve
Cyclic Code
David Joyner
Delivery_Delivery within 10-20 working days
Douglas R. Shier
ECC
elliptic
eq_computing
eq_isMigrated=2
eq_non-fiction
Finite Poset
function
Graded Poset
graph
hash
Hasse Diagram
John G. Michaels
Language_English
Las Vegas Algorithm
Linear Code
Linked List
number
PA=Available
Parity Check Matrix
Paul C. van Oorschot
PDA
Price_€100 and above
Primitive Recursive
PS=Active
ramsey
Re
Received Word
Reed Muller Code
Reed Solomon Codes
RS Code
Single Linkage Algorithm
softlaunch
Spanning Tree
TM
Tony Shaska
vertex
Wayne Goddard
Product Image

Handbook of Discrete and Combinatorial Mathematics

★★★★★
★★★★★

English

Handbook of Discrete and Combinatorial Mathematics provides a comprehensive reference volume for mathematicians, computer scientists, engineers, as well as students and reference librarians.

The material is presented so that key information can be located and used quickly and easily. Each chapter includes a glossary. Individual topics are covered in sections and subsections within chapters, each of which is organized into clearly identifiable parts: definitions, facts, and examples.

Examples are provided to illustrate some of the key definitions, facts, and algorithms. Some curious and entertaining facts and puzzles are also included. Readers will also find an extensive collection of biographies.

This second edition is a major revision. It includes extensive additions and updates. Since the first edition appeared in 1999, many new discoveries have been made and new areas have grown in importance, which are covered in this edition.

See more
€285.20
Age Group_UncategorizedAlfred J. Menezesautomatic-updateAVL TreeB01=Kenneth H. RosenBCH CodeBinary Search TreeBinary TreeCategory1=Non-FictionCategory=PBDCategory=PBVCategory=PBWCategory=UMBCategory=UYCategory=UYACharles C. Y. LamchromaticconnectedConnected GraphConvolutional CodesCOP=United StatescurveCyclic CodeDavid JoynerDelivery_Delivery within 10-20 working daysDouglas R. ShierECCellipticeq_computingeq_isMigrated=2eq_non-fictionFinite PosetfunctionGraded PosetgraphhashHasse DiagramJohn G. MichaelsLanguage_EnglishLas Vegas AlgorithmLinear CodeLinked ListnumberPA=AvailableParity Check MatrixPaul C. van OorschotPDAPrice_€100 and abovePrimitive RecursivePS=ActiveramseyReReceived WordReed Muller CodeReed Solomon CodesRS CodeSingle Linkage AlgorithmsoftlaunchSpanning TreeTMTony ShaskavertexWayne Goddard

Will deliver when available.

Product Details
  • Weight: 2698g
  • Dimensions: 178 x 254mm
  • Publication Date: 01 Dec 2017
  • Publisher: Taylor & Francis Inc
  • Publication City/Country: US
  • Language: English
  • ISBN13: 9781584887805

About

Kenneth H. Rosen holds a B.S. from the Univ. of Michigan and a PhD from MIT. Rosen has published many research papers on number theory and mathematical modeling. He is the author of Discrete Mathematics and its Applications, 8th ed, used extensively worldwide, a leading number theory text, and several books on UNIX. He has held positions at four universities and continues to teach. Rosen spent 22 years at AT&T Bell Labs, as a distinguished member of the technical staff. At Bell Labs he worked on a wide range of projects relating to computing and telecommunications, which led to 70 patents.He is an associate editor of the journal Discrete Mathematics.

Douglas R. Shier is Emeritus Professor in the Department of Mathematical Sciences, Clemson University. His research has been in mathematical and statistical modeling, algorithm development, and networks. He has served as Associate Editor for several journals in Operations Research and is currently Editor-in-Chief of the international journal Networks. He has published over 100 articles, appearing in journals in the areas of environmental and health sciences, operations research, statistics, and computer science. He has authored the books Network Reliability and Algebraic Structures and Puzzles, Paradoxes, and Problem Solving; as well he has co-edited the volumes Applied Mathematical Modeling and the first edition of the CRC Handbook of Discrete and Applied Mathematics.

Wayne Goddard is from Durban, South Africa and completed his graduate studies at the University of Natal and the Massachusetts Institute of Technology. He currently teaches at Clemson University with a joint appointment in the School of Computing and the Department of Mathematical Sciences. He has published over a hundred papers in multiple areas of graph theory and combinatorics, but also has research interests in distibuted algorithms and game-playing. He is author of the textbooks Introducing the Theory of Computation and Research Methodology: An Introduction, and serves as managing editor of the journal Discrete Mathematics.

Customer Reviews

Be the first to write a review
0%
(0)
0%
(0)
0%
(0)
0%
(0)
0%
(0)
We use cookies to ensure that we give you the best experience on our website. If you continue we'll assume that you are understand this. Learn more
Accept