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

Algorithms in a nutshell:

Gespeichert in:

Bibliographische Detailangaben
Beteiligte Personen:	Heineman, George T. (VerfasserIn), Pollice, Gary (VerfasserIn), Selkow, Stanley (VerfasserIn)
Format:	Buch
Sprache:	Englisch
Veröffentlicht:	Beijing ; Boston ; Farnham ; Sebastopol ; Tokyo O'Reilly March 2016
Ausgabe:	Second edition
Schlagwörter:	Algorithmus Einführung
Links:	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=029009628&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
Umfang:	xi, 373 Seiten Illustrationen, Diagramme
ISBN:	9781491948927

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV043595337
003	DE-604
005	20160628
007	t\|
008	160610s2016 xx a\|\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 9781491948927 \|9 978-1-491-94892-7
035			\|a (OCoLC)988066514
035			\|a (DE-599)GBV857505459
040			\|a DE-604 \|b ger \|e rda
041	0		\|a eng
049			\|a DE-91G
084			\|a DAT 530f \|2 stub
100	1		\|a Heineman, George T. \|e Verfasser \|0 (DE-588)173476759 \|4 aut
245	1	0	\|a Algorithms in a nutshell \|c George T. Heineman, Gary Pollice & Stanley Selkow
250			\|a Second edition
264		1	\|a Beijing ; Boston ; Farnham ; Sebastopol ; Tokyo \|b O'Reilly \|c March 2016
300			\|a xi, 373 Seiten \|b Illustrationen, Diagramme
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
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		\|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 HBZ Datenaustausch \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=029009628&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
943	1		\|a oai:aleph.bib-bvb.de:BVB01-029009628

Datensatz im Suchindex

DE-BY-TUM_call_number	0102 DAT 530f 2009 A 7606(2)
DE-BY-TUM_katkey	2219943
DE-BY-TUM_location	01
DE-BY-TUM_media_number	040008261098 040008261101
_version_	1821933599836864512
adam_text	Titel: Algorithms in a nutshell Autor: Heineman, George T Jahr: 2016 Table of Contents Preface to the Second Edition...........................................vii 1. Thinking in Algorithms.............................................. 1 Understand the Problem 1 Naive Solution 3 Intelligent Approaches 3 Summary 8 References 8 2. The Mathematics of Algorithms.......................................9 Size of a Problem Instance 9 Rate of Growth of Functions 10 Analysis in the Best, Average, and Worst Cases 14 Performance Families 18 Benchmark Operations 31 References 33 3. Algorithm Building Blocks.......................................... 35 Algorithm Template Format 35 Pseudocode Template Format 36 Empirical Evaluation Format 37 Floating-Point Computation 38 Example Algorithm 42 Common Approaches 46 References 52 4. Sorting Algorithms................................................ 53 Transposition Sorting 57 Selection Sort 61 Heap Sort 62 Partition-Based Sorting 67 Sorting without Comparisons 74 Bucket Sort 74 Sorting with Extra Storage 81 String Benchmark Results 85 Analysis Techniques 87 References 89 5. Searching........................................................ 91 Sequential Search 92 Binary Search 95 Hash-Based Search 99 Bloom Filter 114 Binary Search Tree 119 References 131 6. Graph Algorithms................................................ 133 Graphs 134 Depth-First Search 137 Breadth-First Search 143 Single-Source Shortest Path 147 Dijkstras Algorithm for Dense Graphs 152 Comparing Single-Source Shortest-Path Options 157 All-Pairs Shortest Path 159 Minimum Spanning Tree Algorithms 163 Final Thoughts on Graphs 167 References 168 7. Path Finding in AI................................................ 169 Game Trees 169 Path-Finding Concepts 173 Minimax 174 NegMax 180 AlphaBeta 183 Search Trees 189 Depth-First Search 192 Breadth-First Search 198 A*Search 201 Comparing Search-Tree Algorithms 211 References 214 Table of Contents 8. Network Flow Algorithms......................................... 217 Network Flow 218 Maximum Flow 220 Bipartite Matching 2 31 Reflections on Augmenting Paths 234 Minimum Cost Flow 238 Transshipment 239 Transportation 240 Assignment 242 Linear Programming 242 References 243 9. Computational Geometry..........................................245 Classifying Problems 246 Convex Hull 249 Convex Hull Scan 250 Computing Line-Segment Intersections 258 LineSweep 259 Voronoi Diagram 268 References 281 10. Spatial Tree Structures............................................ 283 Nearest Neighbor Queries 284 Range Queries 285 Intersection Queries 285 Spatial Tree Structures 285 Nearest Neighbor Queries 288 Range Query 298 Quadtrees 305 R-Trees 311 References 323 11. Emerging Algorithm Categories.................................... 325 Variations on a Theme 325 Approximation Algorithms 326 Parallel Algorithms 332 Probabilistic Algorithms 336 References 344 12. Epilogue: Principles of Algorithms.................................. 345 Know Your Data 345 Decompose a Problem into Smaller Problems 346 Table of Contents \| v Choose the Right Data Structure 347 Make the Space versus Time Trade-Off 349 Construct a Search 350 Reduce Your Problem to Another Problem 350 Writing Algorithms Is Hard-Testing Algorithms Is Harder 351 Accept Approximate Solutions When Possible 352 Add Parallelism to Increase Performance 353 A. Benchmarking................................................... 355 Index.............................................................. 367 Table of Contents
any_adam_object	1
author	Heineman, George T. Pollice, Gary Selkow, Stanley
author_GND	(DE-588)173476759
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	BV043595337
classification_tum	DAT 530f
ctrlnum	(OCoLC)988066514 (DE-599)GBV857505459
discipline	Informatik
edition	Second edition
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01499nam a2200373 c 4500</leader><controlfield tag="001">BV043595337</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160628 </controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">160610s2016 xx a\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781491948927</subfield><subfield code="9">978-1-491-94892-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)988066514</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV857505459</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="049" ind1=" " ind2=" "><subfield code="a">DE-91G</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="0">(DE-588)173476759</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms in a nutshell</subfield><subfield code="c">George T. Heineman, Gary Pollice & Stanley Selkow</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Second edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Beijing ; Boston ; Farnham ; Sebastopol ; Tokyo</subfield><subfield code="b">O'Reilly</subfield><subfield code="c">March 2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xi, 373 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</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="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="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">HBZ Datenaustausch</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=029009628&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029009628</subfield></datafield></record></collection>
genre	1\p (DE-588)4151278-9 Einführung gnd-content
genre_facet	Einführung
id	DE-604.BV043595337
illustrated	Illustrated
indexdate	2024-12-20T17:40:39Z
institution	BVB
isbn	9781491948927
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-029009628
oclc_num	988066514
open_access_boolean
owner	DE-91G DE-BY-TUM
owner_facet	DE-91G DE-BY-TUM
physical	xi, 373 Seiten Illustrationen, Diagramme
publishDate	2016
publishDateSearch	2016
publishDateSort	2016
publisher	O'Reilly
record_format	marc
spellingShingle	Heineman, George T. Pollice, Gary Selkow, Stanley Algorithms in a nutshell Algorithmus (DE-588)4001183-5 gnd
subject_GND	(DE-588)4001183-5 (DE-588)4151278-9
title	Algorithms in a nutshell
title_auth	Algorithms in a nutshell
title_exact_search	Algorithms in a nutshell
title_full	Algorithms in a nutshell George T. Heineman, Gary Pollice & Stanley Selkow
title_fullStr	Algorithms in a nutshell George T. Heineman, Gary Pollice & Stanley Selkow
title_full_unstemmed	Algorithms in a nutshell George T. Heineman, Gary Pollice & Stanley Selkow
title_short	Algorithms in a nutshell
title_sort	algorithms in a nutshell
topic	Algorithmus (DE-588)4001183-5 gnd
topic_facet	Algorithmus Einführung
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=029009628&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT heinemangeorget algorithmsinanutshell AT pollicegary algorithmsinanutshell AT selkowstanley algorithmsinanutshell

Verfügbarkeit

Bestellen (Login erforderlich)

Inhaltsverzeichnis
Paper/Kapitel scannen lassen

Teilbibliothek Mathematik & Informatik

Bestandsangaben von Teilbibliothek Mathematik & Informatik
Signatur:	0102 DAT 530f 2009 A 7606(2) Lageplan
Exemplar 1	Ausleihbar Ausgeliehen – Rückgabe bis: 22.05.2025
Exemplar 2	Ausleihbar Am Standort