On the message complexity of broadcast: a basic lower bound:
Gespeichert in:
| Beteiligte Personen: | , , |
|---|---|
| Format: | Buch |
| Sprache: | Nichtbestimmte Sprache |
| Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1987
|
| Schlagwörter: | |
| Umfang: | 12 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021895985 | ||
| 003 | DE-604 | ||
| 005 | 20111013 | ||
| 007 | t| | ||
| 008 | 910222s1987 xx |||| 00||| und d | ||
| 035 | |a (OCoLC)634687617 | ||
| 035 | |a (DE-599)BVBBV021895985 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | |a und | ||
| 049 | |a DE-706 | ||
| 088 | |a MIT LCS TM 325 | ||
| 100 | 1 | |a Awerbuch, Baruch |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On the message complexity of broadcast: a basic lower bound |c Baruch Awerbuch ; Oded Goldreich ; Ronen Vainish |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1987 | |
| 300 | |a 12 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Topologie |0 (DE-588)4060425-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerk |0 (DE-588)4171529-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kommunikation |0 (DE-588)4031883-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Kommunikation |0 (DE-588)4031883-7 |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 Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 3 | |5 DE-604 | |
| 689 | 4 | 0 | |a Netzwerk |0 (DE-588)4171529-9 |D s |
| 689 | 4 | |5 DE-604 | |
| 700 | 1 | |a Goldreich, Oded |d 1957- |e Verfasser |0 (DE-588)120549255 |4 aut | |
| 700 | 1 | |a Vainish, Ronen |e Verfasser |4 aut | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-015111170 | |
Datensatz im Suchindex
| _version_ | 1818963382960652288 |
|---|---|
| any_adam_object | |
| author | Awerbuch, Baruch Goldreich, Oded 1957- Vainish, Ronen |
| author_GND | (DE-588)120549255 |
| author_facet | Awerbuch, Baruch Goldreich, Oded 1957- Vainish, Ronen |
| author_role | aut aut aut |
| author_sort | Awerbuch, Baruch |
| author_variant | b a ba o g og r v rv |
| building | Verbundindex |
| bvnumber | BV021895985 |
| ctrlnum | (OCoLC)634687617 (DE-599)BVBBV021895985 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01572nam a2200457zc 4500</leader><controlfield tag="001">BV021895985</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20111013 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">910222s1987 xx |||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)634687617</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021895985</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT LCS TM 325</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Awerbuch, Baruch</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the message complexity of broadcast: a basic lower bound</subfield><subfield code="c">Baruch Awerbuch ; Oded Goldreich ; Ronen Vainish</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass. Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 S.</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ät</subfield><subfield code="0">(DE-588)4135369-9</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">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">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kommunikation</subfield><subfield code="0">(DE-588)4031883-7</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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Kommunikation</subfield><subfield code="0">(DE-588)4031883-7</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">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</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="700" ind1="1" ind2=" "><subfield code="a">Goldreich, Oded</subfield><subfield code="d">1957-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)120549255</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vainish, Ronen</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015111170</subfield></datafield></record></collection> |
| id | DE-604.BV021895985 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T12:44:20Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015111170 |
| oclc_num | 634687617 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 12 S. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Awerbuch, Baruch Verfasser aut On the message complexity of broadcast: a basic lower bound Baruch Awerbuch ; Oded Goldreich ; Ronen Vainish Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1987 12 S. txt rdacontent n rdamedia nc rdacarrier Komplexität (DE-588)4135369-9 gnd rswk-swf Topologie (DE-588)4060425-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Netzwerk (DE-588)4171529-9 gnd rswk-swf Kommunikation (DE-588)4031883-7 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Kommunikation (DE-588)4031883-7 s Topologie (DE-588)4060425-1 s Komplexität (DE-588)4135369-9 s Netzwerk (DE-588)4171529-9 s Goldreich, Oded 1957- Verfasser (DE-588)120549255 aut Vainish, Ronen Verfasser aut |
| spellingShingle | Awerbuch, Baruch Goldreich, Oded 1957- Vainish, Ronen On the message complexity of broadcast: a basic lower bound Komplexität (DE-588)4135369-9 gnd Topologie (DE-588)4060425-1 gnd Algorithmus (DE-588)4001183-5 gnd Netzwerk (DE-588)4171529-9 gnd Kommunikation (DE-588)4031883-7 gnd |
| subject_GND | (DE-588)4135369-9 (DE-588)4060425-1 (DE-588)4001183-5 (DE-588)4171529-9 (DE-588)4031883-7 |
| title | On the message complexity of broadcast: a basic lower bound |
| title_auth | On the message complexity of broadcast: a basic lower bound |
| title_exact_search | On the message complexity of broadcast: a basic lower bound |
| title_full | On the message complexity of broadcast: a basic lower bound Baruch Awerbuch ; Oded Goldreich ; Ronen Vainish |
| title_fullStr | On the message complexity of broadcast: a basic lower bound Baruch Awerbuch ; Oded Goldreich ; Ronen Vainish |
| title_full_unstemmed | On the message complexity of broadcast: a basic lower bound Baruch Awerbuch ; Oded Goldreich ; Ronen Vainish |
| title_short | On the message complexity of broadcast: a basic lower bound |
| title_sort | on the message complexity of broadcast a basic lower bound |
| topic | Komplexität (DE-588)4135369-9 gnd Topologie (DE-588)4060425-1 gnd Algorithmus (DE-588)4001183-5 gnd Netzwerk (DE-588)4171529-9 gnd Kommunikation (DE-588)4031883-7 gnd |
| topic_facet | Komplexität Topologie Algorithmus Netzwerk Kommunikation |
| work_keys_str_mv | AT awerbuchbaruch onthemessagecomplexityofbroadcastabasiclowerbound AT goldreichoded onthemessagecomplexityofbroadcastabasiclowerbound AT vainishronen onthemessagecomplexityofbroadcastabasiclowerbound |