Verfügbarkeit: Algorithms in a nutshell | Technische Universität München

Algorithms in a nutshell: [a desktop quick reference]

Gespeichert in:

Bibliographische Detailangaben
Beteiligte Personen:	Heineman, George T. (VerfasserIn), Pollice, Gary (VerfasserIn), Selkow, Stanley (VerfasserIn)
Format:	Buch
Sprache:	Englisch
Veröffentlicht:	Beijing [u.a.] O'Reilly 2009
Ausgabe:	1. ed.
Schlagwörter:	Computer algorithms Algorithmus Einführung
Links:	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016788815&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
Umfang:	XV, 343 S. Ill., graph. Darst., Kt.
ISBN:	9780596516246

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV035121150
003	DE-604
005	20091005
007	t\|
008	081027s2009 xx abd\| \|\|\|\| 00\|\|\| eng d
020			\|a 9780596516246 \|c : EUR 48.00 (freier Pr.) \|9 978-0-596-51624-6
035			\|a (OCoLC)315959029
035			\|a (DE-599)HBZHT015678237
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-703 \|a DE-20 \|a DE-473 \|a DE-92 \|a DE-91G \|a DE-634 \|a DE-11 \|a DE-1051 \|a DE-29
082	0		\|a 005.1
084			\|a ST 134 \|0 (DE-625)143590: \|2 rvk
084			\|a DAT 530f \|2 stub
100	1		\|a Heineman, George T. \|e Verfasser \|4 aut
245	1	0	\|a Algorithms in a nutshell \|b [a desktop quick reference] \|c George T. Heineman, Gary Pollice, and Stanley Selkow
250			\|a 1. ed.
264		1	\|a Beijing [u.a.] \|b O'Reilly \|c 2009
300			\|a XV, 343 S. \|b Ill., graph. Darst., Kt.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
650		7	\|a Computer algorithms \|2 blmsh
650	0	7	\|a Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
655		7	\|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		\|5 DE-604
700	1		\|a Pollice, Gary \|e Verfasser \|4 aut
700	1		\|a Selkow, Stanley \|e Verfasser \|4 aut
856	4	2	\|m Digitalisierung UB Bayreuth \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016788815&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
943	1		\|a oai:aleph.bib-bvb.de:BVB01-016788815

Datensatz im Suchindex

DE-BY-TUM_call_number	0104 DAT 530f 2009 A 7606 0303 DAT 535f 2009 L 680
DE-BY-TUM_katkey	1707500
DE-BY-TUM_location	01 03
DE-BY-TUM_media_number	040010159054 040071236738 040071236749 040071236750 040071236761 040071236772
_version_	1821933753769918464
adam_text	Table of Contents Preface ..........................................................ix Parti. 1. Algorithms Matter ................. . 3 Understand the Problem 4 Experiment if Necessary 5 Algorithms to the Rescue 8 Side Story 9 The Moral of the Story 10 References 11 2. The Mathematics of Algorithms .................... ........ 12 Size of a Problem Instance 12 Rate of Growth of Functions 14 Analysis in the Best, Average, and Worst Cases 18 Performance Families 22 Mix of Operations 35 Benchmark Operations 36 One Final Point 38 References 38 3. Patterns and Domains ......................................39 Patterns: A Communication Language 39 Algorithm Pattern Format 41 Pseudocode Pattern Format 42 Design Format 43 Empirical Evaluation Format 44 Domains and Algorithms 46 Floating-Point Computations 47 Manual Memory Allocation 50 Choosing a Programming Language 53 References 54 Partii. 4. Sorting Algorithms ......................................... 57 Overview 57 Insertion Sort 63 Median Sort 67 Quicksort 78 Selection Sort 85 Heap Sort 86 Counting Sort 91 Bucket Sort 93 Criteria for Choosing a Sorting Algorithm 99 References 103 5. Searching ................................................105 Overview 105 Sequential Search 106 Binary Search 112 Hash-based Search 116 Binary Tree Search 129 6. Graph Algorithms .........................................136 Overview 136 Depth-First Search 142 Breadth-First Search 149 Single-Source Shortest Path 153 All Pairs Shortest Path 165 Minimum Spanning Tree Algorithms 169 References 171 vi \| Table of Contents 7. Path Finding in Al .........................................172 Overview 172 Depth-First Search 181 Breadth-First Search 190 A Search 194 Comparison 204 Minimax 207 NegMax 213 AlphaBeta 217 References 224 8. Network Flow Algorithms ..................................226 Overview 226 Maximum Flow 229 Bipartite Matching 239 Reflections on Augmenting Paths 242 Minimum Cost Flow 246 Transshipment 246 Transportation 247 Assignment 248 Linear Programming 249 References 250 9. Computational Geometry ..................................251 Overview 251 Convex Hull Scan 260 LineSweep 268 Nearest Neighbor Queries 280 Range Queries 292 References 298 Partili. 10. When All Else Fails .........................................301 Variations on a Theme 301 Approximation Algorithms 302 Offline Algorithms 302 Parallel Algorithms 303 Randomized Algorithms 303 Algorithms That Can Be Wrong, but with Diminishing Probability 310 References 313 Table of Contents I vii 11. Epilogue .................................................314 Overview 314 Principle: Know Your Data 314 Principle: Decompose the Problem into Smaller Problems 315 Principle: Choose the Right Data Structure 316 Principle: Add Storage to Increase Performance 317 Principle: If No Solution Is Evident, Construct a Search 318 Principle: If No Solution Is Evident, Reduce Your Problem to Another Problem That Has a Solution 318 Principle: Writing Algorithms Is Hard — Testing Algorithms Is Harder 319 Part IV. Appendix: Benchmarking ........................................323 Index ..........................................................337 \| Table of Contents
any_adam_object	1
author	Heineman, George T. Pollice, Gary Selkow, Stanley
author_facet	Heineman, George T. Pollice, Gary Selkow, Stanley
author_role	aut aut aut
author_sort	Heineman, George T.
author_variant	g t h gt gth g p gp s s ss
building	Verbundindex
bvnumber	BV035121150
classification_rvk	ST 134
classification_tum	DAT 530f
ctrlnum	(OCoLC)315959029 (DE-599)HBZHT015678237
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
edition	1. ed.
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01580nam a2200397 c 4500</leader><controlfield tag="001">BV035121150</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20091005 </controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">081027s2009 xx abd\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780596516246</subfield><subfield code="c">: EUR 48.00 (freier Pr.)</subfield><subfield code="9">978-0-596-51624-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)315959029</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)HBZHT015678237</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-1051</subfield><subfield code="a">DE-29</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="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Heineman, George T.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms in a nutshell</subfield><subfield code="b">[a desktop quick reference]</subfield><subfield code="c">George T. Heineman, Gary Pollice, and Stanley Selkow</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Beijing [u.a.]</subfield><subfield code="b">O'Reilly</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 343 S.</subfield><subfield code="b">Ill., graph. Darst., Kt.</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="650" ind1=" " ind2="7"><subfield code="a">Computer algorithms</subfield><subfield code="2">blmsh</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="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="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pollice, Gary</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Selkow, Stanley</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bayreuth</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016788815&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016788815</subfield></datafield></record></collection>
genre	(DE-588)4151278-9 Einführung gnd-content
genre_facet	Einführung
id	DE-604.BV035121150
illustrated	Illustrated
indexdate	2024-12-20T13:20:41Z
institution	BVB
isbn	9780596516246
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-016788815
oclc_num	315959029
open_access_boolean
owner	DE-703 DE-20 DE-473 DE-BY-UBG DE-92 DE-91G DE-BY-TUM DE-634 DE-11 DE-1051 DE-29
owner_facet	DE-703 DE-20 DE-473 DE-BY-UBG DE-92 DE-91G DE-BY-TUM DE-634 DE-11 DE-1051 DE-29
physical	XV, 343 S. Ill., graph. Darst., Kt.
publishDate	2009
publishDateSearch	2009
publishDateSort	2009
publisher	O'Reilly
record_format	marc
spellingShingle	Heineman, George T. Pollice, Gary Selkow, Stanley Algorithms in a nutshell [a desktop quick reference] Computer algorithms blmsh Algorithmus (DE-588)4001183-5 gnd
subject_GND	(DE-588)4001183-5 (DE-588)4151278-9
title	Algorithms in a nutshell [a desktop quick reference]
title_auth	Algorithms in a nutshell [a desktop quick reference]
title_exact_search	Algorithms in a nutshell [a desktop quick reference]
title_full	Algorithms in a nutshell [a desktop quick reference] George T. Heineman, Gary Pollice, and Stanley Selkow
title_fullStr	Algorithms in a nutshell [a desktop quick reference] George T. Heineman, Gary Pollice, and Stanley Selkow
title_full_unstemmed	Algorithms in a nutshell [a desktop quick reference] George T. Heineman, Gary Pollice, and Stanley Selkow
title_short	Algorithms in a nutshell
title_sort	algorithms in a nutshell a desktop quick reference
title_sub	[a desktop quick reference]
topic	Computer algorithms blmsh Algorithmus (DE-588)4001183-5 gnd
topic_facet	Computer algorithms Algorithmus Einführung
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016788815&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT heinemangeorget algorithmsinanutshelladesktopquickreference AT pollicegary algorithmsinanutshelladesktopquickreference AT selkowstanley algorithmsinanutshelladesktopquickreference

Verfügbarkeit

Bestellen (Login erforderlich)

Inhaltsverzeichnis
Paper/Kapitel scannen lassen

Teilbibliothek Mathematik & Informatik

Bestandsangaben von Teilbibliothek Mathematik & Informatik
Signatur:	0104 DAT 530f 2009 A 7606 Lageplan
Exemplar 1	Nicht ausleihbar Am Standort

Teilbibliothek Chemie, Lehrbuchsammlung

Bestandsangaben von Teilbibliothek Chemie, Lehrbuchsammlung
Signatur:	0303 DAT 535f 2009 L 680 Lageplan
Exemplar 1	Ausleihbar Am Standort
Exemplar 2	Ausleihbar Am Standort
Exemplar 3	Ausleihbar Am Standort
Exemplar 4	Ausleihbar Am Standort
Exemplar 5	Ausleihbar Am Standort