A programmer's companion to algorithm analysis:
This book details the transition from the design and analysis of an algorithm to the resulting software program. Consisting of two main parts, the book emphasizes the concrete aspects of translating an algorithm into software that should perform based on what the algorithm analysis indicated. In the...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boca Raton [u.a.]
Chapman & Hall/CRC
2007
|
| Schlagworte: | |
| Online-Zugang: | Publisher description |
| Zusammenfassung: | This book details the transition from the design and analysis of an algorithm to the resulting software program. Consisting of two main parts, the book emphasizes the concrete aspects of translating an algorithm into software that should perform based on what the algorithm analysis indicated. In the first part, the author describes the idealized universe that algorithm designers inhabit while the second part outlines how this ideal can be adapted to the real world of programming. The book explores analysis techniques, including crossover points, the influence of the memory hierarchy, implications of programming language aspects, such as recursion, and problems arising from excessively high computational complexities of solution methods. It concludes with four appendices that discuss basic algorithms; memory hierarchy, virtual memory management, optimizing compilers, and garbage collection; NP-completeness and higher complexity classes; and undecidability in practical terms. Applying the theory of algorithms to the production of software, this book fulfills the needs of software programmers and developers as well as students by showing that with the correct algorithm, you can achieve a functional software program. |
| Beschreibung: | Includes bibliographical references and index |
| Beschreibung: | 255 S. |
| ISBN: | 1584886730 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV022189789 | ||
| 003 | DE-604 | ||
| 005 | 20071204 | ||
| 007 | t | ||
| 008 | 061212s2007 xxu |||| 00||| eng d | ||
| 010 | |a 2006044552 | ||
| 020 | |a 1584886730 |c acidfree paper |9 1-584-88673-0 | ||
| 035 | |a (OCoLC)65644760 | ||
| 035 | |a (DE-599)BVBBV022189789 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-703 | ||
| 050 | 0 | |a QA402.5 | |
| 082 | 0 | |a 005.1 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Leiss, Ernst L. |d 1952- |e Verfasser |0 (DE-588)121112292 |4 aut | |
| 245 | 1 | 0 | |a A programmer's companion to algorithm analysis |c Ernst L. Leiss |
| 264 | 1 | |a Boca Raton [u.a.] |b Chapman & Hall/CRC |c 2007 | |
| 300 | |a 255 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Includes bibliographical references and index | ||
| 520 | 3 | |a This book details the transition from the design and analysis of an algorithm to the resulting software program. Consisting of two main parts, the book emphasizes the concrete aspects of translating an algorithm into software that should perform based on what the algorithm analysis indicated. In the first part, the author describes the idealized universe that algorithm designers inhabit while the second part outlines how this ideal can be adapted to the real world of programming. The book explores analysis techniques, including crossover points, the influence of the memory hierarchy, implications of programming language aspects, such as recursion, and problems arising from excessively high computational complexities of solution methods. It concludes with four appendices that discuss basic algorithms; memory hierarchy, virtual memory management, optimizing compilers, and garbage collection; NP-completeness and higher complexity classes; and undecidability in practical terms. Applying the theory of algorithms to the production of software, this book fulfills the needs of software programmers and developers as well as students by showing that with the correct algorithm, you can achieve a functional software program. | |
| 650 | 4 | |a Algoritmos - Procesamiento electrónico de datos | |
| 650 | 4 | |a Programación (Matemáticas) | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Programming (Mathematics) | |
| 650 | 4 | |a Algorithms |x Data processing | |
| 650 | 0 | 7 | |a Programmanalyse |0 (DE-588)4175841-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Programmanalyse |0 (DE-588)4175841-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | |u http://www.loc.gov/catdir/enhancements/fy0654/2006044552-d.html |3 Publisher description | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015215317 | ||
Datensatz im Suchindex
| _version_ | 1804135976146042880 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Leiss, Ernst L. 1952- |
| author_GND | (DE-588)121112292 |
| author_facet | Leiss, Ernst L. 1952- |
| author_role | aut |
| author_sort | Leiss, Ernst L. 1952- |
| author_variant | e l l el ell |
| building | Verbundindex |
| bvnumber | BV022189789 |
| callnumber-first | Q - Science |
| callnumber-label | QA402 |
| callnumber-raw | QA402.5 |
| callnumber-search | QA402.5 |
| callnumber-sort | QA 3402.5 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 134 |
| ctrlnum | (OCoLC)65644760 (DE-599)BVBBV022189789 |
| 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 |
| discipline_str_mv | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02684nam a2200445zc 4500</leader><controlfield tag="001">BV022189789</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20071204 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">061212s2007 xxu |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2006044552</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1584886730</subfield><subfield code="c">acidfree paper</subfield><subfield code="9">1-584-88673-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)65644760</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022189789</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA402.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</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="100" ind1="1" ind2=" "><subfield code="a">Leiss, Ernst L.</subfield><subfield code="d">1952-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121112292</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A programmer's companion to algorithm analysis</subfield><subfield code="c">Ernst L. Leiss</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boca Raton [u.a.]</subfield><subfield code="b">Chapman & Hall/CRC</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">255 S.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This book details the transition from the design and analysis of an algorithm to the resulting software program. Consisting of two main parts, the book emphasizes the concrete aspects of translating an algorithm into software that should perform based on what the algorithm analysis indicated. In the first part, the author describes the idealized universe that algorithm designers inhabit while the second part outlines how this ideal can be adapted to the real world of programming. The book explores analysis techniques, including crossover points, the influence of the memory hierarchy, implications of programming language aspects, such as recursion, and problems arising from excessively high computational complexities of solution methods. It concludes with four appendices that discuss basic algorithms; memory hierarchy, virtual memory management, optimizing compilers, and garbage collection; NP-completeness and higher complexity classes; and undecidability in practical terms. Applying the theory of algorithms to the production of software, this book fulfills the needs of software programmers and developers as well as students by showing that with the correct algorithm, you can achieve a functional software program.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algoritmos - Procesamiento electrónico de datos</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programación (Matemáticas)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming (Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmanalyse</subfield><subfield code="0">(DE-588)4175841-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Programmanalyse</subfield><subfield code="0">(DE-588)4175841-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0654/2006044552-d.html</subfield><subfield code="3">Publisher description</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015215317</subfield></datafield></record></collection> |
| id | DE-604.BV022189789 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:11:29Z |
| indexdate | 2024-07-09T20:49:03Z |
| institution | BVB |
| isbn | 1584886730 |
| language | English |
| lccn | 2006044552 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015215317 |
| oclc_num | 65644760 |
| open_access_boolean | |
| owner | DE-703 |
| owner_facet | DE-703 |
| physical | 255 S. |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | Chapman & Hall/CRC |
| record_format | marc |
| spelling | Leiss, Ernst L. 1952- Verfasser (DE-588)121112292 aut A programmer's companion to algorithm analysis Ernst L. Leiss Boca Raton [u.a.] Chapman & Hall/CRC 2007 255 S. txt rdacontent n rdamedia nc rdacarrier Includes bibliographical references and index This book details the transition from the design and analysis of an algorithm to the resulting software program. Consisting of two main parts, the book emphasizes the concrete aspects of translating an algorithm into software that should perform based on what the algorithm analysis indicated. In the first part, the author describes the idealized universe that algorithm designers inhabit while the second part outlines how this ideal can be adapted to the real world of programming. The book explores analysis techniques, including crossover points, the influence of the memory hierarchy, implications of programming language aspects, such as recursion, and problems arising from excessively high computational complexities of solution methods. It concludes with four appendices that discuss basic algorithms; memory hierarchy, virtual memory management, optimizing compilers, and garbage collection; NP-completeness and higher complexity classes; and undecidability in practical terms. Applying the theory of algorithms to the production of software, this book fulfills the needs of software programmers and developers as well as students by showing that with the correct algorithm, you can achieve a functional software program. Algoritmos - Procesamiento electrónico de datos Programación (Matemáticas) Datenverarbeitung Programming (Mathematics) Algorithms Data processing Programmanalyse (DE-588)4175841-9 gnd rswk-swf Programmanalyse (DE-588)4175841-9 s DE-604 http://www.loc.gov/catdir/enhancements/fy0654/2006044552-d.html Publisher description |
| spellingShingle | Leiss, Ernst L. 1952- A programmer's companion to algorithm analysis Algoritmos - Procesamiento electrónico de datos Programación (Matemáticas) Datenverarbeitung Programming (Mathematics) Algorithms Data processing Programmanalyse (DE-588)4175841-9 gnd |
| subject_GND | (DE-588)4175841-9 |
| title | A programmer's companion to algorithm analysis |
| title_auth | A programmer's companion to algorithm analysis |
| title_exact_search | A programmer's companion to algorithm analysis |
| title_exact_search_txtP | A programmer's companion to algorithm analysis |
| title_full | A programmer's companion to algorithm analysis Ernst L. Leiss |
| title_fullStr | A programmer's companion to algorithm analysis Ernst L. Leiss |
| title_full_unstemmed | A programmer's companion to algorithm analysis Ernst L. Leiss |
| title_short | A programmer's companion to algorithm analysis |
| title_sort | a programmer s companion to algorithm analysis |
| topic | Algoritmos - Procesamiento electrónico de datos Programación (Matemáticas) Datenverarbeitung Programming (Mathematics) Algorithms Data processing Programmanalyse (DE-588)4175841-9 gnd |
| topic_facet | Algoritmos - Procesamiento electrónico de datos Programación (Matemáticas) Datenverarbeitung Programming (Mathematics) Algorithms Data processing Programmanalyse |
| url | http://www.loc.gov/catdir/enhancements/fy0654/2006044552-d.html |
| work_keys_str_mv | AT leissernstl aprogrammerscompaniontoalgorithmanalysis |