Algorithms unlocked:
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge, Massachusetts
The MIT Press
[2013]
|
| Subjects: | |
| Item Description: | Print version record |
| Physical Description: | 1 online resource (xiii, 222 pages) illustrations |
| ISBN: | 9780262313223 0262313227 9780262313230 0262313235 9781299284272 1299284272 |
Staff View
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV045349968 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 181210s2013 |||| o||u| ||||||eng d | ||
| 020 | |a 9780262313223 |9 978-0-262-31322-3 | ||
| 020 | |a 0262313227 |9 0-262-31322-7 | ||
| 020 | |a 9780262313230 |9 978-0-262-31323-0 | ||
| 020 | |a 0262313235 |9 0-262-31323-5 | ||
| 020 | |a 9781299284272 |9 978-1-299-28427-2 | ||
| 020 | |a 1299284272 |9 1-299-28427-2 | ||
| 035 | |a (ZDB-4-ITC)ocn830323683 | ||
| 035 | |a (OCoLC)830323683 | ||
| 035 | |a (DE-599)BVBBV045349968 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 005.1 |2 23 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
| 100 | 1 | |a Cormen, Thomas H. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithms unlocked |c Thomas H. Cormen |
| 264 | 1 | |a Cambridge, Massachusetts |b The MIT Press |c [2013] | |
| 264 | 4 | |c 2013 | |
| 300 | |a 1 online resource (xiii, 222 pages) |b illustrations | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Print version record | ||
| 505 | 8 | |a "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 simples 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; the 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."--Back cover | |
| 650 | 4 | |a Algorithmes | |
| 650 | 7 | |a COMPUTERS / Programming / Open Source |2 bisacsh | |
| 650 | 7 | |a COMPUTERS / Software Development & Engineering / General |2 bisacsh | |
| 650 | 7 | |a COMPUTERS / Software Development & Engineering / Tools |2 bisacsh | |
| 650 | 7 | |a Computer algorithms |2 fast | |
| 650 | 7 | |a Algorithmus |2 gnd | |
| 650 | 7 | |a Programm |2 gnd | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4151278-9 |a Einführung |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |8 2\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Cormen, Thomas H. |t Algorithms Unlocked |d Cambridge, Massachusetts : The MIT Press, [2013] |z 9780262518802 |
| 912 | |a ZDB-4-ITC | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030736622 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Record in the Search Index
| _version_ | 1804179174262308864 |
|---|---|
| any_adam_object | |
| author | Cormen, Thomas H. |
| author_facet | Cormen, Thomas H. |
| author_role | aut |
| author_sort | Cormen, Thomas H. |
| author_variant | t h c th thc |
| building | Verbundindex |
| bvnumber | BV045349968 |
| classification_rvk | ST 134 ST 230 |
| collection | ZDB-4-ITC |
| contents | "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 simples 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; the 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."--Back cover |
| ctrlnum | (ZDB-4-ITC)ocn830323683 (OCoLC)830323683 (DE-599)BVBBV045349968 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03198nmm a2200577zc 4500</leader><controlfield tag="001">BV045349968</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">181210s2013 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262313223</subfield><subfield code="9">978-0-262-31322-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262313227</subfield><subfield code="9">0-262-31322-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262313230</subfield><subfield code="9">978-0-262-31323-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262313235</subfield><subfield code="9">0-262-31323-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781299284272</subfield><subfield code="9">978-1-299-28427-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1299284272</subfield><subfield code="9">1-299-28427-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-4-ITC)ocn830323683</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)830323683</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045349968</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cormen, Thomas H.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms unlocked</subfield><subfield code="c">Thomas H. Cormen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Massachusetts</subfield><subfield code="b">The MIT Press</subfield><subfield code="c">[2013]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiii, 222 pages)</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Print version record</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">"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 simples 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; the 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."--Back cover</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Programming / Open Source</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Software Development & Engineering / General</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Software Development & Engineering / Tools</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programm</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4151278-9</subfield><subfield code="a">Einführung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Cormen, Thomas H.</subfield><subfield code="t">Algorithms Unlocked</subfield><subfield code="d">Cambridge, Massachusetts : The MIT Press, [2013]</subfield><subfield code="z">9780262518802</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-ITC</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030736622</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4151278-9 Einführung gnd-content |
| genre_facet | Einführung |
| id | DE-604.BV045349968 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T08:15:40Z |
| institution | BVB |
| isbn | 9780262313223 0262313227 9780262313230 0262313235 9781299284272 1299284272 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030736622 |
| oclc_num | 830323683 |
| open_access_boolean | |
| physical | 1 online resource (xiii, 222 pages) illustrations |
| psigel | ZDB-4-ITC |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | The MIT Press |
| record_format | marc |
| spelling | Cormen, Thomas H. Verfasser aut Algorithms unlocked Thomas H. Cormen Cambridge, Massachusetts The MIT Press [2013] 2013 1 online resource (xiii, 222 pages) illustrations txt rdacontent c rdamedia cr rdacarrier Print version record "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 simples 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; the 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."--Back cover Algorithmes COMPUTERS / Programming / Open Source bisacsh COMPUTERS / Software Development & Engineering / General bisacsh COMPUTERS / Software Development & Engineering / Tools bisacsh Computer algorithms fast Algorithmus gnd Programm gnd Computer algorithms Algorithmus (DE-588)4001183-5 gnd rswk-swf 1\p (DE-588)4151278-9 Einführung gnd-content Algorithmus (DE-588)4001183-5 s 2\p DE-604 Erscheint auch als Druck-Ausgabe Cormen, Thomas H. Algorithms Unlocked Cambridge, Massachusetts : The MIT Press, [2013] 9780262518802 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Cormen, Thomas H. Algorithms unlocked "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 simples 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; the 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."--Back cover Algorithmes COMPUTERS / Programming / Open Source bisacsh COMPUTERS / Software Development & Engineering / General bisacsh COMPUTERS / Software Development & Engineering / Tools bisacsh Computer algorithms fast Algorithmus gnd Programm gnd Computer algorithms Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4151278-9 |
| title | Algorithms unlocked |
| title_auth | Algorithms unlocked |
| title_exact_search | Algorithms unlocked |
| title_full | Algorithms unlocked Thomas H. Cormen |
| title_fullStr | Algorithms unlocked Thomas H. Cormen |
| title_full_unstemmed | Algorithms unlocked Thomas H. Cormen |
| title_short | Algorithms unlocked |
| title_sort | algorithms unlocked |
| topic | Algorithmes COMPUTERS / Programming / Open Source bisacsh COMPUTERS / Software Development & Engineering / General bisacsh COMPUTERS / Software Development & Engineering / Tools bisacsh Computer algorithms fast Algorithmus gnd Programm gnd Computer algorithms Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithmes COMPUTERS / Programming / Open Source COMPUTERS / Software Development & Engineering / General COMPUTERS / Software Development & Engineering / Tools Computer algorithms Algorithmus Programm Einführung |
| work_keys_str_mv | AT cormenthomash algorithmsunlocked |