Efficient algorithms for short and fast repeater trees: 1 Topology generation
Gespeichert in:
Format: | Buch |
---|---|
Sprache: | English |
Veröffentlicht: |
Bonn
Forschungsinst. für Diskrete Mathematik
[2007]
|
Schriftenreihe: | Report
07977 |
Beschreibung: | 13 S. graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 cc4500 | ||
---|---|---|---|
001 | BV036018124 | ||
003 | DE-604 | ||
005 | 20160308 | ||
007 | t | ||
008 | 100209s2007 d||| |||| 00||| eng d | ||
035 | |a (OCoLC)248688062 | ||
035 | |a (DE-599)BVBBV036018124 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
049 | |a DE-11 | ||
245 | 1 | 0 | |a Efficient algorithms for short and fast repeater trees |n 1 |p Topology generation |c Christoph Bartoschek ... |
264 | 1 | |a Bonn |b Forschungsinst. für Diskrete Mathematik |c [2007] | |
300 | |a 13 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Report |v 07977 | |
490 | 0 | |a Report / Forschungsinstitut für Diskrete Mathematik |v ... | |
700 | 1 | |a Bartoschek, Christoph |e Sonstige |4 oth | |
773 | 0 | 8 | |w (DE-604)BV036018115 |g 1 |
830 | 0 | |a Report |v 07977 |w (DE-604)BV025500002 |9 07977 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-018910302 |
Datensatz im Suchindex
_version_ | 1804141045142781952 |
---|---|
any_adam_object | |
building | Verbundindex |
bvnumber | BV036018124 |
ctrlnum | (OCoLC)248688062 (DE-599)BVBBV036018124 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00941nam a2200289 cc4500</leader><controlfield tag="001">BV036018124</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160308 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100209s2007 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)248688062</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV036018124</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient algorithms for short and fast repeater trees</subfield><subfield code="n">1</subfield><subfield code="p">Topology generation</subfield><subfield code="c">Christoph Bartoschek ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Bonn</subfield><subfield code="b">Forschungsinst. für Diskrete Mathematik</subfield><subfield code="c">[2007]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 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="490" ind1="1" ind2=" "><subfield code="a">Report</subfield><subfield code="v">07977</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Report / Forschungsinstitut für Diskrete Mathematik</subfield><subfield code="v">...</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bartoschek, Christoph</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="w">(DE-604)BV036018115</subfield><subfield code="g">1</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Report</subfield><subfield code="v">07977</subfield><subfield code="w">(DE-604)BV025500002</subfield><subfield code="9">07977</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018910302</subfield></datafield></record></collection> |
id | DE-604.BV036018124 |
illustrated | Illustrated |
indexdate | 2024-07-09T22:09:37Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018910302 |
oclc_num | 248688062 |
open_access_boolean | |
owner | DE-11 |
owner_facet | DE-11 |
physical | 13 S. graph. Darst. |
publishDate | 2007 |
publishDateSearch | 2007 |
publishDateSort | 2007 |
publisher | Forschungsinst. für Diskrete Mathematik |
record_format | marc |
series | Report |
series2 | Report Report / Forschungsinstitut für Diskrete Mathematik |
spelling | Efficient algorithms for short and fast repeater trees 1 Topology generation Christoph Bartoschek ... Bonn Forschungsinst. für Diskrete Mathematik [2007] 13 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Report 07977 Report / Forschungsinstitut für Diskrete Mathematik ... Bartoschek, Christoph Sonstige oth (DE-604)BV036018115 1 Report 07977 (DE-604)BV025500002 07977 |
spellingShingle | Efficient algorithms for short and fast repeater trees Report |
title | Efficient algorithms for short and fast repeater trees |
title_auth | Efficient algorithms for short and fast repeater trees |
title_exact_search | Efficient algorithms for short and fast repeater trees |
title_full | Efficient algorithms for short and fast repeater trees 1 Topology generation Christoph Bartoschek ... |
title_fullStr | Efficient algorithms for short and fast repeater trees 1 Topology generation Christoph Bartoschek ... |
title_full_unstemmed | Efficient algorithms for short and fast repeater trees 1 Topology generation Christoph Bartoschek ... |
title_short | Efficient algorithms for short and fast repeater trees |
title_sort | efficient algorithms for short and fast repeater trees topology generation |
volume_link | (DE-604)BV036018115 (DE-604)BV025500002 |
work_keys_str_mv | AT bartoschekchristoph efficientalgorithmsforshortandfastrepeatertrees1 |