Network communications broadcasting and gossiping:
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Amsterdam [u.a.]
Elsevier
1998
|
| Schlagworte: | |
| Beschreibung: | Literaturangaben. - In: Discrete applied mathematics ; 83 (1998),1/3 : Special volume |
| Beschreibung: | 328 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021943809 | ||
| 003 | DE-604 | ||
| 005 | 20040302000000.0 | ||
| 007 | t | ||
| 008 | 981217s1998 d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)313529078 | ||
| 035 | |a (DE-599)BVBBV021943809 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 245 | 1 | 0 | |a Network communications broadcasting and gossiping |c guest ed. A. L. Liestman |
| 264 | 1 | |a Amsterdam [u.a.] |b Elsevier |c 1998 | |
| 300 | |a 328 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturangaben. - In: Discrete applied mathematics ; 83 (1998),1/3 : Special volume | ||
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenübertragung |0 (DE-588)4011150-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Rechnernetz |0 (DE-588)4070085-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematisches Modell |0 (DE-588)4114528-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Topologie |0 (DE-588)4060425-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informationsfluss |0 (DE-588)4161668-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerk |0 (DE-588)4171529-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4143413-4 |a Aufsatzsammlung |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Topologie |0 (DE-588)4060425-1 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Informationsfluss |0 (DE-588)4161668-6 |D s |
| 689 | 3 | |5 DE-604 | |
| 689 | 4 | 0 | |a Netzwerk |0 (DE-588)4171529-9 |D s |
| 689 | 4 | |5 DE-604 | |
| 689 | 5 | 0 | |a Rechnernetz |0 (DE-588)4070085-9 |D s |
| 689 | 5 | 1 | |a Datenübertragung |0 (DE-588)4011150-7 |D s |
| 689 | 5 | 2 | |a Mathematisches Modell |0 (DE-588)4114528-8 |D s |
| 689 | 5 | 3 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 5 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Liestman, Arthur L. |e Sonstige |4 oth | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015158959 | ||
| 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 | |
Datensatz im Suchindex
| _version_ | 1804135905560100864 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| building | Verbundindex |
| bvnumber | BV021943809 |
| ctrlnum | (OCoLC)313529078 (DE-599)BVBBV021943809 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02204nam a2200577zc 4500</leader><controlfield tag="001">BV021943809</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040302000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">981217s1998 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)313529078</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021943809</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></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Network communications broadcasting and gossiping</subfield><subfield code="c">guest ed. A. L. Liestman</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam [u.a.]</subfield><subfield code="b">Elsevier</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">328 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="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben. - In: Discrete applied mathematics ; 83 (1998),1/3 : Special volume</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">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenübertragung</subfield><subfield code="0">(DE-588)4011150-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematisches Modell</subfield><subfield code="0">(DE-588)4114528-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Topologie</subfield><subfield code="0">(DE-588)4060425-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informationsfluss</subfield><subfield code="0">(DE-588)4161668-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4143413-4</subfield><subfield code="a">Aufsatzsammlung</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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</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">Topologie</subfield><subfield code="0">(DE-588)4060425-1</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">Informationsfluss</subfield><subfield code="0">(DE-588)4161668-6</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">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</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">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2="1"><subfield code="a">Datenübertragung</subfield><subfield code="0">(DE-588)4011150-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2="2"><subfield code="a">Mathematisches Modell</subfield><subfield code="0">(DE-588)4114528-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2="3"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liestman, Arthur L.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015158959</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></record></collection> |
| genre | 1\p (DE-588)4143413-4 Aufsatzsammlung gnd-content |
| genre_facet | Aufsatzsammlung |
| id | DE-604.BV021943809 |
| illustrated | Illustrated |
| index_date | 2024-07-02T16:07:11Z |
| indexdate | 2024-07-09T20:47:56Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015158959 |
| oclc_num | 313529078 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 328 S. graph. Darst. |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | Elsevier |
| record_format | marc |
| spelling | Network communications broadcasting and gossiping guest ed. A. L. Liestman Amsterdam [u.a.] Elsevier 1998 328 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Literaturangaben. - In: Discrete applied mathematics ; 83 (1998),1/3 : Special volume Algorithmus (DE-588)4001183-5 gnd rswk-swf Graphentheorie (DE-588)4113782-6 gnd rswk-swf Datenübertragung (DE-588)4011150-7 gnd rswk-swf Rechnernetz (DE-588)4070085-9 gnd rswk-swf Mathematisches Modell (DE-588)4114528-8 gnd rswk-swf Topologie (DE-588)4060425-1 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Informationsfluss (DE-588)4161668-6 gnd rswk-swf Netzwerk (DE-588)4171529-9 gnd rswk-swf 1\p (DE-588)4143413-4 Aufsatzsammlung gnd-content Algorithmus (DE-588)4001183-5 s DE-604 Graph (DE-588)4021842-9 s Topologie (DE-588)4060425-1 s Informationsfluss (DE-588)4161668-6 s Netzwerk (DE-588)4171529-9 s Rechnernetz (DE-588)4070085-9 s Datenübertragung (DE-588)4011150-7 s Mathematisches Modell (DE-588)4114528-8 s Graphentheorie (DE-588)4113782-6 s 2\p DE-604 Liestman, Arthur L. Sonstige oth 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 |
| spellingShingle | Network communications broadcasting and gossiping Algorithmus (DE-588)4001183-5 gnd Graphentheorie (DE-588)4113782-6 gnd Datenübertragung (DE-588)4011150-7 gnd Rechnernetz (DE-588)4070085-9 gnd Mathematisches Modell (DE-588)4114528-8 gnd Topologie (DE-588)4060425-1 gnd Graph (DE-588)4021842-9 gnd Informationsfluss (DE-588)4161668-6 gnd Netzwerk (DE-588)4171529-9 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4113782-6 (DE-588)4011150-7 (DE-588)4070085-9 (DE-588)4114528-8 (DE-588)4060425-1 (DE-588)4021842-9 (DE-588)4161668-6 (DE-588)4171529-9 (DE-588)4143413-4 |
| title | Network communications broadcasting and gossiping |
| title_auth | Network communications broadcasting and gossiping |
| title_exact_search | Network communications broadcasting and gossiping |
| title_exact_search_txtP | Network communications broadcasting and gossiping |
| title_full | Network communications broadcasting and gossiping guest ed. A. L. Liestman |
| title_fullStr | Network communications broadcasting and gossiping guest ed. A. L. Liestman |
| title_full_unstemmed | Network communications broadcasting and gossiping guest ed. A. L. Liestman |
| title_short | Network communications broadcasting and gossiping |
| title_sort | network communications broadcasting and gossiping |
| topic | Algorithmus (DE-588)4001183-5 gnd Graphentheorie (DE-588)4113782-6 gnd Datenübertragung (DE-588)4011150-7 gnd Rechnernetz (DE-588)4070085-9 gnd Mathematisches Modell (DE-588)4114528-8 gnd Topologie (DE-588)4060425-1 gnd Graph (DE-588)4021842-9 gnd Informationsfluss (DE-588)4161668-6 gnd Netzwerk (DE-588)4171529-9 gnd |
| topic_facet | Algorithmus Graphentheorie Datenübertragung Rechnernetz Mathematisches Modell Topologie Graph Informationsfluss Netzwerk Aufsatzsammlung |
| work_keys_str_mv | AT liestmanarthurl networkcommunicationsbroadcastingandgossiping |