國立高雄大學圖資館 |

Language: English

Back

Algorithms and data structuresfounda...

Knebl, Helmut.

Algorithms and data structuresfoundations and probabilistic methods for design and analysis /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Algorithms and data structuresby Helmut Knebl.
Reminder of title:	foundations and probabilistic methods for design and analysis /
Author:	Knebl, Helmut.
Published:	Cham :Springer International Publishing :2020.
Description:	xi, 349 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Computer algorithms.
Online resource:	https://doi.org/10.1007/978-3-030-59758-0
ISBN:	9783030597580$q(electronic bk.)

Algorithms and data structuresfoundations and probabilistic methods for design and analysis /
Knebl, Helmut.

Algorithms and data structuresfoundations and probabilistic methods for design and analysis /[electronic resource] :by Helmut Knebl. - Cham :Springer International Publishing :2020. - xi, 349 p. :ill., digital ;24 cm.

Introduction -- Sorting and Searching -- Hashing -- Trees -- Graphs -- Weighted Graphs -- App. A, Probabilities -- App. B, Mathematical Terminology and Useful Formulas -- References -- Symbols -- Index.

This is a central topic in any computer science curriculum. To distinguish this textbook from others, the author considers probabilistic methods as being fundamental for the construction of simple and efficient algorithms, and in each chapter at least one problem is solved using a randomized algorithm. Data structures are discussed to the extent needed for the implementation of the algorithms. The specific algorithms examined were chosen because of their wide field of application. This book originates from lectures for undergraduate and graduate students. The text assumes experience in programming algorithms, especially with elementary data structures such as chained lists, queues, and stacks. It also assumes familiarity with mathematical methods, although the author summarizes some basic notations and results from probability theory and related mathematical terminology in the appendices. He includes many examples to explain the individual steps of the algorithms, and he concludes each chapter with numerous exercises.

ISBN: 9783030597580$q(electronic bk.)

Standard No.: 10.1007/978-3-030-59758-0doiSubjects--Topical Terms:

184478
Computer algorithms.

LC Class. No.: QA76.9.A43 / K54 2020

Dewey Class. No.: 005.1

Algorithms and data structuresfoundations and probabilistic methods for design and analysis /
LDR:02248nmm a2200325 a 4500 001 588774
003 DE-He213
005 20201031184338.0
006 m d
007 cr nn 008maaau
008 210525s2020 sz s 0 eng d
020 $a 9783030597580$q(electronic bk.)
020 $a 9783030597573$q(paper)
024 7 $a 10.1007/978-3-030-59758-0 $2 doi
035 $a 978-3-030-59758-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b K54 2020
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b K68 2020
100 1 $a Knebl, Helmut. $3 731256
245 1 0 $a Algorithms and data structures $h [electronic resource] : $b foundations and probabilistic methods for design and analysis / $c by Helmut Knebl.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a xi, 349 p. : $b ill., digital ; $c 24 cm.
505 0 $a Introduction -- Sorting and Searching -- Hashing -- Trees -- Graphs -- Weighted Graphs -- App. A, Probabilities -- App. B, Mathematical Terminology and Useful Formulas -- References -- Symbols -- Index.
520 $a This is a central topic in any computer science curriculum. To distinguish this textbook from others, the author considers probabilistic methods as being fundamental for the construction of simple and efficient algorithms, and in each chapter at least one problem is solved using a randomized algorithm. Data structures are discussed to the extent needed for the implementation of the algorithms. The specific algorithms examined were chosen because of their wide field of application. This book originates from lectures for undergraduate and graduate students. The text assumes experience in programming algorithms, especially with elementary data structures such as chained lists, queues, and stacks. It also assumes familiarity with mathematical methods, although the author summarizes some basic notations and results from probability theory and related mathematical terminology in the appendices. He includes many examples to explain the individual steps of the algorithms, and he concludes each chapter with numerous exercises.
650 0 $a Computer algorithms. $3 184478
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Algorithms. $3 184661
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
856 4 0 $u https://doi.org/10.1007/978-3-030-59758-0
950 $a Computer Science (SpringerNature-11645)