Algorithmics the spirit of computing

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Harel, David 1950- (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Wokingham, England u.a. Addison-Wesley 1988
Ausgabe:Repr.
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!

MARC

LEADER 00000nam a2200000 c 4500
001 BV005138849
003 DE-604
005 20040113
007 t|
008 920527s1988 xx d||| |||| 00||| eng d
020 |a 0201192403  |9 0-201-19240-3 
035 |a (OCoLC)474037858 
035 |a (DE-599)BVBBV005138849 
040 |a DE-604  |b ger  |e rakddb 
041 0 |a eng 
049 |a DE-473  |a DE-19  |a DE-83 
084 |a ST 134  |0 (DE-625)143590:  |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 
250 |a Repr. 
264 1 |a Wokingham, England u.a.  |b Addison-Wesley  |c 1988 
300 |a XIV, 425 S.  |b graph. Darst. 
336 |b txt  |2 rdacontent 
337 |b n  |2 rdamedia 
338 |b nc  |2 rdacarrier 
650 0 7 |a Programmierung  |0 (DE-588)4076370-5  |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 Berechenbarkeit  |0 (DE-588)4138368-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 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 Programmiersprache  |0 (DE-588)4047409-4  |2 gnd  |9 rswk-swf 
650 0 7 |a Algorithmus  |0 (DE-588)4001183-5  |2 gnd  |9 rswk-swf 
650 0 7 |a Algorithmentheorie  |0 (DE-588)4200409-3  |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 Beweis  |0 (DE-588)4132532-1  |2 gnd  |9 rswk-swf 
650 0 7 |a Programmverifikation  |0 (DE-588)4135576-3  |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 
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 
943 1 |a oai:aleph.bib-bvb.de:BVB01-003163954 

Datensatz im Suchindex

DE-19_call_number 1408/HAR II 2
DE-19_location 80
DE-BY-UBM_katkey 963970
DE-BY-UBM_media_number 41612290450014
_version_ 1823050501352062976
any_adam_object
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 BV005138849
classification_rvk ST 134
ctrlnum (OCoLC)474037858
(DE-599)BVBBV005138849
discipline Informatik
edition Repr.
format Book
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03982nam a2200913 c 4500</leader><controlfield tag="001">BV005138849</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040113 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">920527s1988 xx d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0201192403</subfield><subfield code="9">0-201-19240-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)474037858</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV005138849</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-83</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="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></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Repr.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Wokingham, England u.a.</subfield><subfield code="b">Addison-Wesley</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 425 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">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">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">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">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">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">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">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">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">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">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">Programmverifikation</subfield><subfield code="0">(DE-588)4135576-3</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="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><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-003163954</subfield></datafield></record></collection>
id DE-604.BV005138849
illustrated Illustrated
indexdate 2025-02-03T16:22:41Z
institution BVB
isbn 0201192403
language English
oai_aleph_id oai:aleph.bib-bvb.de:BVB01-003163954
oclc_num 474037858
open_access_boolean
owner DE-473
DE-BY-UBG
DE-19
DE-BY-UBM
DE-83
owner_facet DE-473
DE-BY-UBG
DE-19
DE-BY-UBM
DE-83
physical XIV, 425 S. graph. Darst.
publishDate 1988
publishDateSearch 1988
publishDateSort 1988
publisher Addison-Wesley
record_format marc
spellingShingle Harel, David 1950-
Algorithmics the spirit of computing
Programmierung (DE-588)4076370-5 gnd
Datenverarbeitung (DE-588)4011152-0 gnd
Informatik (DE-588)4026894-9 gnd
Berechenbarkeit (DE-588)4138368-0 gnd
Korrektheit (DE-588)4240223-2 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
Programmiersprache (DE-588)4047409-4 gnd
Algorithmus (DE-588)4001183-5 gnd
Algorithmentheorie (DE-588)4200409-3 gnd
Effizienter Algorithmus (DE-588)4125422-3 gnd
Beweis (DE-588)4132532-1 gnd
Programmverifikation (DE-588)4135576-3 gnd
subject_GND (DE-588)4076370-5
(DE-588)4011152-0
(DE-588)4026894-9
(DE-588)4138368-0
(DE-588)4240223-2
(DE-588)4293504-0
(DE-588)4116522-6
(DE-588)4120591-1
(DE-588)4141876-1
(DE-588)4047409-4
(DE-588)4001183-5
(DE-588)4200409-3
(DE-588)4125422-3
(DE-588)4132532-1
(DE-588)4135576-3
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
title_fullStr Algorithmics the spirit of computing
title_full_unstemmed Algorithmics the spirit of computing
title_short Algorithmics
title_sort algorithmics the spirit of computing
title_sub the spirit of computing
topic Programmierung (DE-588)4076370-5 gnd
Datenverarbeitung (DE-588)4011152-0 gnd
Informatik (DE-588)4026894-9 gnd
Berechenbarkeit (DE-588)4138368-0 gnd
Korrektheit (DE-588)4240223-2 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
Programmiersprache (DE-588)4047409-4 gnd
Algorithmus (DE-588)4001183-5 gnd
Algorithmentheorie (DE-588)4200409-3 gnd
Effizienter Algorithmus (DE-588)4125422-3 gnd
Beweis (DE-588)4132532-1 gnd
Programmverifikation (DE-588)4135576-3 gnd
topic_facet Programmierung
Datenverarbeitung
Informatik
Berechenbarkeit
Korrektheit
Algorithmische Programmierung
Softwareentwicklung
Komplexitätstheorie
Algorithmische Programmiersprache
Programmiersprache
Algorithmus
Algorithmentheorie
Effizienter Algorithmus
Beweis
Programmverifikation
work_keys_str_mv AT hareldavid algorithmicsthespiritofcomputing