1  14
2. Introduction to algorithms [2022]
 Cormen, Thomas H., author.
 Fourth edition  Cambridge, Massachusetts : The MIT Press, [2022]
 Description
 Book — xx, 1291 pages : illustrations (some color) ; 24 cm
 Summary

 Foundations
 Sorting and order statistics
 Data structures
 Advanced design and analysis techniques
 Advanced data structures
 Graph algorithms
 Selected topics
 Appendix. Mathematical background
 Online
Engineering Library (Terman)
Engineering Library (Terman)  Status 

Stacks  
QA76.6 .I5858 2022  Inlibrary use 
3. Algorithms unlocked [2013]
 Cormen, Thomas H., author.
 Cambridge, Massachusetts : The MIT Press, [2013]
 Description
 Book — 1 online resource (xiii, 222 pages) : illustrations
 Summary

 Preface
 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
 Bibliography
 Index.
(source: Nielsen Book Data)
4. Algorithms unlocked [2013]
 Cormen, Thomas H., author.
 Cambridge, Massachusetts : The MIT Press, [2013]
 Description
 Book — 1 online resource (xiii, 222 pages) : illustrations
 Summary

For anyone who has ever wondered how computers solve problems, an engagingly written guide for nonexperts to the basics of computer algorithms. Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone? This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormencoauthor of the leading college textbook on the subjectprovides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems. Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simple ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order ("sorting"); how to solve basic problems that can be modeled in a computer with a mathematical structure called a "graph" (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time.
(source: Nielsen Book Data)
5. Algorithms unlocked [2013]
 Cormen, Thomas H., author.
 Cambridge, Massachusetts : The MIT Press, [2013]
 Description
 Book — 1 online resource (xiii, 222 pages) : illustrations
 Summary

 Preface
 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
 Bibliography
 Index.
(source: Nielsen Book Data)
6. Algorithms unlocked [2013]
 Cormen, Thomas H., author.
 Cambridge, Massachusetts : The MIT Press, [2013]
 Description
 Book — 1 online resource (xiii, 222 pages) : illustrations
 Summary

 Preface
 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
 Bibliography
 Index.
(source: Nielsen Book Data)
7. Algorithms unlocked [2013]
 Cormen, Thomas H., author.
 Cambridge, Massachusetts : MIT Press, c2013 [Piscataqay, New Jersey] : IEEE Xplore, [2013]
 Description
 Book — 1 online resource (xiii, 222 pages) : illustrations
 Summary

Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone? This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormen  coauthor of the leading college textbook on the subject  provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems. Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simple ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order ("sorting"); how to solve basic problems that can be modeled in a computer with a mathematical structure called a "graph" (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time.
(source: Nielsen Book Data)
 Cormen, Thomas H.
 Hampton, VA : Institute for Computer Applications in Science and Engineering, NASA Langley Research Center ; [Springfield, Va. : National Technical Information Service, distributor, 1996]
 Description
 Book — 1 v.
 Online
Green Library
Green Library  Status 

Find it US Federal Documents  
NAS 1.26:201627  Unknown 
9. Virtual memory for dataparallel computing [1993  1992]
 Cormen, Thomas H.
 Cambridge, Mass. : Laboratory for Computer Science, Massachusetts Institute of Technology, 1993,c1992.
 Description
 Book — 180 p. : ill. ; 28 cm.
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
135087  Available 
10. Introduction to algorithms [2009]
 3rd ed.  Cambridge, Mass. : MIT Press, c2009.
 Description
 Book — xix, 1292 p. : ill. ; 24 cm.
 Summary

A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edgebased flow. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively selfcontained 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 first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called "DivideandConquer"), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edgebased flow in the material on flow networks. Many new exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.
(source: Nielsen Book Data)
 Online
Engineering Library (Terman)
Engineering Library (Terman)  Status 

Permanent reserve: Ask at circulation desk  
QA76.6 .I5858 2009  Unknown 
11. Introduction to algorithms [2001]
 2nd ed.  Cambridge, Mass. : MIT Press, c2001.
 Description
 Book — xxi, 1180 p. cm.
 Summary

This title covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively selfcontained 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. This second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.
(source: Nielsen Book Data)
 Online
Engineering Library (Terman)
Engineering Library (Terman)  Status 

Stacks  
QA76.6 .I5858 2001  Unknown 
QA76.6 .I5858 2001  Unknown 
 Description
 Book
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
132594  Available 
13. Introduction to algorithms [1990]
 Cambridge, Mass. : MIT Press ; New York : McGrawHill, c1990.
 Description
 Book — xvii, 1028 p. : ill. ; 26 cm.
 Online
Engineering Library (Terman), SAL3 (offcampus storage)
Engineering Library (Terman)  Status 

Stacks  
QA76.6 .I5858 1990  Unknown 
QA76.6 .I5858 1990  Unknown 
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA76.6 .I5858 1990  Available 
14. Introduction to algorithms [2009]
 Third edition.  Cambridge, Mass. : MIT Press, [2009]
 Description
 Book — 1 online resource.
 Summary

 I. Foundations. The role of algorithms in computing
 Getting started
 Growth of functions
 Divideandconquer
 Probabilistic analysis and randomized algorithms
 II. Sorting and order statistics. Heapsort
 Quicksort
 Sorting in linear time
 Medians and order statistics
 III. Data structures. Elementary data structures
 Hash tables
 Binary search trees
 Redblack trees
 Augmenting data structures
 IV. Advanced design and analysis techniques. Dynamic programming
 Greedy algorithms
 Amortized analysis
 V. Advanced data structures. Btrees
 Fibonacci heaps
 van Emde Boas trees
 Data structures for disjoint sets
 VI. Graph algorithms. Elementary graph algorithms
 Minimum spanning trees
 Singlesource shortest paths
 Allpairs shortest paths
 Maximun flow
 VII. Selected topics. Multithreaded algorithms
 Matrix operations
 Linear programming
 Polynomials and the FFT
 Numbertheoretic algorithms
 String matching
 Computational geometry
 NPcompleteness
 Approximation algorithms
 VIII. Appendix: Mathematical background. Summations
 Sets, etc.
 Counting and probability
 Matrices.
(source: Nielsen Book Data)
Articles+
Journal articles, ebooks, & other eresources
Guides
Course and topicbased guides to collections, tools, and services.