Algorithmics: the spirit of computing
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer
2012
|
Ausgabe: | 3. ed. |
Schlagworte: | |
Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
Beschreibung: | XXII, 572 S. graph. Darst. |
ISBN: | 9783642272653 3642272657 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV040231080 | ||
003 | DE-604 | ||
005 | 20130103 | ||
007 | t | ||
008 | 120601s2012 d||| |||| 00||| eng d | ||
016 | 7 | |a 679760016 |2 DE-101 | |
020 | |a 9783642272653 |9 978-3-642-27265-3 | ||
020 | |a 3642272657 |9 3-642-27265-7 | ||
035 | |a (OCoLC)794534217 | ||
035 | |a (DE-599)DNB1017748454 | ||
040 | |a DE-604 |b ger | ||
041 | 0 | |a eng | |
049 | |a DE-706 |a DE-11 |a DE-91G |a DE-83 |a DE-739 |a DE-634 |a DE-188 | ||
082 | 0 | |a 005.1 |2 22/ger | |
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
084 | |a DAT 530f |2 stub | ||
100 | 1 | |a Harel, David |d 1950- |e Verfasser |0 (DE-588)109527992 |4 aut | |
245 | 1 | 0 | |a Algorithmics |b the spirit of computing |c David Harel with Yishai Feldman |
250 | |a 3. ed. | ||
264 | 1 | |a Berlin [u.a.] |b Springer |c 2012 | |
300 | |a XXII, 572 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Datenverarbeitung |0 (DE-588)4011152-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 Programmverifikation |0 (DE-588)4135576-3 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmentheorie |0 (DE-588)4200409-3 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Beweis |0 (DE-588)4132532-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-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 Softwareentwicklung |0 (DE-588)4116522-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmische Programmiersprache |0 (DE-588)4141876-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Korrektheit |0 (DE-588)4240223-2 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Programmiersprache |0 (DE-588)4047409-4 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | 1 | |a Programmierung |0 (DE-588)4076370-5 |D s |
689 | 0 | 2 | |a Programmiersprache |0 (DE-588)4047409-4 |D s |
689 | 0 | 3 | |a Korrektheit |0 (DE-588)4240223-2 |D s |
689 | 0 | 4 | |a Programmverifikation |0 (DE-588)4135576-3 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
689 | 1 | 1 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
689 | 1 | 2 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Softwareentwicklung |0 (DE-588)4116522-6 |D s |
689 | 2 | 1 | |a Algorithmische Programmiersprache |0 (DE-588)4141876-1 |D s |
689 | 2 | 2 | |a Programmverifikation |0 (DE-588)4135576-3 |D s |
689 | 2 | 3 | |a Korrektheit |0 (DE-588)4240223-2 |D s |
689 | 2 | 4 | |a Beweis |0 (DE-588)4132532-1 |D s |
689 | 2 | |8 1\p |5 DE-604 | |
689 | 3 | 0 | |a Programmierung |0 (DE-588)4076370-5 |D s |
689 | 3 | 1 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
689 | 3 | 2 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
689 | 3 | |8 2\p |5 DE-604 | |
689 | 4 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 4 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
689 | 4 | |8 3\p |5 DE-604 | |
689 | 5 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 5 | 1 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
689 | 5 | |8 4\p |5 DE-604 | |
689 | 6 | 0 | |a Algorithmische Programmierung |0 (DE-588)4293504-0 |D s |
689 | 6 | |8 5\p |5 DE-604 | |
689 | 7 | 0 | |a Algorithmentheorie |0 (DE-588)4200409-3 |D s |
689 | 7 | |8 6\p |5 DE-604 | |
700 | 1 | |a Feldman, Yishai A. |d 1958- |e Verfasser |0 (DE-588)131963562 |4 aut | |
856 | 4 | 2 | |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3929829&prov=M&dok%5Fvar=1&dok%5Fext=htm |3 Inhaltstext |
856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025087505&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 | |
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 | |
883 | 1 | |8 6\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-025087505 |
Datensatz im Suchindex
_version_ | 1805146707131891712 |
---|---|
adam_text |
IMAGE 1
PREFACE (WRITTEN FOR THE 2012 PRINTING) VII
PREFACE (WRITTEN FOR THE FIRST EDITION) XI
ACKNOWLEDGEMENTS XIX
PART I PRELIMINARIES
1 INTRODUCTION AND HISTORICAL REVIEW 3
2 ALGORITHMS AND DATA 21
3 PROGRAMMING LANGUAGES AND PARADIGMS 55
PART II METHODS AND ANALYSIS
4 ALGORITHMIC METHODS 91
5 THE CORRECTNESS OF ALGORITHMS 111
6 THE EFFICIENCY OF ALGORITHMS 147
PART III LIMITATIONS AND ROBUSTNESS
7 INEFFICIENCY AND INTRACTABILITY 181
8 NONCOMPUTABILITY AND UNDECIDABILITY 217
9 ALGORITHMIC UNIVERSALITY AND ITS ROBUSTNESS . . . . 249
X X I
HTTP://D-NB.INFO/1017748454
IMAGE 2
XXII C O N T E N T S
P A R T IV RELAXING THE RULES
10 PARALLELISM, CONCURRENCY, AND ALTERNATIVE MODELS . 291
1 1 PROBABILISTIC ALGORITHMS 337
12 CRYPTOGRAPHY AND RELIABLE INTERACTION 359
PART V THE BIGGER PICTURE
13 SOFTWARE ENGINEERING 383
14 REACTIVE SYSTEMS 405
15 ALGORITHMICS AND INTELLIGENCE 431
POSTSCRIPT 457
SELECTED SOLUTIONS 459
BIBLIOGRAPHIC NOTES 495
INDEX 553 |
any_adam_object | 1 |
author | Harel, David 1950- Feldman, Yishai A. 1958- |
author_GND | (DE-588)109527992 (DE-588)131963562 |
author_facet | Harel, David 1950- Feldman, Yishai A. 1958- |
author_role | aut aut |
author_sort | Harel, David 1950- |
author_variant | d h dh y a f ya yaf |
building | Verbundindex |
bvnumber | BV040231080 |
classification_rvk | ST 134 |
classification_tum | DAT 530f |
ctrlnum | (OCoLC)794534217 (DE-599)DNB1017748454 |
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 | 3. ed. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV040231080</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20130103</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">120601s2012 d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">679760016</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642272653</subfield><subfield code="9">978-3-642-27265-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642272657</subfield><subfield code="9">3-642-27265-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)794534217</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1017748454</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">22/ger</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">Harel, David</subfield><subfield code="d">1950-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)109527992</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmics</subfield><subfield code="b">the spirit of computing</subfield><subfield code="c">David Harel with Yishai Feldman</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">3. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXII, 572 S.</subfield><subfield code="b">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="0" ind2="7"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-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">Programmverifikation</subfield><subfield code="0">(DE-588)4135576-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Beweis</subfield><subfield code="0">(DE-588)4132532-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-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">Softwareentwicklung</subfield><subfield code="0">(DE-588)4116522-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Programmiersprache</subfield><subfield code="0">(DE-588)4141876-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Korrektheit</subfield><subfield code="0">(DE-588)4240223-2</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="650" ind1="0" ind2="7"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="1"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Korrektheit</subfield><subfield code="0">(DE-588)4240223-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Programmverifikation</subfield><subfield code="0">(DE-588)4135576-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Softwareentwicklung</subfield><subfield code="0">(DE-588)4116522-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Algorithmische Programmiersprache</subfield><subfield code="0">(DE-588)4141876-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="2"><subfield code="a">Programmverifikation</subfield><subfield code="0">(DE-588)4135576-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="3"><subfield code="a">Korrektheit</subfield><subfield code="0">(DE-588)4240223-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="4"><subfield code="a">Beweis</subfield><subfield code="0">(DE-588)4132532-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="2"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" 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="4" ind2="1"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" 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="5" ind2="1"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="6" 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="6" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="7" ind2="0"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="7" ind2=" "><subfield code="8">6\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Feldman, Yishai A.</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)131963562</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3929829&prov=M&dok%5Fvar=1&dok%5Fext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB 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=025087505&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="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="883" ind1="1" ind2=" "><subfield code="8">6\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-025087505</subfield></datafield></record></collection> |
id | DE-604.BV040231080 |
illustrated | Illustrated |
indexdate | 2024-07-21T00:34:11Z |
institution | BVB |
isbn | 9783642272653 3642272657 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-025087505 |
oclc_num | 794534217 |
open_access_boolean | |
owner | DE-706 DE-11 DE-91G DE-BY-TUM DE-83 DE-739 DE-634 DE-188 |
owner_facet | DE-706 DE-11 DE-91G DE-BY-TUM DE-83 DE-739 DE-634 DE-188 |
physical | XXII, 572 S. graph. Darst. |
publishDate | 2012 |
publishDateSearch | 2012 |
publishDateSort | 2012 |
publisher | Springer |
record_format | marc |
spelling | Harel, David 1950- Verfasser (DE-588)109527992 aut Algorithmics the spirit of computing David Harel with Yishai Feldman 3. ed. Berlin [u.a.] Springer 2012 XXII, 572 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Programmverifikation (DE-588)4135576-3 gnd rswk-swf Algorithmentheorie (DE-588)4200409-3 gnd rswk-swf Beweis (DE-588)4132532-1 gnd rswk-swf Effizienter Algorithmus (DE-588)4125422-3 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf Algorithmische Programmierung (DE-588)4293504-0 gnd rswk-swf Softwareentwicklung (DE-588)4116522-6 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Algorithmische Programmiersprache (DE-588)4141876-1 gnd rswk-swf Korrektheit (DE-588)4240223-2 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Programmiersprache (DE-588)4047409-4 gnd rswk-swf Algorithmus (DE-588)4001183-5 s Programmierung (DE-588)4076370-5 s Programmiersprache (DE-588)4047409-4 s Korrektheit (DE-588)4240223-2 s Programmverifikation (DE-588)4135576-3 s DE-604 Effizienter Algorithmus (DE-588)4125422-3 s Komplexitätstheorie (DE-588)4120591-1 s Berechenbarkeit (DE-588)4138368-0 s Softwareentwicklung (DE-588)4116522-6 s Algorithmische Programmiersprache (DE-588)4141876-1 s Beweis (DE-588)4132532-1 s 1\p DE-604 2\p DE-604 Informatik (DE-588)4026894-9 s 3\p DE-604 Datenverarbeitung (DE-588)4011152-0 s 4\p DE-604 Algorithmische Programmierung (DE-588)4293504-0 s 5\p DE-604 Algorithmentheorie (DE-588)4200409-3 s 6\p DE-604 Feldman, Yishai A. 1958- Verfasser (DE-588)131963562 aut text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3929829&prov=M&dok%5Fvar=1&dok%5Fext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025087505&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 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 6\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Harel, David 1950- Feldman, Yishai A. 1958- Algorithmics the spirit of computing Berechenbarkeit (DE-588)4138368-0 gnd Datenverarbeitung (DE-588)4011152-0 gnd Informatik (DE-588)4026894-9 gnd Programmverifikation (DE-588)4135576-3 gnd Algorithmentheorie (DE-588)4200409-3 gnd Beweis (DE-588)4132532-1 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd Programmierung (DE-588)4076370-5 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd Softwareentwicklung (DE-588)4116522-6 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmische Programmiersprache (DE-588)4141876-1 gnd Korrektheit (DE-588)4240223-2 gnd Algorithmus (DE-588)4001183-5 gnd Programmiersprache (DE-588)4047409-4 gnd |
subject_GND | (DE-588)4138368-0 (DE-588)4011152-0 (DE-588)4026894-9 (DE-588)4135576-3 (DE-588)4200409-3 (DE-588)4132532-1 (DE-588)4125422-3 (DE-588)4076370-5 (DE-588)4293504-0 (DE-588)4116522-6 (DE-588)4120591-1 (DE-588)4141876-1 (DE-588)4240223-2 (DE-588)4001183-5 (DE-588)4047409-4 |
title | Algorithmics the spirit of computing |
title_auth | Algorithmics the spirit of computing |
title_exact_search | Algorithmics the spirit of computing |
title_full | Algorithmics the spirit of computing David Harel with Yishai Feldman |
title_fullStr | Algorithmics the spirit of computing David Harel with Yishai Feldman |
title_full_unstemmed | Algorithmics the spirit of computing David Harel with Yishai Feldman |
title_short | Algorithmics |
title_sort | algorithmics the spirit of computing |
title_sub | the spirit of computing |
topic | Berechenbarkeit (DE-588)4138368-0 gnd Datenverarbeitung (DE-588)4011152-0 gnd Informatik (DE-588)4026894-9 gnd Programmverifikation (DE-588)4135576-3 gnd Algorithmentheorie (DE-588)4200409-3 gnd Beweis (DE-588)4132532-1 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd Programmierung (DE-588)4076370-5 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd Softwareentwicklung (DE-588)4116522-6 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmische Programmiersprache (DE-588)4141876-1 gnd Korrektheit (DE-588)4240223-2 gnd Algorithmus (DE-588)4001183-5 gnd Programmiersprache (DE-588)4047409-4 gnd |
topic_facet | Berechenbarkeit Datenverarbeitung Informatik Programmverifikation Algorithmentheorie Beweis Effizienter Algorithmus Programmierung Algorithmische Programmierung Softwareentwicklung Komplexitätstheorie Algorithmische Programmiersprache Korrektheit Algorithmus Programmiersprache |
url | http://deposit.dnb.de/cgi-bin/dokserv?id=3929829&prov=M&dok%5Fvar=1&dok%5Fext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025087505&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT hareldavid algorithmicsthespiritofcomputing AT feldmanyishaia algorithmicsthespiritofcomputing |