Narrow your search

Library

UAntwerpen (4)

KU Leuven (3)

ULiège (3)

UCLouvain (2)

UGent (2)

UHasselt (2)

ULB (2)

Hogeschool Gent (1)

KBR (1)

Royal Belgian Institute for Natural Sciences (1)

More...

Resource type

book (4)


Language

English (4)


Year
From To Submit

2022 (1)

2001 (1)

1999 (1)

1986 (1)

Listing 1 - 4 of 4
Sort by
Advanced research in VLSI
Author:
ISBN: 0262121131 Year: 1986 Publisher: Cambridge (Mass.) MIT press

Introduction to algorithms
Authors: --- ---
ISBN: 0262032937 0070131511 9780262032933 9780070131514 0262531968 9780262531962 Year: 2001 Publisher: Cambridge, Mass. MIT

Introduction to algorithms
Authors: --- ---
ISBN: 0262031418 0070131430 0262530910 9780262031417 9780262530910 Year: 1999 Publisher: Cambridge, Mass. MIT


Book
Introduction to algorithms
Authors: --- --- ---
ISBN: 9780262046305 026204630X 0262367505 9780262367509 9780262367516 Year: 2022 Publisher: Cambridge, Mass. The MIT Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

"The leading introductory textbook and reference on algorithms"-- "A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout, with new chapters on matchings in bipartite graphs, online algorithms, and machine learning, and new material on such topics as solving recurrence equations, hash tables, potential functions, and suffix arrays. Each chapter is relatively self-contained, presenting an algorithm, a design technique, an application area, or a related topic, 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. The fourth edition has 140 new exercises and 22 new problems, and color has been added to improve visual presentations. The writing has been revised throughout, and made clearer, more personal, and gender neutral. The book's website offers supplemental material. Warning: Avoid counterfeit copies of Introduction to Algorithms by buying only from reputable retailers. Counterfeit and pirated copies are incomplete and contain errors." -- Publisher's description.

Listing 1 - 4 of 4
Sort by