WALCOM: algorithms and computation: 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017 : proceedings
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Tagungsbericht Buch |
| Sprache: | English |
| Veröffentlicht: |
Cham
Springer
[2017]
|
| Schriftenreihe: | Lecture notes in computer science
10167 |
| Schlagworte: | |
| Beschreibung: | XXII, 474 Seiten Diagramme |
| ISBN: | 9783319539249 9783319539256 |
Internformat
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV044221426 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 170313s2017 |||| |||| 10||| eng d | ||
| 020 | |a 9783319539249 |9 978-3-319-53924-9 | ||
| 020 | |a 9783319539256 |c eBook |9 978-3-319-53925-6 | ||
| 035 | |a (OCoLC)976427827 | ||
| 035 | |a (DE-599)BVBBV044221426 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 | ||
| 082 | 0 | |a 005.1 |2 23 | |
| 084 | |a SS 4800 |0 (DE-625)143528: |2 rvk | ||
| 111 | 2 | |a WALCOM |n 11. |d 2017 |c Hsinchu |j Verfasser |0 (DE-588)1127539612 |4 aut | |
| 245 | 1 | 0 | |a WALCOM: algorithms and computation |b 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017 : proceedings |c Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen (eds.) |
| 264 | 1 | |a Cham |b Springer |c [2017] | |
| 300 | |a XXII, 474 Seiten |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 10167 | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computer Science | |
| 650 | 4 | |a Algorithm Analysis and Problem Complexity | |
| 650 | 4 | |a Informatik | |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphenzeichnen |0 (DE-588)4706480-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | 2 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 0 | 3 | |a Graphenzeichnen |0 (DE-588)4706480-8 |D s |
| 689 | 0 | 4 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 1 | 1 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 1 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | 3 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 1 | 4 | |a Graphenzeichnen |0 (DE-588)4706480-8 |D s |
| 689 | 1 | 5 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Poon, Sheung-Hung |4 edt | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783319539249 |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-319-53925-6 |
| 830 | 0 | |a Lecture notes in computer science |v 10167 |w (DE-604)BV000000607 |9 10167 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029627380 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804177369484754944 |
|---|---|
| any_adam_object | |
| author2 | Poon, Sheung-Hung |
| author2_role | edt |
| author2_variant | s h p shp |
| author_corporate | WALCOM Hsinchu |
| author_corporate_role | aut |
| author_facet | Poon, Sheung-Hung WALCOM Hsinchu |
| author_sort | WALCOM Hsinchu |
| building | Verbundindex |
| bvnumber | BV044221426 |
| classification_rvk | SS 4800 |
| ctrlnum | (OCoLC)976427827 (DE-599)BVBBV044221426 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02798nam a2200673zcb4500</leader><controlfield tag="001">BV044221426</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">170313s2017 |||| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319539249</subfield><subfield code="9">978-3-319-53924-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319539256</subfield><subfield code="c">eBook</subfield><subfield code="9">978-3-319-53925-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)976427827</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044221426</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 4800</subfield><subfield code="0">(DE-625)143528:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">WALCOM</subfield><subfield code="n">11.</subfield><subfield code="d">2017</subfield><subfield code="c">Hsinchu</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1127539612</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">WALCOM: algorithms and computation</subfield><subfield code="b">11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017 : proceedings</subfield><subfield code="c">Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer</subfield><subfield code="c">[2017]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXII, 474 Seiten</subfield><subfield code="b">Diagramme</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">Lecture notes in computer science</subfield><subfield code="v">10167</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</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">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphenzeichnen</subfield><subfield code="0">(DE-588)4706480-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</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="1"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Graphenzeichnen</subfield><subfield code="0">(DE-588)4706480-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</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">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="3"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="4"><subfield code="a">Graphenzeichnen</subfield><subfield code="0">(DE-588)4706480-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="5"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Poon, Sheung-Hung</subfield><subfield code="4">edt</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783319539249</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-319-53925-6</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">10167</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">10167</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029627380</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| id | DE-604.BV044221426 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:46:59Z |
| institution | BVB |
| institution_GND | (DE-588)1127539612 |
| isbn | 9783319539249 9783319539256 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029627380 |
| oclc_num | 976427827 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | XXII, 474 Seiten Diagramme |
| publishDate | 2017 |
| publishDateSearch | 2017 |
| publishDateSort | 2017 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | WALCOM 11. 2017 Hsinchu Verfasser (DE-588)1127539612 aut WALCOM: algorithms and computation 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017 : proceedings Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen (eds.) Cham Springer [2017] XXII, 474 Seiten Diagramme txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 10167 Computer science Algorithms Computer Science Algorithm Analysis and Problem Complexity Informatik Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Graphenzeichnen (DE-588)4706480-8 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf (DE-588)1071861417 Konferenzschrift gnd-content Algorithmus (DE-588)4001183-5 s Berechnungskomplexität (DE-588)4134751-1 s Approximationsalgorithmus (DE-588)4500954-5 s Graphenzeichnen (DE-588)4706480-8 s Algorithmische Geometrie (DE-588)4130267-9 s DE-604 Informatik (DE-588)4026894-9 s Graph (DE-588)4021842-9 s 1\p DE-604 Poon, Sheung-Hung edt Erscheint auch als Druck-Ausgabe 9783319539249 Erscheint auch als Online-Ausgabe 978-3-319-53925-6 Lecture notes in computer science 10167 (DE-604)BV000000607 10167 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | WALCOM: algorithms and computation 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017 : proceedings Lecture notes in computer science Computer science Algorithms Computer Science Algorithm Analysis and Problem Complexity Informatik Berechnungskomplexität (DE-588)4134751-1 gnd Graph (DE-588)4021842-9 gnd Algorithmus (DE-588)4001183-5 gnd Informatik (DE-588)4026894-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Graphenzeichnen (DE-588)4706480-8 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd |
| subject_GND | (DE-588)4134751-1 (DE-588)4021842-9 (DE-588)4001183-5 (DE-588)4026894-9 (DE-588)4500954-5 (DE-588)4706480-8 (DE-588)4130267-9 (DE-588)1071861417 |
| title | WALCOM: algorithms and computation 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017 : proceedings |
| title_auth | WALCOM: algorithms and computation 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017 : proceedings |
| title_exact_search | WALCOM: algorithms and computation 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017 : proceedings |
| title_full | WALCOM: algorithms and computation 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017 : proceedings Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen (eds.) |
| title_fullStr | WALCOM: algorithms and computation 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017 : proceedings Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen (eds.) |
| title_full_unstemmed | WALCOM: algorithms and computation 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017 : proceedings Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen (eds.) |
| title_short | WALCOM: algorithms and computation |
| title_sort | walcom algorithms and computation 11th international conference and workshops walcom 2017 hsinchu taiwan march 29 31 2017 proceedings |
| title_sub | 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017 : proceedings |
| topic | Computer science Algorithms Computer Science Algorithm Analysis and Problem Complexity Informatik Berechnungskomplexität (DE-588)4134751-1 gnd Graph (DE-588)4021842-9 gnd Algorithmus (DE-588)4001183-5 gnd Informatik (DE-588)4026894-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Graphenzeichnen (DE-588)4706480-8 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd |
| topic_facet | Computer science Algorithms Computer Science Algorithm Analysis and Problem Complexity Informatik Berechnungskomplexität Graph Algorithmus Approximationsalgorithmus Graphenzeichnen Algorithmische Geometrie Konferenzschrift |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT walcomhsinchu walcomalgorithmsandcomputation11thinternationalconferenceandworkshopswalcom2017hsinchutaiwanmarch29312017proceedings AT poonsheunghung walcomalgorithmsandcomputation11thinternationalconferenceandworkshopswalcom2017hsinchutaiwanmarch29312017proceedings |