aller au contenu
Introduction to algorithms Aperçu de cet ouvrage
FermerAperçu de cet ouvrage
Vérification...

Introduction to algorithms

Auteur : Thomas H Cormen
Éditeur: Cambridge, Mass. : MIT Press, ©2001.
Édition/format:   Livre imprimé : Anglais : 2nd edVoir toutes les éditions et tous les formats
Résumé:
The book covers a broad range of algorithms in depth, yet makes their design and analysis acessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or  Lire la suite...
Évaluation:

(pas encore évalué) 0 avec des critiques - Soyez le premier.

Sujets
Plus comme ceci

Trouver un exemplaire dans la bibliothèque

&AllPage.SpinnerRetrieving; Recherche de bibliothèques qui possèdent cet ouvrage...

Détails

Genre/forme: Einführung
Type de document: Livre
Tous les auteurs / collaborateurs: Thomas H Cormen
ISBN: 0262032937 9780262032933 0070131511 9780070131514 0262531968 9780262531962
Numéro OCLC: 46792720
Notes: Revised edition of: Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. c1990.
Description: xxi, 1180 pages ; 24 cm
Contenu: The role of algorithms in computing --
Getting started --
Growth of functions --
Recurrences --
Probabilistic analysis and randomized algortihms --
Heapsort --
Quicksort --
Sorting in linear time --
Medians and order statistics --
Elementary data structures --
Hash Tables --
Binary Search trees --
Red-black trees --
Augmenting data structures --
Dynamic programming --
Greedy Algorithms --
Amortized analysis --
B-trees --
Binomial heaps --
Fibonacci heaps --
Data structures for disjoint sets --
Elementary graph algorithms --
Minimum spanning trees --
Single-source shortest paths --
All-pairs shortest paths --
Maximum flow --
Sorting networks --
Matrix operations--
Linear programming --
Polynomials and the FFT --
Number-theoretic algortihsm --
String matching--
Computational geometry --
NP-completeness --
approximation algorithms --
A. summations --
B. Sets, etc. --
C. Counting and probability.
Autres titres: Algorithms
Responsabilité: Thomas H. Cormen [and others].

Résumé:

The book covers a broad range of algorithms in depth, yet makes their design and analysis acessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.

Critiques

Critiques d’utilisateurs
Récupération des critiques de GoodReads...
Récuperation des critiques DOGObooks…

Marqueurs

Tous les marqueurs des utilisateurs (5)

Voir les marqueurs les plus utilisés sous forme de: liste de marqueurs | nuage de marqueurs

Ouvrages semblables

Sujet(s):(9)

Listes d’utilisateurs dans lesquelles cet ouvrage apparaît (10)

Confirmez cette demande

Vous avez peut-être déjà demandé cet ouvrage. Veuillez sélectionner OK si vous voulez poursuivre avec cette demande quand même.

Données liées


Primary Entity

<http://www.worldcat.org/oclc/46792720> # Introduction to algorithms
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "46792720" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/mau> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/6419620#Place/cambridge_mass> ; # Cambridge, Mass.
    rdfs:seeAlso <http://experiment.worldcat.org/entity/work/data/6419620#CreativeWork/introduction_to_algorithms> ; # Introduction to algorithms.
    schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/algorithmentheorie> ; # Algorithmentheorie
    schema:about <http://id.worldcat.org/fast/872390> ; # Computer programming
    schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/informatik> ; # Informatik
    schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/algorithmes> ; # Algorithmes
    schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/algorithmus> ; # Algorithmus
    schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/programming> ; # Programming
    schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/programmation_informatique> ; # Programmation (Informatique)
    schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/theoretische_informatik> ; # Theoretische Informatik
    schema:about <http://dewey.info/class/005.1/e21/> ;
    schema:about <http://id.worldcat.org/fast/872010> ; # Computer algorithms
    schema:alternateName "Algorithms" ;
    schema:bookEdition "2nd ed." ;
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/93446737> ; # Thomas H. Cormen
    schema:copyrightYear "2001" ;
    schema:datePublished "2001" ;
    schema:description "The role of algorithms in computing -- Getting started -- Growth of functions -- Recurrences -- Probabilistic analysis and randomized algortihms -- Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- Elementary data structures -- Hash Tables -- Binary Search trees -- Red-black trees -- Augmenting data structures -- Dynamic programming -- Greedy Algorithms -- Amortized analysis -- B-trees -- Binomial heaps -- Fibonacci heaps -- Data structures for disjoint sets -- Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximum flow -- Sorting networks -- Matrix operations-- Linear programming -- Polynomials and the FFT -- Number-theoretic algortihsm -- String matching-- Computational geometry -- NP-completeness -- approximation algorithms -- A. summations -- B. Sets, etc. -- C. Counting and probability."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/6419620> ;
    schema:genre "Einführung"@en ;
    schema:inLanguage "en" ;
    schema:name "Introduction to algorithms"@en ;
    schema:productID "46792720" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/46792720#PublicationEvent/cambridge_mass_mit_press_2001> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/6419620#Agent/mit_press> ; # MIT Press
    schema:workExample <http://worldcat.org/isbn/9780262531962> ;
    schema:workExample <http://worldcat.org/isbn/9780262032933> ;
    schema:workExample <http://worldcat.org/isbn/9780070131514> ;
    umbel:isLike <http://bnb.data.bl.uk/id/resource/GBA152709> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/46792720> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/6419620#CreativeWork/introduction_to_algorithms> # Introduction to algorithms.
    a schema:CreativeWork ;
    schema:creator <http://viaf.org/viaf/93446737> ; # Thomas H. Cormen
    schema:name "Introduction to algorithms." ;
    .

<http://experiment.worldcat.org/entity/work/data/6419620#Place/cambridge_mass> # Cambridge, Mass.
    a schema:Place ;
    schema:name "Cambridge, Mass." ;
    .

<http://experiment.worldcat.org/entity/work/data/6419620#Topic/algorithmentheorie> # Algorithmentheorie
    a schema:Intangible ;
    schema:name "Algorithmentheorie"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/6419620#Topic/algorithmes> # Algorithmes
    a schema:Intangible ;
    schema:name "Algorithmes"@en ;
    schema:name "Algorithmes"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/6419620#Topic/programmation_informatique> # Programmation (Informatique)
    a schema:Intangible ;
    schema:name "Programmation (Informatique)"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/6419620#Topic/theoretische_informatik> # Theoretische Informatik
    a schema:Intangible ;
    schema:name "Theoretische Informatik"@en ;
    .

<http://id.worldcat.org/fast/872010> # Computer algorithms
    a schema:Intangible ;
    schema:name "Computer algorithms"@en ;
    .

<http://id.worldcat.org/fast/872390> # Computer programming
    a schema:Intangible ;
    schema:name "Computer programming"@en ;
    .

<http://viaf.org/viaf/93446737> # Thomas H. Cormen
    a schema:Person ;
    schema:familyName "Cormen" ;
    schema:givenName "Thomas H." ;
    schema:name "Thomas H. Cormen" ;
    .

<http://worldcat.org/isbn/9780070131514>
    a schema:ProductModel ;
    schema:isbn "0070131511" ;
    schema:isbn "9780070131514" ;
    .

<http://worldcat.org/isbn/9780262032933>
    a schema:ProductModel ;
    schema:isbn "0262032937" ;
    schema:isbn "9780262032933" ;
    .

<http://worldcat.org/isbn/9780262531962>
    a schema:ProductModel ;
    schema:isbn "0262531968" ;
    schema:isbn "9780262531962" ;
    .


Content-negotiable representations

Fermer la fenêtre

Veuillez vous identifier dans WorldCat 

Vous n’avez pas de compte? Vous pouvez facilement créer un compte gratuit.