2019 proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX):
The aim of ALENEX is to provide a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical submissions will include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the...
Gespeichert in:
Weitere Verfasser: | , |
---|---|
Format: | Elektronisch Tagungsbericht E-Book |
Sprache: | English |
Veröffentlicht: |
Philadelphia, Pennsylvania
Society for Industrial and Applied Mathematics, SIAM
[2019]
|
Schlagworte: | |
Online-Zugang: | TUM01 UBW01 UBY01 UER01 URL des Erstveröffentlichers |
Zusammenfassung: | The aim of ALENEX is to provide a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical submissions will include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice. We also invite submissions that address methodological issues and standards in the experimental evaluation of algorithms and data structures. Some possible areas of applied algorithmic research include but are not limited to databases; networks, including web applications; operations research; and computational problems in the natural sciences or engineering. Submissions are encouraged that address algorithms and data structures for advanced models of computing including memory hierarchies and parallel computing, ranging from instruction parallelism over multicore computing to exascale and cloud computing. The annual Meeting on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical contributions include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice |
Beschreibung: | 1 Online-Ressource (225 Seiten) Illustrationen |
ISBN: | 9781611975499 |
DOI: | 10.1137/1.9781611975499 |
Internformat
MARC
LEADER | 00000nmm a22000001c 4500 | ||
---|---|---|---|
001 | BV047262530 | ||
003 | DE-604 | ||
005 | 20221017 | ||
006 | a |||| 10||| | ||
007 | cr|uuu---uuuuu | ||
008 | 210429s2019 |||| o||u| ||||||eng d | ||
020 | |a 9781611975499 |c electronic |9 978-1-61197-549-9 | ||
024 | 7 | |a 10.1137/1.9781611975499 |2 doi | |
035 | |a (ZDB-72-SIB)978-1-61197-549-9 | ||
035 | |a (OCoLC)1249665383 | ||
035 | |a (DE-599)BVBBV047262530 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-706 |a DE-83 |a DE-20 |a DE-29 |a DE-91 | ||
082 | 0 | |a 511/.6 |2 23 | |
245 | 1 | 0 | |a 2019 proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) |c Stephen Kobourov and Henning Meyerhenke |
246 | 1 | 3 | |a ALENEX2019 |
246 | 1 | 3 | |a 2019 Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX) |
264 | 1 | |a Philadelphia, Pennsylvania |b Society for Industrial and Applied Mathematics, SIAM |c [2019] | |
300 | |a 1 Online-Ressource (225 Seiten) |b Illustrationen | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
520 | 3 | |a The aim of ALENEX is to provide a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical submissions will include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice. We also invite submissions that address methodological issues and standards in the experimental evaluation of algorithms and data structures. Some possible areas of applied algorithmic research include but are not limited to databases; networks, including web applications; operations research; and computational problems in the natural sciences or engineering. Submissions are encouraged that address algorithms and data structures for advanced models of computing including memory hierarchies and parallel computing, ranging from instruction parallelism over multicore computing to exascale and cloud computing. The annual Meeting on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical contributions include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice | |
653 | 0 | |a Computer algorithms ; Experiments ; Congresses | |
653 | 0 | |a Software engineering ; Experiments ; Congresses | |
653 | 0 | |a Discrete mathematics and graph theory | |
655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
700 | 1 | |a Kobourov, Stephen G. |4 edt | |
700 | 1 | |a Meyerhenke, Henning |d 1978- |4 edt | |
711 | 2 | |a ALENEX |n 21. |d 2019 |c San Diego, Calif. |j Sonstige |0 (DE-588)1186817364 |4 oth | |
856 | 4 | 0 | |u https://doi.org/10.1137/1.9781611975499 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-72-SIB |a ZDB-72-SIA | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-032666362 | ||
966 | e | |u https://doi.org/10.1137/1.9781611975499 |l TUM01 |p ZDB-72-SIA |q TUM_Lizenz |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1137/1.9781611975499 |l UBW01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1137/1.9781611975499 |l UBY01 |p ZDB-72-SIB |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1137/1.9781611975499 |l UER01 |p ZDB-72-SIA |q UER_Paketkauf |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804182413068206080 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author2 | Kobourov, Stephen G. Meyerhenke, Henning 1978- |
author2_role | edt edt |
author2_variant | s g k sg sgk h m hm |
author_facet | Kobourov, Stephen G. Meyerhenke, Henning 1978- |
building | Verbundindex |
bvnumber | BV047262530 |
collection | ZDB-72-SIB ZDB-72-SIA |
ctrlnum | (ZDB-72-SIB)978-1-61197-549-9 (OCoLC)1249665383 (DE-599)BVBBV047262530 |
dewey-full | 511/.6 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511/.6 |
dewey-search | 511/.6 |
dewey-sort | 3511 16 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
discipline_str_mv | Mathematik |
doi_str_mv | 10.1137/1.9781611975499 |
format | Electronic Conference Proceeding eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03462nmm a22004811c 4500</leader><controlfield tag="001">BV047262530</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20221017 </controlfield><controlfield tag="006">a |||| 10||| </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">210429s2019 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781611975499</subfield><subfield code="c">electronic</subfield><subfield code="9">978-1-61197-549-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1137/1.9781611975499</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-72-SIB)978-1-61197-549-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1249665383</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047262530</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-91</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.6</subfield><subfield code="2">23</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">2019 proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX)</subfield><subfield code="c">Stephen Kobourov and Henning Meyerhenke</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">ALENEX2019</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">2019 Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia, Pennsylvania</subfield><subfield code="b">Society for Industrial and Applied Mathematics, SIAM</subfield><subfield code="c">[2019]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (225 Seiten)</subfield><subfield code="b">Illustrationen</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="520" ind1="3" ind2=" "><subfield code="a">The aim of ALENEX is to provide a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical submissions will include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice. We also invite submissions that address methodological issues and standards in the experimental evaluation of algorithms and data structures. Some possible areas of applied algorithmic research include but are not limited to databases; networks, including web applications; operations research; and computational problems in the natural sciences or engineering. Submissions are encouraged that address algorithms and data structures for advanced models of computing including memory hierarchies and parallel computing, ranging from instruction parallelism over multicore computing to exascale and cloud computing. The annual Meeting on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical contributions include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computer algorithms ; Experiments ; Congresses</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Software engineering ; Experiments ; Congresses</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Discrete mathematics and graph theory</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="700" ind1="1" ind2=" "><subfield code="a">Kobourov, Stephen G.</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Meyerhenke, Henning</subfield><subfield code="d">1978-</subfield><subfield code="4">edt</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">ALENEX</subfield><subfield code="n">21.</subfield><subfield code="d">2019</subfield><subfield code="c">San Diego, Calif.</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)1186817364</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1137/1.9781611975499</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-72-SIB</subfield><subfield code="a">ZDB-72-SIA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032666362</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611975499</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="q">TUM_Lizenz</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611975499</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611975499</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-72-SIB</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611975499</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="q">UER_Paketkauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift gnd-content |
genre_facet | Konferenzschrift |
id | DE-604.BV047262530 |
illustrated | Not Illustrated |
index_date | 2024-07-03T17:11:39Z |
indexdate | 2024-07-10T09:07:09Z |
institution | BVB |
institution_GND | (DE-588)1186817364 |
isbn | 9781611975499 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032666362 |
oclc_num | 1249665383 |
open_access_boolean | |
owner | DE-706 DE-83 DE-20 DE-29 DE-91 DE-BY-TUM |
owner_facet | DE-706 DE-83 DE-20 DE-29 DE-91 DE-BY-TUM |
physical | 1 Online-Ressource (225 Seiten) Illustrationen |
psigel | ZDB-72-SIB ZDB-72-SIA ZDB-72-SIA TUM_Lizenz ZDB-72-SIA UER_Paketkauf |
publishDate | 2019 |
publishDateSearch | 2019 |
publishDateSort | 2019 |
publisher | Society for Industrial and Applied Mathematics, SIAM |
record_format | marc |
spelling | 2019 proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) Stephen Kobourov and Henning Meyerhenke ALENEX2019 2019 Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX) Philadelphia, Pennsylvania Society for Industrial and Applied Mathematics, SIAM [2019] 1 Online-Ressource (225 Seiten) Illustrationen txt rdacontent c rdamedia cr rdacarrier The aim of ALENEX is to provide a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical submissions will include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice. We also invite submissions that address methodological issues and standards in the experimental evaluation of algorithms and data structures. Some possible areas of applied algorithmic research include but are not limited to databases; networks, including web applications; operations research; and computational problems in the natural sciences or engineering. Submissions are encouraged that address algorithms and data structures for advanced models of computing including memory hierarchies and parallel computing, ranging from instruction parallelism over multicore computing to exascale and cloud computing. The annual Meeting on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical contributions include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice Computer algorithms ; Experiments ; Congresses Software engineering ; Experiments ; Congresses Discrete mathematics and graph theory (DE-588)1071861417 Konferenzschrift gnd-content Kobourov, Stephen G. edt Meyerhenke, Henning 1978- edt ALENEX 21. 2019 San Diego, Calif. Sonstige (DE-588)1186817364 oth https://doi.org/10.1137/1.9781611975499 Verlag URL des Erstveröffentlichers Volltext |
spellingShingle | 2019 proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) |
subject_GND | (DE-588)1071861417 |
title | 2019 proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) |
title_alt | ALENEX2019 2019 Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX) |
title_auth | 2019 proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) |
title_exact_search | 2019 proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) |
title_exact_search_txtP | 2019 proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) |
title_full | 2019 proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) Stephen Kobourov and Henning Meyerhenke |
title_fullStr | 2019 proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) Stephen Kobourov and Henning Meyerhenke |
title_full_unstemmed | 2019 proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) Stephen Kobourov and Henning Meyerhenke |
title_short | 2019 proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) |
title_sort | 2019 proceedings of the twenty first workshop on algorithm engineering and experiments alenex |
topic_facet | Konferenzschrift |
url | https://doi.org/10.1137/1.9781611975499 |
work_keys_str_mv | AT kobourovstepheng 2019proceedingsofthetwentyfirstworkshoponalgorithmengineeringandexperimentsalenex AT meyerhenkehenning 2019proceedingsofthetwentyfirstworkshoponalgorithmengineeringandexperimentsalenex AT alenexsandiegocalif 2019proceedingsofthetwentyfirstworkshoponalgorithmengineeringandexperimentsalenex AT kobourovstepheng alenex2019 AT meyerhenkehenning alenex2019 AT alenexsandiegocalif alenex2019 AT kobourovstepheng 2019proceedingsofthemeetingonalgorithmengineeringandexperimentsalenex AT meyerhenkehenning 2019proceedingsofthemeetingonalgorithmengineeringandexperimentsalenex AT alenexsandiegocalif 2019proceedingsofthemeetingonalgorithmengineeringandexperimentsalenex |