Basic concepts in algorithms:
"This book is the result of several decades of teaching experience in data structures and algorithms. It is self-contained but does assume some prior knowledge of data structures, and a grasp of basic programming and mathematics tools. Basic Concepts in Algorithms focuses on more advanced parad...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
New Jersey ; London ; Singapore ; Beijing ; Shanghai ; Hong Kong ; Taipei ; Chennai ; Tokyo
World Scientific
[2021]
|
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Zusammenfassung: | "This book is the result of several decades of teaching experience in data structures and algorithms. It is self-contained but does assume some prior knowledge of data structures, and a grasp of basic programming and mathematics tools. Basic Concepts in Algorithms focuses on more advanced paradigms and methods combining basic programming constructs as building blocks and their usefulness in the derivation of algorithms. Its coverage includes the algorithms' design process and an analysis of their performance. It is primarily intended as a textbook for the teaching of Algorithms for second-year undergraduate students in study fields related to computers and programming. Klein reproduces his oral teaching style in writing, with one topic leading to another, related one. Most of the classical and some more advanced subjects in the theory of algorithms are covered, though not in a comprehensive manner. The topics include Divide and Conquer, Dynamic Programming, Graph algorithms, probabilistic algorithms, data compression, numerical algorithms and intractability. Each chapter comes with its own set of exercises, and solutions to most of them are appended"-- |
Beschreibung: | Includes bibliographical references and index |
Beschreibung: | xix, 343 Seiten Illustrationen, Diagramme, Karten |
ISBN: | 9789811237584 9789811238529 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV048453863 | ||
003 | DE-604 | ||
005 | 20221017 | ||
007 | t | ||
008 | 220905s2021 xxua||| |||| 00||| eng d | ||
020 | |a 9789811237584 |q hardcover |9 978-981-123-758-4 | ||
020 | |a 9789811238529 |q paperback |9 978-981-123-852-9 | ||
035 | |a (OCoLC)1349548611 | ||
035 | |a (DE-599)KXP1756102279 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
044 | |a xxu |c XD-US |a xxk |c XA-GB |a si |c XB-SG |a cc |c XB-CN |a cc |c XB-HK |a cc |c XB-TW |a ii |c XB-IN |a ja |c XB-JP | ||
049 | |a DE-703 | ||
082 | 0 | |a 518/.1 | |
084 | |a 31.76 |2 bkl | ||
084 | |a 54.10 |2 bkl | ||
100 | 1 | |a Klein, Shmuel Tomi |e Verfasser |0 (DE-588)1136612874 |4 aut | |
245 | 1 | 0 | |a Basic concepts in algorithms |c Shmuel Tomi Klein (Bar Ilan University, Israel) |
264 | 1 | |a New Jersey ; London ; Singapore ; Beijing ; Shanghai ; Hong Kong ; Taipei ; Chennai ; Tokyo |b World Scientific |c [2021] | |
300 | |a xix, 343 Seiten |b Illustrationen, Diagramme, Karten | ||
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 is the result of several decades of teaching experience in data structures and algorithms. It is self-contained but does assume some prior knowledge of data structures, and a grasp of basic programming and mathematics tools. Basic Concepts in Algorithms focuses on more advanced paradigms and methods combining basic programming constructs as building blocks and their usefulness in the derivation of algorithms. Its coverage includes the algorithms' design process and an analysis of their performance. It is primarily intended as a textbook for the teaching of Algorithms for second-year undergraduate students in study fields related to computers and programming. Klein reproduces his oral teaching style in writing, with one topic leading to another, related one. Most of the classical and some more advanced subjects in the theory of algorithms are covered, though not in a comprehensive manner. The topics include Divide and Conquer, Dynamic Programming, Graph algorithms, probabilistic algorithms, data compression, numerical algorithms and intractability. Each chapter comes with its own set of exercises, and solutions to most of them are appended"-- | |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
653 | 0 | |a Algorithms | |
689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-981-123-759-1 |
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-981-123-760-7 |
856 | 4 | 2 | |m B:DE-89 |m V:DE-601 |q pdf/application |u https://www.gbv.de/dms/tib-ub-hannover/1756102279.pdf |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-033831975 |
Datensatz im Suchindex
_version_ | 1804184387933175808 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Klein, Shmuel Tomi |
author_GND | (DE-588)1136612874 |
author_facet | Klein, Shmuel Tomi |
author_role | aut |
author_sort | Klein, Shmuel Tomi |
author_variant | s t k st stk |
building | Verbundindex |
bvnumber | BV048453863 |
ctrlnum | (OCoLC)1349548611 (DE-599)KXP1756102279 |
dewey-full | 518/.1 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 518 - Numerical analysis |
dewey-raw | 518/.1 |
dewey-search | 518/.1 |
dewey-sort | 3518 11 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
discipline_str_mv | Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02802nam a2200421 c 4500</leader><controlfield tag="001">BV048453863</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20221017 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">220905s2021 xxua||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789811237584</subfield><subfield code="q">hardcover</subfield><subfield code="9">978-981-123-758-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789811238529</subfield><subfield code="q">paperback</subfield><subfield code="9">978-981-123-852-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1349548611</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP1756102279</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="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">XD-US</subfield><subfield code="a">xxk</subfield><subfield code="c">XA-GB</subfield><subfield code="a">si</subfield><subfield code="c">XB-SG</subfield><subfield code="a">cc</subfield><subfield code="c">XB-CN</subfield><subfield code="a">cc</subfield><subfield code="c">XB-HK</subfield><subfield code="a">cc</subfield><subfield code="c">XB-TW</subfield><subfield code="a">ii</subfield><subfield code="c">XB-IN</subfield><subfield code="a">ja</subfield><subfield code="c">XB-JP</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518/.1</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.76</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.10</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Klein, Shmuel Tomi</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1136612874</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Basic concepts in algorithms</subfield><subfield code="c">Shmuel Tomi Klein (Bar Ilan University, Israel)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New Jersey ; London ; Singapore ; Beijing ; Shanghai ; Hong Kong ; Taipei ; Chennai ; Tokyo</subfield><subfield code="b">World Scientific</subfield><subfield code="c">[2021]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xix, 343 Seiten</subfield><subfield code="b">Illustrationen, Diagramme, Karten</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 is the result of several decades of teaching experience in data structures and algorithms. It is self-contained but does assume some prior knowledge of data structures, and a grasp of basic programming and mathematics tools. Basic Concepts in Algorithms focuses on more advanced paradigms and methods combining basic programming constructs as building blocks and their usefulness in the derivation of algorithms. Its coverage includes the algorithms' design process and an analysis of their performance. It is primarily intended as a textbook for the teaching of Algorithms for second-year undergraduate students in study fields related to computers and programming. Klein reproduces his oral teaching style in writing, with one topic leading to another, related one. Most of the classical and some more advanced subjects in the theory of algorithms are covered, though not in a comprehensive manner. The topics include Divide and Conquer, Dynamic Programming, Graph algorithms, probabilistic algorithms, data compression, numerical algorithms and intractability. Each chapter comes with its own set of exercises, and solutions to most of them are appended"--</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="653" ind1=" " ind2="0"><subfield code="a">Algorithms</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="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-981-123-759-1</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-981-123-760-7</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">B:DE-89</subfield><subfield code="m">V:DE-601</subfield><subfield code="q">pdf/application</subfield><subfield code="u">https://www.gbv.de/dms/tib-ub-hannover/1756102279.pdf</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-033831975</subfield></datafield></record></collection> |
id | DE-604.BV048453863 |
illustrated | Illustrated |
index_date | 2024-07-03T20:31:45Z |
indexdate | 2024-07-10T09:38:32Z |
institution | BVB |
isbn | 9789811237584 9789811238529 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-033831975 |
oclc_num | 1349548611 |
open_access_boolean | |
owner | DE-703 |
owner_facet | DE-703 |
physical | xix, 343 Seiten Illustrationen, Diagramme, Karten |
publishDate | 2021 |
publishDateSearch | 2021 |
publishDateSort | 2021 |
publisher | World Scientific |
record_format | marc |
spelling | Klein, Shmuel Tomi Verfasser (DE-588)1136612874 aut Basic concepts in algorithms Shmuel Tomi Klein (Bar Ilan University, Israel) New Jersey ; London ; Singapore ; Beijing ; Shanghai ; Hong Kong ; Taipei ; Chennai ; Tokyo World Scientific [2021] xix, 343 Seiten Illustrationen, Diagramme, Karten txt rdacontent n rdamedia nc rdacarrier Includes bibliographical references and index "This book is the result of several decades of teaching experience in data structures and algorithms. It is self-contained but does assume some prior knowledge of data structures, and a grasp of basic programming and mathematics tools. Basic Concepts in Algorithms focuses on more advanced paradigms and methods combining basic programming constructs as building blocks and their usefulness in the derivation of algorithms. Its coverage includes the algorithms' design process and an analysis of their performance. It is primarily intended as a textbook for the teaching of Algorithms for second-year undergraduate students in study fields related to computers and programming. Klein reproduces his oral teaching style in writing, with one topic leading to another, related one. Most of the classical and some more advanced subjects in the theory of algorithms are covered, though not in a comprehensive manner. The topics include Divide and Conquer, Dynamic Programming, Graph algorithms, probabilistic algorithms, data compression, numerical algorithms and intractability. Each chapter comes with its own set of exercises, and solutions to most of them are appended"-- Algorithmus (DE-588)4001183-5 gnd rswk-swf Algorithms Algorithmus (DE-588)4001183-5 s DE-604 Erscheint auch als Online-Ausgabe 978-981-123-759-1 Erscheint auch als Online-Ausgabe 978-981-123-760-7 B:DE-89 V:DE-601 pdf/application https://www.gbv.de/dms/tib-ub-hannover/1756102279.pdf Inhaltsverzeichnis |
spellingShingle | Klein, Shmuel Tomi Basic concepts in algorithms Algorithmus (DE-588)4001183-5 gnd |
subject_GND | (DE-588)4001183-5 |
title | Basic concepts in algorithms |
title_auth | Basic concepts in algorithms |
title_exact_search | Basic concepts in algorithms |
title_exact_search_txtP | Basic concepts in algorithms |
title_full | Basic concepts in algorithms Shmuel Tomi Klein (Bar Ilan University, Israel) |
title_fullStr | Basic concepts in algorithms Shmuel Tomi Klein (Bar Ilan University, Israel) |
title_full_unstemmed | Basic concepts in algorithms Shmuel Tomi Klein (Bar Ilan University, Israel) |
title_short | Basic concepts in algorithms |
title_sort | basic concepts in algorithms |
topic | Algorithmus (DE-588)4001183-5 gnd |
topic_facet | Algorithmus |
url | https://www.gbv.de/dms/tib-ub-hannover/1756102279.pdf |
work_keys_str_mv | AT kleinshmueltomi basicconceptsinalgorithms |