Data structures and efficient algorithms final report on the DFG special joint initiative

Gespeichert in:
Bibliographische Detailangaben
Format: Elektronisch E-Book
Sprache:English
Veröffentlicht: Berlin u.a. Springer 1992
Schriftenreihe:Lecture notes in computer science 594
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!

MARC

LEADER 00000nam a2200000 cb4500
001 BV035721522
003 DE-604
007 cr|uuu---uuuuu
008 090911s1992 xx d||| o|||| 00||| eng d
020 |a 3540554882  |9 3-540-55488-2 
020 |a 0387554882  |9 0-387-55488-2 
024 7 |a 10.1007/3-540-55488-2  |2 doi 
035 |a (OCoLC)231334494 
035 |a (DE-599)BVBBV035721522 
040 |a DE-604  |b ger  |e rakddb 
041 0 |a eng 
049 |a DE-12  |a DE-634  |a DE-210  |a DE-Aug4  |a DE-M347  |a DE-860  |a DE-70  |a DE-91  |a DE-384  |a DE-473  |a DE-19  |a DE-355  |a DE-703  |a DE-29  |a DE-739  |a DE-859  |a DE-706  |a DE-1046  |a DE-526  |a DE-521  |a DE-573  |a DE-523 
084 |a ST 265  |0 (DE-625)143634:  |2 rvk 
084 |a ST 270  |0 (DE-625)143638:  |2 rvk 
084 |a DAT 530d  |2 stub 
084 |a DAT 455d  |2 stub 
245 1 0 |a Data structures and efficient algorithms  |b final report on the DFG special joint initiative  |c B. Monien ... (eds.) 
264 1 |a Berlin u.a.  |b Springer  |c 1992 
300 |a 1 Online-Ressource (VIII, 389 S.  |b graph. Darst.) 
336 |b txt  |2 rdacontent 
337 |b c  |2 rdamedia 
338 |b cr  |2 rdacarrier 
490 1 |a Lecture notes in computer science  |v 594 
500 |a Literaturangaben 
650 0 7 |a Geometrieverarbeitung  |0 (DE-588)4194224-3  |2 gnd  |9 rswk-swf 
650 0 7 |a Datenstruktur  |0 (DE-588)4011146-5  |2 gnd  |9 rswk-swf 
650 0 7 |a Informatik  |0 (DE-588)4026894-9  |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 Verteilter Algorithmus  |0 (DE-588)4200453-6  |2 gnd  |9 rswk-swf 
650 0 7 |a Paralleler Algorithmus  |0 (DE-588)4193615-2  |2 gnd  |9 rswk-swf 
650 0 7 |a Algorithmus  |0 (DE-588)4001183-5  |2 gnd  |9 rswk-swf 
655 7 |0 (DE-588)4143413-4  |a Aufsatzsammlung  |2 gnd-content 
655 7 |0 (DE-588)1071861417  |a Konferenzschrift  |y 1991  |z Berlin  |2 gnd-content 
689 0 0 |a Algorithmus  |0 (DE-588)4001183-5  |D s 
689 0 1 |a Datenstruktur  |0 (DE-588)4011146-5  |D s 
689 0 |5 DE-604 
689 1 0 |a Geometrieverarbeitung  |0 (DE-588)4194224-3  |D s 
689 1 1 |a Datenstruktur  |0 (DE-588)4011146-5  |D s 
689 1 2 |a Effizienter Algorithmus  |0 (DE-588)4125422-3  |D s 
689 1 |5 DE-604 
689 2 0 |a Verteilter Algorithmus  |0 (DE-588)4200453-6  |D s 
689 2 1 |a Datenstruktur  |0 (DE-588)4011146-5  |D s 
689 2 2 |a Effizienter Algorithmus  |0 (DE-588)4125422-3  |D s 
689 2 |5 DE-604 
689 3 0 |a Paralleler Algorithmus  |0 (DE-588)4193615-2  |D s 
689 3 1 |a Datenstruktur  |0 (DE-588)4011146-5  |D s 
689 3 2 |a Effizienter Algorithmus  |0 (DE-588)4125422-3  |D s 
689 3 |5 DE-604 
689 4 0 |a Datenstruktur  |0 (DE-588)4011146-5  |D s 
689 4 1 |a Effizienter Algorithmus  |0 (DE-588)4125422-3  |D s 
689 4 |5 DE-604 
689 5 0 |a Algorithmus  |0 (DE-588)4001183-5  |D s 
689 5 1 |a Informatik  |0 (DE-588)4026894-9  |D s 
689 5 2 |a Datenstruktur  |0 (DE-588)4011146-5  |D s 
689 5 |5 DE-604 
689 6 0 |a Datenstruktur  |0 (DE-588)4011146-5  |D s 
689 6 1 |a Algorithmus  |0 (DE-588)4001183-5  |D s 
689 6 |5 DE-604 
700 1 |a Monien, Burkhard  |d 1943-  |e Sonstige  |0 (DE-588)134054849  |4 oth 
710 2 |a Deutsche Forschungsgemeinschaft  |e Sonstige  |0 (DE-588)2007744-0  |4 oth 
830 0 |a Lecture notes in computer science  |v 594  |w (DE-604)BV014880109  |9 594 
856 4 0 |u https://doi.org/10.1007/3-540-55488-2  |x Verlag  |3 Volltext 
912 |a ZDB-1-SLN 
912 |a ZDB-2-LNC 
943 1 |a oai:aleph.bib-bvb.de:BVB01-017998298 

Datensatz im Suchindex

DE-BY-TUM_katkey 2011687
_version_ 1822409172037140480
adam_text
any_adam_object
author_GND (DE-588)134054849
building Verbundindex
bvnumber BV035721522
classification_rvk ST 265
ST 270
classification_tum DAT 530d
DAT 455d
collection ZDB-1-SLN
ZDB-2-LNC
ctrlnum (OCoLC)231334494
(DE-599)BVBBV035721522
discipline Informatik
doi_str_mv 10.1007/3-540-55488-2
format Electronic
eBook
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV035721522</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">090911s1992 xx d||| o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540554882</subfield><subfield code="9">3-540-55488-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387554882</subfield><subfield code="9">0-387-55488-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/3-540-55488-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)231334494</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035721522</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-12</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-210</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-70</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-1046</subfield><subfield code="a">DE-526</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-523</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 265</subfield><subfield code="0">(DE-625)143634:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 270</subfield><subfield code="0">(DE-625)143638:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 455d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Data structures and efficient algorithms</subfield><subfield code="b">final report on the DFG special joint initiative</subfield><subfield code="c">B. Monien ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin u.a.</subfield><subfield code="b">Springer</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (VIII, 389 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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">594</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Geometrieverarbeitung</subfield><subfield code="0">(DE-588)4194224-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">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">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">Verteilter Algorithmus</subfield><subfield code="0">(DE-588)4200453-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Paralleler Algorithmus</subfield><subfield code="0">(DE-588)4193615-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="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4143413-4</subfield><subfield code="a">Aufsatzsammlung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1991</subfield><subfield code="z">Berlin</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="1"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Geometrieverarbeitung</subfield><subfield code="0">(DE-588)4194224-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Verteilter Algorithmus</subfield><subfield code="0">(DE-588)4200453-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="2"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Paralleler Algorithmus</subfield><subfield code="0">(DE-588)4193615-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="2"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" 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="4" 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="4" ind2=" "><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">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2="2"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="6" 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="6" 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="6" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Monien, Burkhard</subfield><subfield code="d">1943-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)134054849</subfield><subfield code="4">oth</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">Deutsche Forschungsgemeinschaft</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)2007744-0</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">594</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">594</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/3-540-55488-2</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-SLN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017998298</subfield></datafield></record></collection>
genre (DE-588)4143413-4 Aufsatzsammlung gnd-content
(DE-588)1071861417 Konferenzschrift 1991 Berlin gnd-content
genre_facet Aufsatzsammlung
Konferenzschrift 1991 Berlin
id DE-604.BV035721522
illustrated Illustrated
indexdate 2025-01-27T13:33:40Z
institution BVB
institution_GND (DE-588)2007744-0
isbn 3540554882
0387554882
language English
oai_aleph_id oai:aleph.bib-bvb.de:BVB01-017998298
oclc_num 231334494
open_access_boolean
owner DE-12
DE-634
DE-210
DE-Aug4
DE-M347
DE-860
DE-70
DE-91
DE-BY-TUM
DE-384
DE-473
DE-BY-UBG
DE-19
DE-BY-UBM
DE-355
DE-BY-UBR
DE-703
DE-29
DE-739
DE-859
DE-706
DE-1046
DE-526
DE-521
DE-573
DE-523
owner_facet DE-12
DE-634
DE-210
DE-Aug4
DE-M347
DE-860
DE-70
DE-91
DE-BY-TUM
DE-384
DE-473
DE-BY-UBG
DE-19
DE-BY-UBM
DE-355
DE-BY-UBR
DE-703
DE-29
DE-739
DE-859
DE-706
DE-1046
DE-526
DE-521
DE-573
DE-523
physical 1 Online-Ressource (VIII, 389 S. graph. Darst.)
psigel ZDB-1-SLN
ZDB-2-LNC
publishDate 1992
publishDateSearch 1992
publishDateSort 1992
publisher Springer
record_format marc
series Lecture notes in computer science
series2 Lecture notes in computer science
spelling Data structures and efficient algorithms final report on the DFG special joint initiative B. Monien ... (eds.)
Berlin u.a. Springer 1992
1 Online-Ressource (VIII, 389 S. graph. Darst.)
txt rdacontent
c rdamedia
cr rdacarrier
Lecture notes in computer science 594
Literaturangaben
Geometrieverarbeitung (DE-588)4194224-3 gnd rswk-swf
Datenstruktur (DE-588)4011146-5 gnd rswk-swf
Informatik (DE-588)4026894-9 gnd rswk-swf
Effizienter Algorithmus (DE-588)4125422-3 gnd rswk-swf
Verteilter Algorithmus (DE-588)4200453-6 gnd rswk-swf
Paralleler Algorithmus (DE-588)4193615-2 gnd rswk-swf
Algorithmus (DE-588)4001183-5 gnd rswk-swf
(DE-588)4143413-4 Aufsatzsammlung gnd-content
(DE-588)1071861417 Konferenzschrift 1991 Berlin gnd-content
Algorithmus (DE-588)4001183-5 s
Datenstruktur (DE-588)4011146-5 s
DE-604
Geometrieverarbeitung (DE-588)4194224-3 s
Effizienter Algorithmus (DE-588)4125422-3 s
Verteilter Algorithmus (DE-588)4200453-6 s
Paralleler Algorithmus (DE-588)4193615-2 s
Informatik (DE-588)4026894-9 s
Monien, Burkhard 1943- Sonstige (DE-588)134054849 oth
Deutsche Forschungsgemeinschaft Sonstige (DE-588)2007744-0 oth
Lecture notes in computer science 594 (DE-604)BV014880109 594
https://doi.org/10.1007/3-540-55488-2 Verlag Volltext
spellingShingle Data structures and efficient algorithms final report on the DFG special joint initiative
Lecture notes in computer science
Geometrieverarbeitung (DE-588)4194224-3 gnd
Datenstruktur (DE-588)4011146-5 gnd
Informatik (DE-588)4026894-9 gnd
Effizienter Algorithmus (DE-588)4125422-3 gnd
Verteilter Algorithmus (DE-588)4200453-6 gnd
Paralleler Algorithmus (DE-588)4193615-2 gnd
Algorithmus (DE-588)4001183-5 gnd
subject_GND (DE-588)4194224-3
(DE-588)4011146-5
(DE-588)4026894-9
(DE-588)4125422-3
(DE-588)4200453-6
(DE-588)4193615-2
(DE-588)4001183-5
(DE-588)4143413-4
(DE-588)1071861417
title Data structures and efficient algorithms final report on the DFG special joint initiative
title_auth Data structures and efficient algorithms final report on the DFG special joint initiative
title_exact_search Data structures and efficient algorithms final report on the DFG special joint initiative
title_full Data structures and efficient algorithms final report on the DFG special joint initiative B. Monien ... (eds.)
title_fullStr Data structures and efficient algorithms final report on the DFG special joint initiative B. Monien ... (eds.)
title_full_unstemmed Data structures and efficient algorithms final report on the DFG special joint initiative B. Monien ... (eds.)
title_short Data structures and efficient algorithms
title_sort data structures and efficient algorithms final report on the dfg special joint initiative
title_sub final report on the DFG special joint initiative
topic Geometrieverarbeitung (DE-588)4194224-3 gnd
Datenstruktur (DE-588)4011146-5 gnd
Informatik (DE-588)4026894-9 gnd
Effizienter Algorithmus (DE-588)4125422-3 gnd
Verteilter Algorithmus (DE-588)4200453-6 gnd
Paralleler Algorithmus (DE-588)4193615-2 gnd
Algorithmus (DE-588)4001183-5 gnd
topic_facet Geometrieverarbeitung
Datenstruktur
Informatik
Effizienter Algorithmus
Verteilter Algorithmus
Paralleler Algorithmus
Algorithmus
Aufsatzsammlung
Konferenzschrift 1991 Berlin
url https://doi.org/10.1007/3-540-55488-2
volume_link (DE-604)BV014880109
work_keys_str_mv AT monienburkhard datastructuresandefficientalgorithmsfinalreportonthedfgspecialjointinitiative
AT deutscheforschungsgemeinschaft datastructuresandefficientalgorithmsfinalreportonthedfgspecialjointinitiative