Efficient algorithms for short and fast repeater trees:
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Bonn
Forschungsinst. für Diskrete Mathematik
|
| Schriftenreihe: | Report / Forschungsinstitut für Diskrete Mathematik
... |
Internformat
MARC
| LEADER | 00000nam a2200000 ca4500 | ||
|---|---|---|---|
| 001 | BV036018115 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 100209nuuuuuuuu |||| 00||| eng d | ||
| 035 | |a (DE-599)BVBBV036018115 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 245 | 1 | 0 | |a Efficient algorithms for short and fast repeater trees |c Christoph Bartoschek ... |
| 264 | 1 | |a Bonn |b Forschungsinst. für Diskrete Mathematik | |
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Report / Forschungsinstitut für Diskrete Mathematik |v ... | |
| 700 | 1 | |a Bartoschek, Christoph |e Sonstige |4 oth | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-018910298 | ||
Datensatz im Suchindex
| _version_ | 1804141045141733376 |
|---|---|
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV036018115 |
| ctrlnum | (DE-599)BVBBV036018115 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00690nam a2200217 ca4500</leader><controlfield tag="001">BV036018115</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100209nuuuuuuuu |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV036018115</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="245" ind1="1" ind2="0"><subfield code="a">Efficient algorithms for short and fast repeater trees</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></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="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="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018910298</subfield></datafield></record></collection> |
| id | DE-604.BV036018115 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T22:09:37Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018910298 |
| open_access_boolean | |
| publishDateSort | 0000 |
| publisher | Forschungsinst. für Diskrete Mathematik |
| record_format | marc |
| series2 | Report / Forschungsinstitut für Diskrete Mathematik |
| spelling | Efficient algorithms for short and fast repeater trees Christoph Bartoschek ... Bonn Forschungsinst. für Diskrete Mathematik txt rdacontent n rdamedia nc rdacarrier Report / Forschungsinstitut für Diskrete Mathematik ... Bartoschek, Christoph Sonstige oth |
| spellingShingle | Efficient algorithms for short and fast repeater trees |
| 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 Christoph Bartoschek ... |
| title_fullStr | Efficient algorithms for short and fast repeater trees Christoph Bartoschek ... |
| title_full_unstemmed | Efficient algorithms for short and fast repeater trees Christoph Bartoschek ... |
| title_short | Efficient algorithms for short and fast repeater trees |
| title_sort | efficient algorithms for short and fast repeater trees |
| work_keys_str_mv | AT bartoschekchristoph efficientalgorithmsforshortandfastrepeatertrees |