Polynomial time algorithms for network information flow:
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
New York, NY
ACM Press
2003
|
| Online Access: | Volltext // Exemplar mit der Signatur: München, Bibliothek der Technischen Universität -- 0102/DAT 516f 2001 B 3473#S.286-294 |
| Item Description: | In: SPAA 2003, Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures. - New York, NY : ACM Press, 2003 |
| Physical Description: | 1 Online-Ressource (S. 286 - 294) Ill. |
Staff View
MARC
| LEADER | 00000nmm a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV041095621 | ||
| 003 | DE-604 | ||
| 005 | 20210423 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 130619s2003 |||| o||u| ||||||eng d | ||
| 035 | |a (OCoLC)854730482 | ||
| 035 | |a (DE-599)BVBBV041095621 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 | ||
| 100 | 1 | |a Sanders, Peter |d 1967- |e Verfasser |0 (DE-588)136120113 |4 aut | |
| 245 | 1 | 0 | |a Polynomial time algorithms for network information flow |c Peter Sanders ; Sebastian Egner ; Ludo Tolhuizen |
| 264 | 1 | |a New York, NY |b ACM Press |c 2003 | |
| 300 | |a 1 Online-Ressource (S. 286 - 294) |b Ill. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a In: SPAA 2003, Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures. - New York, NY : ACM Press, 2003 | ||
| 700 | 1 | |a Egner, Sebastian |d 1968- |e Verfasser |0 (DE-588)118146009 |4 aut | |
| 700 | 1 | |a Tolhuizen, Ludo |e Verfasser |4 aut | |
| 776 | 0 | 8 | |i Elektronische Reproduktion |d München : Bayerische Staatsbibliothek, 2013 |o urn:nbn:de:bvb:12-bsb00083877-4 |
| 856 | 4 | 1 | |u http://mdz-nbn-resolving.de/urn:nbn:de:bvb:12-bsb00083877-4 |x Resolving-System |z kostenfrei |3 Volltext // Exemplar mit der Signatur: München, Bibliothek der Technischen Universität -- 0102/DAT 516f 2001 B 3473#S.286-294 |
| 912 | |a digit | ||
| 940 | 1 | |q BSBLeibnizPublik | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-026072131 | ||
Record in the Search Index
| _version_ | 1804150473597386752 |
|---|---|
| any_adam_object | |
| author | Sanders, Peter 1967- Egner, Sebastian 1968- Tolhuizen, Ludo |
| author_GND | (DE-588)136120113 (DE-588)118146009 |
| author_facet | Sanders, Peter 1967- Egner, Sebastian 1968- Tolhuizen, Ludo |
| author_role | aut aut aut |
| author_sort | Sanders, Peter 1967- |
| author_variant | p s ps s e se l t lt |
| building | Verbundindex |
| bvnumber | BV041095621 |
| collection | digit |
| ctrlnum | (OCoLC)854730482 (DE-599)BVBBV041095621 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01446nmm a2200325 c 4500</leader><controlfield tag="001">BV041095621</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210423 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">130619s2003 |||| o||u| ||||||eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)854730482</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV041095621</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-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sanders, Peter</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)136120113</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Polynomial time algorithms for network information flow</subfield><subfield code="c">Peter Sanders ; Sebastian Egner ; Ludo Tolhuizen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">ACM Press</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (S. 286 - 294)</subfield><subfield code="b">Ill.</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">In: SPAA 2003, Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures. - New York, NY : ACM Press, 2003</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Egner, Sebastian</subfield><subfield code="d">1968-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)118146009</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tolhuizen, Ludo</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Elektronische Reproduktion</subfield><subfield code="d">München : Bayerische Staatsbibliothek, 2013</subfield><subfield code="o">urn:nbn:de:bvb:12-bsb00083877-4</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://mdz-nbn-resolving.de/urn:nbn:de:bvb:12-bsb00083877-4</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext // Exemplar mit der Signatur: München, Bibliothek der Technischen Universität -- 0102/DAT 516f 2001 B 3473#S.286-294</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">digit</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">BSBLeibnizPublik</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-026072131</subfield></datafield></record></collection> |
| id | DE-604.BV041095621 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T00:39:29Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-026072131 |
| oclc_num | 854730482 |
| open_access_boolean | 1 |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 1 Online-Ressource (S. 286 - 294) Ill. |
| psigel | digit BSBLeibnizPublik |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | ACM Press |
| record_format | marc |
| spelling | Sanders, Peter 1967- Verfasser (DE-588)136120113 aut Polynomial time algorithms for network information flow Peter Sanders ; Sebastian Egner ; Ludo Tolhuizen New York, NY ACM Press 2003 1 Online-Ressource (S. 286 - 294) Ill. txt rdacontent c rdamedia cr rdacarrier In: SPAA 2003, Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures. - New York, NY : ACM Press, 2003 Egner, Sebastian 1968- Verfasser (DE-588)118146009 aut Tolhuizen, Ludo Verfasser aut Elektronische Reproduktion München : Bayerische Staatsbibliothek, 2013 urn:nbn:de:bvb:12-bsb00083877-4 http://mdz-nbn-resolving.de/urn:nbn:de:bvb:12-bsb00083877-4 Resolving-System kostenfrei Volltext // Exemplar mit der Signatur: München, Bibliothek der Technischen Universität -- 0102/DAT 516f 2001 B 3473#S.286-294 |
| spellingShingle | Sanders, Peter 1967- Egner, Sebastian 1968- Tolhuizen, Ludo Polynomial time algorithms for network information flow |
| title | Polynomial time algorithms for network information flow |
| title_auth | Polynomial time algorithms for network information flow |
| title_exact_search | Polynomial time algorithms for network information flow |
| title_full | Polynomial time algorithms for network information flow Peter Sanders ; Sebastian Egner ; Ludo Tolhuizen |
| title_fullStr | Polynomial time algorithms for network information flow Peter Sanders ; Sebastian Egner ; Ludo Tolhuizen |
| title_full_unstemmed | Polynomial time algorithms for network information flow Peter Sanders ; Sebastian Egner ; Ludo Tolhuizen |
| title_short | Polynomial time algorithms for network information flow |
| title_sort | polynomial time algorithms for network information flow |
| url | http://mdz-nbn-resolving.de/urn:nbn:de:bvb:12-bsb00083877-4 |
| work_keys_str_mv | AT sanderspeter polynomialtimealgorithmsfornetworkinformationflow AT egnersebastian polynomialtimealgorithmsfornetworkinformationflow AT tolhuizenludo polynomialtimealgorithmsfornetworkinformationflow |