Complexity issues in strictly non-blocking networks:
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Seattle, Wash.
1991
|
| Series: | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report
91,3,5 |
| Subjects: | |
| Physical Description: | VII, 129 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008992811 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)28390627 | ||
| 035 | |a (DE-599)BVBBV008992811 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Dai, Ho-Kwok |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Complexity issues in strictly non-blocking networks |c Ho-Kwok Dai |
| 264 | 1 | |a Seattle, Wash. |c 1991 | |
| 300 | |a VII, 129 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |v 91,3,5 | |
| 650 | 4 | |a Graph theory | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Washington <Seattle, Wash.> |v 91,3,5 |w (DE-604)BV008930431 |9 91,3,5 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005941729 | ||
Record in the Search Index
| _version_ | 1804123335324336128 |
|---|---|
| any_adam_object | |
| author | Dai, Ho-Kwok |
| author_facet | Dai, Ho-Kwok |
| author_role | aut |
| author_sort | Dai, Ho-Kwok |
| author_variant | h k d hkd |
| building | Verbundindex |
| bvnumber | BV008992811 |
| ctrlnum | (OCoLC)28390627 (DE-599)BVBBV008992811 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00941nam a2200277 cb4500</leader><controlfield tag="001">BV008992811</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28390627</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008992811</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dai, Ho-Kwok</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complexity issues in strictly non-blocking networks</subfield><subfield code="c">Ho-Kwok Dai</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Seattle, Wash.</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VII, 129 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="490" ind1="1" ind2=" "><subfield code="a">University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report</subfield><subfield code="v">91,3,5</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University of Washington <Seattle, Wash.></subfield><subfield code="v">91,3,5</subfield><subfield code="w">(DE-604)BV008930431</subfield><subfield code="9">91,3,5</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005941729</subfield></datafield></record></collection> |
| id | DE-604.BV008992811 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:08Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005941729 |
| oclc_num | 28390627 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | VII, 129 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |
| spelling | Dai, Ho-Kwok Verfasser aut Complexity issues in strictly non-blocking networks Ho-Kwok Dai Seattle, Wash. 1991 VII, 129 S. txt rdacontent n rdamedia nc rdacarrier University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report 91,3,5 Graph theory Department of Computer Science: Technical report University of Washington <Seattle, Wash.> 91,3,5 (DE-604)BV008930431 91,3,5 |
| spellingShingle | Dai, Ho-Kwok Complexity issues in strictly non-blocking networks Graph theory |
| title | Complexity issues in strictly non-blocking networks |
| title_auth | Complexity issues in strictly non-blocking networks |
| title_exact_search | Complexity issues in strictly non-blocking networks |
| title_full | Complexity issues in strictly non-blocking networks Ho-Kwok Dai |
| title_fullStr | Complexity issues in strictly non-blocking networks Ho-Kwok Dai |
| title_full_unstemmed | Complexity issues in strictly non-blocking networks Ho-Kwok Dai |
| title_short | Complexity issues in strictly non-blocking networks |
| title_sort | complexity issues in strictly non blocking networks |
| topic | Graph theory |
| topic_facet | Graph theory |
| volume_link | (DE-604)BV008930431 |
| work_keys_str_mv | AT daihokwok complexityissuesinstrictlynonblockingnetworks |