Approximating the size of a dynamically growing asynchronous distributed network:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Laboratory for Computer Science, Massachusetts Inst. of Technology
1987
|
| Schlagworte: | |
| Beschreibung: | 17 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021891299 | ||
| 003 | DE-604 | ||
| 005 | 20040301000000.0 | ||
| 007 | t | ||
| 008 | 900621s1987 |||| 00||| eng d | ||
| 035 | |a (OCoLC)17013164 | ||
| 035 | |a (DE-599)BVBBV021891299 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TM-328 | ||
| 100 | 1 | |a Awerbuch, Baruch |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Approximating the size of a dynamically growing asynchronous distributed network |c Baruch Awerbuch ; Serge A. Plotkin |
| 264 | 1 | |a Cambridge, Mass. |b Laboratory for Computer Science, Massachusetts Inst. of Technology |c 1987 | |
| 300 | |a 17 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computer networks | |
| 650 | 0 | 7 | |a Netzwerk |0 (DE-588)4171529-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Fehlerfortpflanzung |0 (DE-588)4479158-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Approximation |0 (DE-588)4002498-2 |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 Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Netzwerk |0 (DE-588)4171529-9 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Fehlerfortpflanzung |0 (DE-588)4479158-6 |D s |
| 689 | 3 | |5 DE-604 | |
| 700 | 1 | |a Plotkin, Serge A. |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015106501 | ||
Datensatz im Suchindex
| _version_ | 1804135834587234304 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Awerbuch, Baruch Plotkin, Serge A. |
| author_facet | Awerbuch, Baruch Plotkin, Serge A. |
| author_role | aut aut |
| author_sort | Awerbuch, Baruch |
| author_variant | b a ba s a p sa sap |
| building | Verbundindex |
| bvnumber | BV021891299 |
| ctrlnum | (OCoLC)17013164 (DE-599)BVBBV021891299 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01458nam a2200433zc 4500</leader><controlfield tag="001">BV021891299</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">900621s1987 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)17013164</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021891299</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="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TM-328</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">Approximating the size of a dynamically growing asynchronous distributed network</subfield><subfield code="c">Baruch Awerbuch ; Serge A. Plotkin</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Laboratory for Computer Science, Massachusetts Inst. of Technology</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 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=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks</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">Fehlerfortpflanzung</subfield><subfield code="0">(DE-588)4479158-6</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">Approximation</subfield><subfield code="0">(DE-588)4002498-2</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">Approximation</subfield><subfield code="0">(DE-588)4002498-2</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">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</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">Fehlerfortpflanzung</subfield><subfield code="0">(DE-588)4479158-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Plotkin, Serge A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015106501</subfield></datafield></record></collection> |
| id | DE-604.BV021891299 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:04:11Z |
| indexdate | 2024-07-09T20:46:48Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015106501 |
| oclc_num | 17013164 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 17 S. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| publisher | Laboratory for Computer Science, Massachusetts Inst. of Technology |
| record_format | marc |
| spelling | Awerbuch, Baruch Verfasser aut Approximating the size of a dynamically growing asynchronous distributed network Baruch Awerbuch ; Serge A. Plotkin Cambridge, Mass. Laboratory for Computer Science, Massachusetts Inst. of Technology 1987 17 S. txt rdacontent n rdamedia nc rdacarrier Algorithms Computer networks Netzwerk (DE-588)4171529-9 gnd rswk-swf Fehlerfortpflanzung (DE-588)4479158-6 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Approximation (DE-588)4002498-2 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Approximation (DE-588)4002498-2 s Netzwerk (DE-588)4171529-9 s Fehlerfortpflanzung (DE-588)4479158-6 s Plotkin, Serge A. Verfasser aut |
| spellingShingle | Awerbuch, Baruch Plotkin, Serge A. Approximating the size of a dynamically growing asynchronous distributed network Algorithms Computer networks Netzwerk (DE-588)4171529-9 gnd Fehlerfortpflanzung (DE-588)4479158-6 gnd Algorithmus (DE-588)4001183-5 gnd Approximation (DE-588)4002498-2 gnd |
| subject_GND | (DE-588)4171529-9 (DE-588)4479158-6 (DE-588)4001183-5 (DE-588)4002498-2 |
| title | Approximating the size of a dynamically growing asynchronous distributed network |
| title_auth | Approximating the size of a dynamically growing asynchronous distributed network |
| title_exact_search | Approximating the size of a dynamically growing asynchronous distributed network |
| title_exact_search_txtP | Approximating the size of a dynamically growing asynchronous distributed network |
| title_full | Approximating the size of a dynamically growing asynchronous distributed network Baruch Awerbuch ; Serge A. Plotkin |
| title_fullStr | Approximating the size of a dynamically growing asynchronous distributed network Baruch Awerbuch ; Serge A. Plotkin |
| title_full_unstemmed | Approximating the size of a dynamically growing asynchronous distributed network Baruch Awerbuch ; Serge A. Plotkin |
| title_short | Approximating the size of a dynamically growing asynchronous distributed network |
| title_sort | approximating the size of a dynamically growing asynchronous distributed network |
| topic | Algorithms Computer networks Netzwerk (DE-588)4171529-9 gnd Fehlerfortpflanzung (DE-588)4479158-6 gnd Algorithmus (DE-588)4001183-5 gnd Approximation (DE-588)4002498-2 gnd |
| topic_facet | Algorithms Computer networks Netzwerk Fehlerfortpflanzung Algorithmus Approximation |
| work_keys_str_mv | AT awerbuchbaruch approximatingthesizeofadynamicallygrowingasynchronousdistributednetwork AT plotkinsergea approximatingthesizeofadynamicallygrowingasynchronousdistributednetwork |