Algorithms - A Creative Approach - Grand Format

Edition en anglais

Udi Manber

Note moyenne 
Udi Manber - Algorithms - A Creative Approach.
This book emphasizes the creative aspects of algorithm design. It teaches the thinking behind the creation of algorithms. Algorithms are described by... Lire la suite
180,40 € Neuf
Expédié sous 2 à 4 semaines
Livré chez vous entre le 4 mai et le 21 mai
En librairie

Résumé

This book emphasizes the creative aspects of algorithm design. It teaches the thinking behind the creation of algorithms. Algorithms are described by following the steps leading to their development (sometimes including wrong steps). The heart of this creative process lies in an analogy between proving mathematical theorems by induction and designing combinatorial algorithms. The book contains hundreds of problems and examples.
It is designed to enhance the reader's problem-solving abilities and understanding of the principles behind algorithm design. HIGHLIGHTS : Current, up-to-date coverage of algorithms. Covers many known techniques for designing algorithms, and unifies many of them. Contains over 500 mostly nonroutine exercises. and gives solutions to about a quarter of them. Discusses implementation details separately from algorithm design ideas.
Covers parallel algorithms. Includes pseudocode examples for most algorithms. The design of efficient non-numerical algorithms is becoming an important tool in many fields including mathematics, statistics, biology, and engineering. This book, which is self-contained, can serve as an introduction to algorithms and non-numeric computation.

Caractéristiques

  • Date de parution
    11/01/1989
  • Editeur
  • Collection
  • ISBN
    0-201-12037-2
  • EAN
    9780201120370
  • Format
    Grand Format
  • Présentation
    Broché
  • Nb. de pages
    478 pages
  • Poids
    0.675 Kg
  • Dimensions
    15,2 cm × 23,1 cm × 2,4 cm

Avis libraires et clients

Avis audio

Écoutez ce qu'en disent nos libraires !

À propos de l'auteur

Biographie d'Udi Manber

Udi Manber has been an associate professor of computer science at the University of Arizona since 1987. He received his Ph. D. in computer science from the University of Washington in 1982. He was an assistant professor and later an associate professor at the University of Wisconsin, Madison. His research areas include design of algorithms, distributed and parallel computing, and computer networks.
He received the prestigious Presidential Young Investigator Award in 1985. and the Best Paper Award of the seventh International Conference on Distributed Computing Systems, 1987.

Les clients ont également aimé

Derniers produits consultés

180,40 €