Holdings: Algorithms unlocked

Algorithms unlocked:

Saved in:

Bibliographic Details
Main Author:	Cormen, Thomas H. (Author)
Format:	Book
Language:	English
Published:	Cambridge, Mass. [u.a.] MIT Press 2013
Subjects:	Computer algorithms Algorithmus Einführung
Online Access:	Inhaltsverzeichnis
Physical Description:	XIII, 222 S. Ill., graph. Darst.
ISBN:	9780262518802

Staff View

MARC


LEADER	00000nam a2200000 c 4500
001	BV040771374
003	DE-604
005	20141021
007	t
008	130222s2013 xxuad\|\| \|\|\|\| 00\|\|\| eng d
010			\|a 2012036810
020			\|a 9780262518802 \|c pbk. : alk. paper \|9 978-0-262-51880-2
035			\|a (OCoLC)844031515
035			\|a (DE-599)BVBBV040771374
040			\|a DE-604 \|b ger \|e rakwb
041	0		\|a eng
044			\|a xxu \|c US
049			\|a DE-91G \|a DE-634 \|a DE-384 \|a DE-83 \|a DE-11
050		0	\|a QA76.9.A43
082	0		\|a 005.1
084			\|a ST 134 \|0 (DE-625)143590: \|2 rvk
084			\|a ST 230 \|0 (DE-625)143617: \|2 rvk
084			\|a DAT 530f \|2 stub
084			\|a 68Wxx \|2 msc
100	1		\|a Cormen, Thomas H. \|e Verfasser \|0 (DE-588)12942661X \|4 aut
245	1	0	\|a Algorithms unlocked \|c Thomas H. Cormen
264		1	\|a Cambridge, Mass. [u.a.] \|b MIT Press \|c 2013
300			\|a XIII, 222 S. \|b Ill., graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
650		4	\|a Computer algorithms
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
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=025749747&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
999			\|a oai:aleph.bib-bvb.de:BVB01-025749747

Record in the Search Index

_version_	1804150102155067392
adam_text	Titel: Algorithms unlocked Autor: Cormen, Thomas H Jahr: 2013 Contents Preface ix What Are Algorithms and Why Should You Care? 1 Correctness 2 Resource usage 4 Computer algorithms for non-computer people 6 Computer algorithms for Computer people 6 Further reading 8 How to Describe and Evaluate Computer Algorithms 10 How to describe Computer algorithms 10 How to characterize running times 17 Loop invariants 21 Recursion 22 Further reading 24 Algorithms for Sorting and Searching 25 Binary search 28 Selection sort 32 Insertion sort 35 Merge sort 40 Quicksort 49 Recap 57 Further reading 59 A Lower Bound for Sorting and How to Beat It 60 Rules for sorting 60 The lower bound on comparison sorting 61 Beating the lower bound with counting sort 62 Radix sort 68 Further reading 70 vi Contents Directed Acyclic Graphs 71 Directed acyclic graphs 74 Topological sorting 75 How to represent a directed graph 78 Running time of topological sorting 80 Critical path in a PERT chart 80 Shortest path in a directed acyclic graph 85 Further reading 89 Shortest Paths 90 Dijkstra s algorithm 92 The Bellman-Ford algorithm 101 The Floyd-Warshall algorithm 106 Further reading 114 Algorithms on Strings 115 Longest common subsequence 115 Transforming one string to another 121 String matching 129 Further reading 136 Foundations of Cryptography 138 Simple Substitution ciphers 139 Symmetric-key cryptography 140 Public-key cryptography 144 The RSA cryptosystem 146 Hybrid cryptosystems 155 Computing random numbers 156 Further reading 157 Data Compression 158 Huffman codes 160 Fax machines 167 LZW compression 168 Further reading 178 Contents 10 Hard? Problems 179 Brown trucks 179 The classes P and NP and NP-completeness 183 Decision problems and reductions 185 A Mother Problem 188 A sampler of NP-complete problems 790 General strategies 205 Perspective 208 Undecidable problems 210 Wrap-up 211 Further reading 212 Bibliography 213 Index 215
any_adam_object	1
author	Cormen, Thomas H.
author_GND	(DE-588)12942661X
author_facet	Cormen, Thomas H.
author_role	aut
author_sort	Cormen, Thomas H.
author_variant	t h c th thc
building	Verbundindex
bvnumber	BV040771374
callnumber-first	Q - Science
callnumber-label	QA76
callnumber-raw	QA76.9.A43
callnumber-search	QA76.9.A43
callnumber-sort	QA 276.9 A43
callnumber-subject	QA - Mathematics
classification_rvk	ST 134 ST 230
classification_tum	DAT 530f
ctrlnum	(OCoLC)844031515 (DE-599)BVBBV040771374
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
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01511nam a2200421 c 4500</leader><controlfield tag="001">BV040771374</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20141021 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">130222s2013 xxuad\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2012036810</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262518802</subfield><subfield code="c">pbk. : alk. paper</subfield><subfield code="9">978-0-262-51880-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)844031515</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV040771374</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</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-91G</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.A43</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">ST 230</subfield><subfield code="0">(DE-625)143617:</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="084" ind1=" " ind2=" "><subfield code="a">68Wxx</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cormen, Thomas H.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)12942661X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms unlocked</subfield><subfield code="c">Thomas H. Cormen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass. [u.a.]</subfield><subfield code="b">MIT Press</subfield><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 222 S.</subfield><subfield code="b">Ill., graph. Darst.</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="4"><subfield code="a">Computer algorithms</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="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=025749747&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-025749747</subfield></datafield></record></collection>
genre	(DE-588)4151278-9 Einführung gnd-content
genre_facet	Einführung
id	DE-604.BV040771374
illustrated	Illustrated
indexdate	2024-07-10T00:33:35Z
institution	BVB
isbn	9780262518802
language	English
lccn	2012036810
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-025749747
oclc_num	844031515
open_access_boolean
owner	DE-91G DE-BY-TUM DE-634 DE-384 DE-83 DE-11
owner_facet	DE-91G DE-BY-TUM DE-634 DE-384 DE-83 DE-11
physical	XIII, 222 S. Ill., graph. Darst.
publishDate	2013
publishDateSearch	2013
publishDateSort	2013
publisher	MIT Press
record_format	marc
spelling	Cormen, Thomas H. Verfasser (DE-588)12942661X aut Algorithms unlocked Thomas H. Cormen Cambridge, Mass. [u.a.] MIT Press 2013 XIII, 222 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Computer algorithms Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)4151278-9 Einführung gnd-content Algorithmus (DE-588)4001183-5 s DE-604 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025749747&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Cormen, Thomas H. Algorithms unlocked Computer algorithms Algorithmus (DE-588)4001183-5 gnd
subject_GND	(DE-588)4001183-5 (DE-588)4151278-9
title	Algorithms unlocked
title_auth	Algorithms unlocked
title_exact_search	Algorithms unlocked
title_full	Algorithms unlocked Thomas H. Cormen
title_fullStr	Algorithms unlocked Thomas H. Cormen
title_full_unstemmed	Algorithms unlocked Thomas H. Cormen
title_short	Algorithms unlocked
title_sort	algorithms unlocked
topic	Computer algorithms 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=025749747&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT cormenthomash algorithmsunlocked

Holdings

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Indexes

MARC

Record in the Search Index

There is no print copy available.

Similar Items