00869nam a2200241 i 450099100381204970753620020509132604.0970419s1956 ne ||| | ger b11218642-39ule_instPARLA189089ExLDip.to Filol. Class. e Med.ita880Jacoby, Felix162803Navicula Chilonensis :Studia Philologa Felici Jacoby professori chilonensi emerito octogenario oblataLeiden :Brill,1956X, 215 p. ;24 cm.Scritti in onore.b1121864221-09-0601-07-02991003812049707536LE007 M 361012007000012420le007-E0.00-l- 00000.i1137216301-07-02Navicula Chilonensis867750UNISALENTOle00701-01-97ma -gerne 0101492nam a22004095i 4500991002251139707536cr nn 008mamaa121227s1995 de | s |||| 0|eng db14144724-39ule_instBibl. Dip.le Aggr. Matematica e Fisica - Sez. Matematicaeng51523AMS 34C35AMS 34C37AMS 34E15 AMS 35B40AMS 35K55AMS 36Q30AMS 54H20AMS 58F12AMS 60H10Arnold, Ludwig344417Dynamical systems[e-book] :lectures given at the 2nd session of the Centro Internazionale Matematico Estivo (C.I.M.E.) held in Montecatini Terme, Italy, june 13 - 22, 1994 /by Ludwig Arnold ... [et al.] ; edited by Russell JohnsonBerlin :Springer,19951 online resource (vii, 336 p.)Lecture Notes in Mathematics,0075-8434 ;1609MathematicsGlobal analysis (Mathematics)Systems theoryMathematical optimizationJohnson, RussellSpringer eBookshttp://dx.doi.org/10.1007/BFb0095237An electronic book accessible through the World Wide Web.b1414472403-03-2205-09-13991002251139707536Dynamical systems262419UNISALENTOle01305-09-13m@ -engde 0004716nam 2200541 a 450 991026062220332120241120174749.0978026231323002623132359781299284272129928427297802623132230262313227(CaBNVSL)mat06482302(IDAMS)0b00006481d03dcf(IEEE)6482302(MiAaPQ)EBC3339585(PPN)181441217(CKB)2560000000099628(FR-PaCSA)88841784(FRCYB88841784)88841784(EXLCZ)99256000000009962820121206d2013 uy 0engur|n|||||||||rdacontentisbdmediardacarrierAlgorithms unlocked /Thomas H. Cormen1st ed.Cambridge, Mass. MIT Press20131 PDF (xiii, 222 pages) illustrations9780262518802 0262518805 Includes bibliographical references and index.Intro -- Contents -- Preface -- 1 What Are Algorithms and Why Should You Care? -- Correctness -- Resource usage -- Computer algorithms for non-computer people -- Computer algorithms for computer people -- Further reading -- 2 How to Describe and Evaluate Computer Algorithms -- How to describe computer algorithms -- How to characterize running times -- Loop invariants -- Recursion -- Further reading -- 3 Algorithms for Sorting and Searching -- Binary search -- Selection sort -- Insertion sort -- Merge sort -- Quicksort -- Recap -- Further reading -- 4 A Lower Bound for Sorting and How to Beat It -- Rules for sorting -- The lower bound on comparison sorting -- Beating the lower bound with counting sort -- Radix sort -- Further reading -- 5 Directed Acyclic Graphs -- Directed acyclic graphs -- Topological sorting -- How to represent a directed graph -- Running time of topological sorting -- Critical path in a PERT chart -- Shortest path in a directed acyclic graph -- Further reading -- 6 Shortest Paths -- Dijkstra's algorithm -- The Bellman-Ford algorithm -- The Floyd-Warshall algorithm -- Further reading -- 7 Algorithms on Strings -- Longest common subsequence -- Transforming one string to another -- String matching -- Further reading -- 8 Foundations of Cryptography -- Simple substitution ciphers -- Symmetric-key cryptography -- Public-key cryptography -- The RSA cryptosystem -- Hybrid cryptosystems -- Computing random numbers -- Further reading -- 9 Data Compression -- Huffman codes -- Fax machines -- LZW compression -- Further reading -- 10 Hard? Problems -- Brown trucks -- The classes P and NP and NP-completeness -- Decision problems and reductions -- A Mother Problem -- A sampler of NP-complete problems -- General strategies -- Perspective -- Undecidable problems -- Wrap-up -- Further reading -- Bibliography -- Index.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.Computer algorithmsComputer algorithms.005.1Cormen Thomas H9698MiAaPQMiAaPQMiAaPQBOOK9910260622203321Algorithms unlocked2670326UNINA