Algorithmics: the spirit of computing
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Reading, Mass. [u.a.]
Addison-Wesley Publ.
1993
|
| Ausgabe: | 2. ed., reprinted with corr. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XV, 476 S. graph. Darst. |
| ISBN: | 0201504014 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV023892512 | ||
| 003 | DE-604 | ||
| 005 | 20120630 | ||
| 007 | t | ||
| 008 | 960126s1993 d||| |||| 00||| eng d | ||
| 020 | |a 0201504014 |9 0-201-50401-4 | ||
| 035 | |a (OCoLC)636357791 | ||
| 035 | |a (DE-599)BVBBV023892512 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-11 | ||
| 084 | |a ST 110 |0 (DE-625)143583: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
| 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 |
| 250 | |a 2. ed., reprinted with corr. | ||
| 264 | 1 | |a Reading, Mass. [u.a.] |b Addison-Wesley Publ. |c 1993 | |
| 300 | |a XV, 476 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmiersprache |0 (DE-588)4047409-4 |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 Programmverifikation |0 (DE-588)4135576-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Softwareentwicklung |0 (DE-588)4116522-6 |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 Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Beweis |0 (DE-588)4132532-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenverarbeitung |0 (DE-588)4011152-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Korrektheit |0 (DE-588)4240223-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmentheorie |0 (DE-588)4200409-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 Effizienter Algorithmus |0 (DE-588)4125422-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Softwareentwicklung |0 (DE-588)4116522-6 |D s |
| 689 | 0 | 1 | |a Algorithmische Programmiersprache |0 (DE-588)4141876-1 |D s |
| 689 | 0 | 2 | |a Programmverifikation |0 (DE-588)4135576-3 |D s |
| 689 | 0 | 3 | |a Korrektheit |0 (DE-588)4240223-2 |D s |
| 689 | 0 | 4 | |a Beweis |0 (DE-588)4132532-1 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | 1 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 1 | 2 | |a Programmiersprache |0 (DE-588)4047409-4 |D s |
| 689 | 1 | 3 | |a Korrektheit |0 (DE-588)4240223-2 |D s |
| 689 | 1 | 4 | |a Programmverifikation |0 (DE-588)4135576-3 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 2 | 1 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
| 689 | 2 | 2 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 689 | 3 | 0 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
| 689 | 3 | 1 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 3 | 2 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 3 | |8 4\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 5\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 6\p |5 DE-604 | |
| 689 | 6 | 0 | |a Algorithmische Programmierung |0 (DE-588)4293504-0 |D s |
| 689 | 6 | |8 7\p |5 DE-604 | |
| 689 | 7 | 0 | |a Algorithmentheorie |0 (DE-588)4200409-3 |D s |
| 689 | 7 | |8 8\p |5 DE-604 | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017534737&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017534737 | ||
| 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 | |
| 883 | 1 | |8 7\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 8\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804139088275570688 |
|---|---|
| adam_text | ALGORITHMICS THE SPIRIT OF COMPUTING SECOND EDITION DAVID HAREL THE
WEIZMANN INSTITUTE OF SCIENCE REHOVOT, ISRAEL ADDISON-WESLEY PUBLISHING
COMPANY, INC. READING, MASSACHUSETTS MENLO PARK, CALIFORNIA NEW YORK DON
MILLS, ONTARIO WOKINGHAM, ENGLAND AMSTERDAM BONN SYDNEY SINGAPORE TOKYO
MADRID SAN JUAN MILAN PARIS CONTENTS DECLARE THE THINGS THAT ARE TO COME
HEREAFTER ISAIAH 41:23 PREFACE IX ACKNOWLEDGMENTS XV PART I.
PRELIMINARIES 1 1. INTRODUCTION AND HISTORICAL REVIEW 3 OR, WHAT S IT
ALL ABOUT? 2. ALGORITHMS AND DATA 19 OR, GETTING IT DONE 3. PROGRAMMING
LANGUAGES 51 OR, GETTING IT DONE BY COMPUTER PART II. METHODS AND
ANALYSIS 77 4. ALGORITHMIC METHODS 79 OR, GETTING IT DONE METHODICALLY
5. THE CORRECTNESS OF ALGORITHMS 95 OR, GETTING IT DONE RIGHT 6. THE
EFFICIENCY OF ALGORITHMS 127 OR, GETTING IT DONE CHEAPLY PART III.
LIMITATIONS AND ROBUSTNESS 159 7. INEFFICIENCY AND INTRACTABILITY 161
OR, YOU CAN T ALWAYS GET IT DONE CHEAPLY 8. NONCOMPUTABILITY AND
UNDECIDABILITY 195 OR, SOMETIMES YOU CAN T GET IT DONE AT ALL! CONTENTS
9. ALGORITHMIC UNIVERSALITY AND ITS ROBUSTNESS 223 OR, THE SIMPLEST
MACHINES THAT GET IT DONE PART IV. RELAXING THE RULES 263 10.
PARALLELISM AND CONCURRENCY 265 OR, GETTING IT DONE BY COOPERATING 11.
PROBABILISTIC ALGORITHMS 309 OR, GETTING IT DONE BY TOSSING COINS 12.
ALGORITHMICS AND INTELLIGENCE 347 OR, ARE THEY BETTER AT IT THAN US?
POSTSCRIPT 367 SELECTED SOLUTIONS 369 BIBLIOGRAPHIC NOTES 407 INDEX 463
|
| any_adam_object | 1 |
| author | Harel, David 1950- |
| author_GND | (DE-588)109527992 |
| author_facet | Harel, David 1950- |
| author_role | aut |
| author_sort | Harel, David 1950- |
| author_variant | d h dh |
| building | Verbundindex |
| bvnumber | BV023892512 |
| classification_rvk | ST 110 ST 130 ST 134 ST 230 |
| ctrlnum | (OCoLC)636357791 (DE-599)BVBBV023892512 |
| discipline | Informatik |
| edition | 2. ed., reprinted with corr. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04377nam a2200961zc 4500</leader><controlfield tag="001">BV023892512</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120630 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960126s1993 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0201504014</subfield><subfield code="9">0-201-50401-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)636357791</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023892512</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-11</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 110</subfield><subfield code="0">(DE-625)143583:</subfield><subfield code="2">rvk</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 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="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</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. ed., reprinted with corr.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Reading, Mass. [u.a.]</subfield><subfield code="b">Addison-Wesley Publ.</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 476 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">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">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</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">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">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">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">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">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">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">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">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">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">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">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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" 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="0" 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="0" 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="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">Beweis</subfield><subfield code="0">(DE-588)4132532-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" 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="1" 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="1" 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="1" 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="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" 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="2" 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="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" 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="3" 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="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">4\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">5\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">6\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">7\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">8\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV 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=017534737&sequence=000001&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-017534737</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="883" ind1="1" ind2=" "><subfield code="8">7\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">8\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></record></collection> |
| id | DE-604.BV023892512 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T21:38:31Z |
| institution | BVB |
| isbn | 0201504014 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017534737 |
| oclc_num | 636357791 |
| open_access_boolean | |
| owner | DE-11 |
| owner_facet | DE-11 |
| physical | XV, 476 S. graph. Darst. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| publisher | Addison-Wesley Publ. |
| record_format | marc |
| spelling | Harel, David 1950- Verfasser (DE-588)109527992 aut Algorithmics the spirit of computing David Harel 2. ed., reprinted with corr. Reading, Mass. [u.a.] Addison-Wesley Publ. 1993 XV, 476 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Programmiersprache (DE-588)4047409-4 gnd rswk-swf Algorithmische Programmierung (DE-588)4293504-0 gnd rswk-swf Programmverifikation (DE-588)4135576-3 gnd rswk-swf Softwareentwicklung (DE-588)4116522-6 gnd rswk-swf Algorithmische Programmiersprache (DE-588)4141876-1 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Beweis (DE-588)4132532-1 gnd rswk-swf Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Korrektheit (DE-588)4240223-2 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Algorithmentheorie (DE-588)4200409-3 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf Effizienter Algorithmus (DE-588)4125422-3 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Softwareentwicklung (DE-588)4116522-6 s Algorithmische Programmiersprache (DE-588)4141876-1 s Programmverifikation (DE-588)4135576-3 s Korrektheit (DE-588)4240223-2 s Beweis (DE-588)4132532-1 s 1\p DE-604 Algorithmus (DE-588)4001183-5 s Programmierung (DE-588)4076370-5 s Programmiersprache (DE-588)4047409-4 s 2\p DE-604 Effizienter Algorithmus (DE-588)4125422-3 s Berechenbarkeit (DE-588)4138368-0 s 3\p DE-604 Komplexitätstheorie (DE-588)4120591-1 s 4\p DE-604 Informatik (DE-588)4026894-9 s 5\p DE-604 Datenverarbeitung (DE-588)4011152-0 s 6\p DE-604 Algorithmische Programmierung (DE-588)4293504-0 s 7\p DE-604 Algorithmentheorie (DE-588)4200409-3 s 8\p DE-604 GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017534737&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 7\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 8\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Harel, David 1950- Algorithmics the spirit of computing Komplexitätstheorie (DE-588)4120591-1 gnd Programmiersprache (DE-588)4047409-4 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd Programmverifikation (DE-588)4135576-3 gnd Softwareentwicklung (DE-588)4116522-6 gnd Algorithmische Programmiersprache (DE-588)4141876-1 gnd Berechenbarkeit (DE-588)4138368-0 gnd Beweis (DE-588)4132532-1 gnd Datenverarbeitung (DE-588)4011152-0 gnd Korrektheit (DE-588)4240223-2 gnd Informatik (DE-588)4026894-9 gnd Algorithmentheorie (DE-588)4200409-3 gnd Programmierung (DE-588)4076370-5 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4120591-1 (DE-588)4047409-4 (DE-588)4293504-0 (DE-588)4135576-3 (DE-588)4116522-6 (DE-588)4141876-1 (DE-588)4138368-0 (DE-588)4132532-1 (DE-588)4011152-0 (DE-588)4240223-2 (DE-588)4026894-9 (DE-588)4200409-3 (DE-588)4076370-5 (DE-588)4125422-3 (DE-588)4001183-5 |
| 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 |
| title_fullStr | Algorithmics the spirit of computing David Harel |
| title_full_unstemmed | Algorithmics the spirit of computing David Harel |
| title_short | Algorithmics |
| title_sort | algorithmics the spirit of computing |
| title_sub | the spirit of computing |
| topic | Komplexitätstheorie (DE-588)4120591-1 gnd Programmiersprache (DE-588)4047409-4 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd Programmverifikation (DE-588)4135576-3 gnd Softwareentwicklung (DE-588)4116522-6 gnd Algorithmische Programmiersprache (DE-588)4141876-1 gnd Berechenbarkeit (DE-588)4138368-0 gnd Beweis (DE-588)4132532-1 gnd Datenverarbeitung (DE-588)4011152-0 gnd Korrektheit (DE-588)4240223-2 gnd Informatik (DE-588)4026894-9 gnd Algorithmentheorie (DE-588)4200409-3 gnd Programmierung (DE-588)4076370-5 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Komplexitätstheorie Programmiersprache Algorithmische Programmierung Programmverifikation Softwareentwicklung Algorithmische Programmiersprache Berechenbarkeit Beweis Datenverarbeitung Korrektheit Informatik Algorithmentheorie Programmierung Effizienter Algorithmus Algorithmus |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017534737&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT hareldavid algorithmicsthespiritofcomputing |