Verfügbarkeit: Introduction to algorithms | Technische Universität München

Introduction to algorithms:

Gespeichert in:

Bibliographische Detailangaben
Beteiligte Personen:	Cormen, Thomas H. (VerfasserIn), Leiserson, Charles E. (VerfasserIn), Rivest, Ronald L. (VerfasserIn)
Format:	Buch
Sprache:	Englisch
Veröffentlicht:	Cambridge, Mass.[u.a.] MIT Press [u.a.] 1993
Ausgabe:	10. print.
Schriftenreihe:	The MIT electrical engineering and computer science series
Schlagwörter:	Datenstruktur Algorithmische Programmierung Informatik Algorithmus Einführung Lehrbuch
Umfang:	XVII, 1028 S. Ill., graph. Darst.
ISBN:	0262031418 0262530910 0070131430

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV040524998
003	DE-604
005	00000000000000.0
007	t\|
008	121107s1997 xx ad\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 0262031418 \|9 0-262-03141-8
020			\|a 0262530910 \|c pb. \|9 0-262-53091-0
020			\|a 0070131430 \|9 0-07-013143-0
035			\|a (OCoLC)633527549
035			\|a (DE-599)BVBBV040524998
040			\|a DE-604 \|b ger \|e rakwb
041	0		\|a eng
049			\|a DE-11
084			\|a ST 130 \|0 (DE-625)143588: \|2 rvk
084			\|a ST 230 \|0 (DE-625)143617: \|2 rvk
100	1		\|a Cormen, Thomas H. \|e Verfasser \|4 aut
245	1	0	\|a Introduction to algorithms \|c Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest
250			\|a 10. print.
264		1	\|a Cambridge, Mass.[u.a.] \|b MIT Press [u.a.] \|c 1993
300			\|a XVII, 1028 S. \|b Ill., graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	0		\|a The MIT electrical engineering and computer science series
650	0	7	\|a Datenstruktur \|0 (DE-588)4011146-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmische Programmierung \|0 (DE-588)4293504-0 \|2 gnd \|9 rswk-swf
650	0	7	\|a Informatik \|0 (DE-588)4026894-9 \|2 gnd \|9 rswk-swf
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
655		7	\|8 2\p \|0 (DE-588)4123623-3 \|a Lehrbuch \|2 gnd-content
689	0	0	\|a Datenstruktur \|0 (DE-588)4011146-5 \|D s
689	0	1	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	0		\|8 3\p \|5 DE-604
689	1	0	\|a Informatik \|0 (DE-588)4026894-9 \|D s
689	1	1	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	1		\|8 4\p \|5 DE-604
689	2	0	\|a Algorithmische Programmierung \|0 (DE-588)4293504-0 \|D s
689	2		\|8 5\p \|5 DE-604
700	1		\|a Leiserson, Charles E. \|e Verfasser \|4 aut
700	1		\|a Rivest, Ronald L. \|e Verfasser \|4 aut
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 2\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 3\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 4\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 5\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-025371199

Datensatz im Suchindex

_version_	1818976754867372032
any_adam_object
author	Cormen, Thomas H. Leiserson, Charles E. Rivest, Ronald L.
author_facet	Cormen, Thomas H. Leiserson, Charles E. Rivest, Ronald L.
author_role	aut aut aut
author_sort	Cormen, Thomas H.
author_variant	t h c th thc c e l ce cel r l r rl rlr
building	Verbundindex
bvnumber	BV040524998
classification_rvk	ST 130 ST 230
ctrlnum	(OCoLC)633527549 (DE-599)BVBBV040524998
discipline	Informatik
edition	10. print.
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02332nam a2200577 c 4500</leader><controlfield tag="001">BV040524998</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">121107s1997 xx ad\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262031418</subfield><subfield code="9">0-262-03141-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262530910</subfield><subfield code="c">pb.</subfield><subfield code="9">0-262-53091-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0070131430</subfield><subfield code="9">0-07-013143-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)633527549</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV040524998</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="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</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="100" ind1="1" ind2=" "><subfield code="a">Cormen, Thomas H.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Introduction to algorithms</subfield><subfield code="c">Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">10. print.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.[u.a.]</subfield><subfield code="b">MIT Press [u.a.]</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 1028 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="490" ind1="0" ind2=" "><subfield code="a">The MIT electrical engineering and computer science series</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Programmierung</subfield><subfield code="0">(DE-588)4293504-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="655" ind1=" " ind2="7"><subfield code="8">2\p</subfield><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Algorithmische Programmierung</subfield><subfield code="0">(DE-588)4293504-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Leiserson, Charles E.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rivest, Ronald L.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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="883" ind1="1" ind2=" "><subfield code="8">2\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="883" ind1="1" ind2=" "><subfield code="8">3\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="883" ind1="1" ind2=" "><subfield code="8">4\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="883" ind1="1" ind2=" "><subfield code="8">5\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-025371199</subfield></datafield></record></collection>
genre	1\p (DE-588)4151278-9 Einführung gnd-content 2\p (DE-588)4123623-3 Lehrbuch gnd-content
genre_facet	Einführung Lehrbuch
id	DE-604.BV040524998
illustrated	Illustrated
indexdate	2024-12-20T16:16:53Z
institution	BVB
isbn	0262031418 0262530910 0070131430
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-025371199
oclc_num	633527549
open_access_boolean
owner	DE-11
owner_facet	DE-11
physical	XVII, 1028 S. Ill., graph. Darst.
publishDate	1993
publishDateSearch	1997
publishDateSort	1997
publisher	MIT Press [u.a.]
record_format	marc
series2	The MIT electrical engineering and computer science series
spelling	Cormen, Thomas H. Verfasser aut Introduction to algorithms Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest 10. print. Cambridge, Mass.[u.a.] MIT Press [u.a.] 1993 XVII, 1028 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier The MIT electrical engineering and computer science series Datenstruktur (DE-588)4011146-5 gnd rswk-swf Algorithmische Programmierung (DE-588)4293504-0 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf 1\p (DE-588)4151278-9 Einführung gnd-content 2\p (DE-588)4123623-3 Lehrbuch gnd-content Datenstruktur (DE-588)4011146-5 s Algorithmus (DE-588)4001183-5 s 3\p DE-604 Informatik (DE-588)4026894-9 s 4\p DE-604 Algorithmische Programmierung (DE-588)4293504-0 s 5\p DE-604 Leiserson, Charles E. Verfasser aut Rivest, Ronald L. Verfasser aut 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
spellingShingle	Cormen, Thomas H. Leiserson, Charles E. Rivest, Ronald L. Introduction to algorithms Datenstruktur (DE-588)4011146-5 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd Informatik (DE-588)4026894-9 gnd Algorithmus (DE-588)4001183-5 gnd
subject_GND	(DE-588)4011146-5 (DE-588)4293504-0 (DE-588)4026894-9 (DE-588)4001183-5 (DE-588)4151278-9 (DE-588)4123623-3
title	Introduction to algorithms
title_auth	Introduction to algorithms
title_exact_search	Introduction to algorithms
title_full	Introduction to algorithms Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest
title_fullStr	Introduction to algorithms Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest
title_full_unstemmed	Introduction to algorithms Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest
title_short	Introduction to algorithms
title_sort	introduction to algorithms
topic	Datenstruktur (DE-588)4011146-5 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd Informatik (DE-588)4026894-9 gnd Algorithmus (DE-588)4001183-5 gnd
topic_facet	Datenstruktur Algorithmische Programmierung Informatik Algorithmus Einführung Lehrbuch
work_keys_str_mv	AT cormenthomash introductiontoalgorithms AT leisersoncharlese introductiontoalgorithms AT rivestronaldl introductiontoalgorithms

Verfügbarkeit

MARC

Datensatz im Suchindex

‌