Applications of Combinatorial Mathematics by Chris Mitchell

Applications of Combinatorial Mathematics

EditorChris Mitchell

Hardcover | January 1, 1997

not yet rated|write a review

Pricing and Purchase Info

$461.42 online 
$517.50
Earn 2307 plum® points

In stock online

Ships free on orders over $25

Not available in stores

about

In the last thirty years, combinatorial mathematics has found itself at the heart of many technological applications. The aims of the conference on which this book is based were to stimulate combinatorial mathematicians to pursue new lines of research of potential practical importance, and touncover the breadth of applications of the subject. Topics covered include neural networks, cryptography, radio frequency assignment for mobile telecommunications, coding theory, sequences for communications applications, interconnection networks, data types, knot theory, radar, parallelprocessing, network reliability, formal specification of programs and protocols, and combinatorial optimisation.

About The Author

Professor C Mitchell, Department of Computer Science, Royal Holloway, University of London, Egham Hill, Surrey, TW20 0EX Address for correspondence (temporary): Molenstraat 3C, B-1560 Hoeilaart, Belgium, tel: + 32 2 657 5905
The Breaking Bad Cookbook
The Breaking Bad Cookbook

by Chris Mitchell

$16.48$23.95

In stock online

Not available in stores

The Ghost of Our Beliefs
The Ghost of Our Beliefs

by Chris J Mitchell

$0.00

Available for download

Not available in stores

Shop this author

Details & Specs

Title:Applications of Combinatorial MathematicsFormat:HardcoverDimensions:252 pages, 9.21 × 6.14 × 0.79 inPublished:January 1, 1997Publisher:Oxford University Press

The following ISBNs are associated with this title:

ISBN - 10:0198511922

ISBN - 13:9780198511922

Look for similar items by category:

Customer Reviews of Applications of Combinatorial Mathematics

Reviews

Extra Content

Table of Contents

M. D. Atkinson and D. Tulley: The Combinatorics of some Abstract Data TypesJ. R. Bainbridge and R. W. Whitty: Recent Results in the Theory or Program FlowgraphsS. R. Blackburn and F. Piper: Applications of Combinatorics to SecurityM. G. Everett and S. P. Borgatti: The Regular Coloration of GraphsS. W. Golomb: The Use of Combinatorial Structures in Communication Signal DesignC. Z. W. Hassell Sweatman, G. J. Gibson, and B. Mulgrew: A Constructive Algorithm for Neural Network Design with Application to Channel EqualizationS. Hoggar and K. Pickavance: The Weight Distribution of K M CodesA. E. D. Houston: Densities of Perfect Linear Complexity Profile Binary SequencesP. Jeavons, D. Cohen, and M. Cooper: When Constraints are Easy to SatisfyR. A. Leese: A Unified Approach to Problems in Radio Channel AssignmentK. G. Paterson: Interconnection Networks Based on Two-dimensional de Bruijn GraphsA. D. Pengelly and D. C. Ince: A Graph Theoretic Solution to the Interface EquationD. H. Smith: Uniformly Optimally Reliable Networks for Vertex FailuresS. Shepherd: Multi-Function Coding and Modulation for Spread Spectrum and CDMA with Inherent SecurityV. A. Strusevich: Multi-Stage Scheduling Problems with Precedence ConstraintsD. A. Youngs: Frequency Assignment for Cellular Radio Networks