skip to content
Algorithms unlocked Preview this item
ClosePreview this item
Checking...

Algorithms unlocked

Author: Thomas H Cormen
Publisher: Cambridge, Massachusetts : The MIT Press, [2013]
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Thomas H Cormen
ISBN: 9780262518802 0262518805
OCLC Number: 813540952
Description: xiii, 222 pages : illustrations ; 23 cm
Contents: What are algorithms and why should you care? --
How to describe and evaluate computer algorithms --
Algorithms for sorting and searching --
A lower bound for sorting and how to beat it --
Directed acyclic graphs --
Shortest paths --
Algorithms on strings --
Foundations of cryptography --
Data compression --
Hard? Problems.
Responsibility: Thomas H. Cormen.

Reviews

Editorial reviews

Publisher Synopsis

"Algorithms are at the center of computer science. This is a unique book in its attempt to open the field of algorithms to a wider audience. It provides an easy-to-read introduction to an abstract Read more...

 
User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(2)

User lists with this item (6)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/813540952>
library:oclcnum"813540952"
library:placeOfPublication
owl:sameAs<info:oclcnum/813540952>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:creator
schema:datePublished"2013"
schema:description"What are algorithms and why should you care? -- How to describe and evaluate computer algorithms -- Algorithms for sorting and searching -- A lower bound for sorting and how to beat it -- Directed acyclic graphs -- Shortest paths -- Algorithms on strings -- Foundations of cryptography -- Data compression -- Hard? Problems."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1337771363>
schema:inLanguage"en"
schema:name"Algorithms unlocked"@en
schema:url
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.