2007 proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO):
Gespeichert in:
Weitere beteiligte Personen: | , |
---|---|
Format: | Elektronisch Tagungsbericht E-Book |
Sprache: | Englisch |
Veröffentlicht: |
Philadelphia, PA
Society for Industrial and Applied Mathematics, SIAM
[2007]
|
Schlagwörter: | |
Links: | https://doi.org/10.1137/1.9781611972979 https://doi.org/10.1137/1.9781611972979 https://doi.org/10.1137/1.9781611972979 https://doi.org/10.1137/1.9781611972979 https://doi.org/10.1137/1.9781611972979 |
Abstract: | The fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO07) will be held in New Orleans on January 6, 2007 at the Astor Crowne Plaza Hotel, New Orleans, Louisiana. The aim of the ANALCO workshop is to provide a forum for the presentation of original research in the analysis of algorithms and associated combinatorial structures. We invite both papers that study properties of fundamental combinatorial structures that arise in practical computational applications (such as permutations, trees, strings, tries, and graphs) and papers that address the precise analysis of algorithms for processing such structures, including: average-case analysis; analysis of moments, extrema, and distributions; probabilistic analysis of randomized algorithms, and so on. Submissions that present significant new information about classic algorithms are welcome, as are new analyses of new algorithms that present unique analytic challenges. We also invite submissions that address tools and techniques for the analysis of algorithms and combinatorial structures, both mathematical and computational. The scientific program will include invited talks, contributed research papers, and ample time for discussion and debate of topics in this area |
Umfang: | 1 Online-Ressource (285 Seiten) Illustrationen |
ISBN: | 9781611972979 |
DOI: | 10.1137/1.9781611972979 |
Internformat
MARC
LEADER | 00000nam a22000001c 4500 | ||
---|---|---|---|
001 | BV047260356 | ||
003 | DE-604 | ||
005 | 20221019 | ||
007 | cr|uuu---uuuuu | ||
008 | 210429s2007 xx a||| o|||| 10||| eng d | ||
020 | |a 9781611972979 |c electronic |9 978-1-61197-297-9 | ||
024 | 7 | |a 10.1137/1.9781611972979 |2 doi | |
035 | |a (ZDB-72-SIB)978-1-61197-297-9 | ||
035 | |a (OCoLC)1249663446 | ||
035 | |a (DE-599)BVBBV047260356 | ||
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 2007 proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) |c editors, Daniel Panario and Robert Sedgewick. |
246 | 1 | 3 | |a ANALCO07 |
264 | 1 | |a Philadelphia, PA |b Society for Industrial and Applied Mathematics, SIAM |c [2007] | |
300 | |a 1 Online-Ressource (285 Seiten) |b Illustrationen | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
520 | 3 | |a The fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO07) will be held in New Orleans on January 6, 2007 at the Astor Crowne Plaza Hotel, New Orleans, Louisiana. The aim of the ANALCO workshop is to provide a forum for the presentation of original research in the analysis of algorithms and associated combinatorial structures. We invite both papers that study properties of fundamental combinatorial structures that arise in practical computational applications (such as permutations, trees, strings, tries, and graphs) and papers that address the precise analysis of algorithms for processing such structures, including: average-case analysis; analysis of moments, extrema, and distributions; probabilistic analysis of randomized algorithms, and so on. Submissions that present significant new information about classic algorithms are welcome, as are new analyses of new algorithms that present unique analytic challenges. We also invite submissions that address tools and techniques for the analysis of algorithms and combinatorial structures, both mathematical and computational. The scientific program will include invited talks, contributed research papers, and ample time for discussion and debate of topics in this area | |
650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Diskrete Mathematik |0 (DE-588)4129143-8 |2 gnd |9 rswk-swf |
653 | 0 | |a Computer algorithms ; Congresses | |
653 | 0 | |a Combinatorial analysis ; Congresses | |
653 | 0 | |a Discrete mathematics and graph theory | |
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 Diskrete Mathematik |0 (DE-588)4129143-8 |D s |
689 | 0 | 2 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Panario, Daniel |d 1959- |0 (DE-588)1047231301 |4 edt | |
700 | 1 | |a Sedgewick, Robert |d 1946- |0 (DE-588)112418317 |4 edt | |
711 | 2 | |a Workshop on Analytic Algorithmics and Combinatorics |n 4 |d 2007 |c New Orleans, La. |j Sonstige |0 (DE-588)6516155-5 |4 oth | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-1-61197-297-9 |
856 | 4 | 0 | |u https://doi.org/10.1137/1.9781611972979 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-72-SIB | ||
912 | |a ZDB-72-SIA | ||
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-032664234 | |
966 | e | |u https://doi.org/10.1137/1.9781611972979 |l DE-91 |p ZDB-72-SIA |q TUM_Lizenz |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1137/1.9781611972979 |l DE-20 |p ZDB-72-SIA |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1137/1.9781611972979 |l DE-706 |p ZDB-72-SIB |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1137/1.9781611972979 |l DE-29 |p ZDB-72-SIA |x Verlag |3 Volltext |
Datensatz im Suchindex
DE-BY-TUM_katkey | 2694048 |
---|---|
_version_ | 1821936496627679233 |
any_adam_object | |
author2 | Panario, Daniel 1959- Sedgewick, Robert 1946- |
author2_role | edt edt |
author2_variant | d p dp r s rs |
author_GND | (DE-588)1047231301 (DE-588)112418317 |
author_facet | Panario, Daniel 1959- Sedgewick, Robert 1946- |
building | Verbundindex |
bvnumber | BV047260356 |
collection | ZDB-72-SIB ZDB-72-SIA |
ctrlnum | (ZDB-72-SIB)978-1-61197-297-9 (OCoLC)1249663446 (DE-599)BVBBV047260356 |
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 |
doi_str_mv | 10.1137/1.9781611972979 |
format | Electronic Conference Proceeding eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03750nam a22005651c 4500</leader><controlfield tag="001">BV047260356</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20221019 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">210429s2007 xx a||| o|||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781611972979</subfield><subfield code="c">electronic</subfield><subfield code="9">978-1-61197-297-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1137/1.9781611972979</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-72-SIB)978-1-61197-297-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1249663446</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047260356</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">2007 proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)</subfield><subfield code="c">editors, Daniel Panario and Robert Sedgewick.</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">ANALCO07</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia, PA</subfield><subfield code="b">Society for Industrial and Applied Mathematics, SIAM</subfield><subfield code="c">[2007]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (285 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 fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO07) will be held in New Orleans on January 6, 2007 at the Astor Crowne Plaza Hotel, New Orleans, Louisiana. The aim of the ANALCO workshop is to provide a forum for the presentation of original research in the analysis of algorithms and associated combinatorial structures. We invite both papers that study properties of fundamental combinatorial structures that arise in practical computational applications (such as permutations, trees, strings, tries, and graphs) and papers that address the precise analysis of algorithms for processing such structures, including: average-case analysis; analysis of moments, extrema, and distributions; probabilistic analysis of randomized algorithms, and so on. Submissions that present significant new information about classic algorithms are welcome, as are new analyses of new algorithms that present unique analytic challenges. We also invite submissions that address tools and techniques for the analysis of algorithms and combinatorial structures, both mathematical and computational. The scientific program will include invited talks, contributed research papers, and ample time for discussion and debate of topics in this area</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</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">Diskrete Mathematik</subfield><subfield code="0">(DE-588)4129143-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computer algorithms ; Congresses</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Combinatorial analysis ; 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="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">Diskrete Mathematik</subfield><subfield code="0">(DE-588)4129143-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Panario, Daniel</subfield><subfield code="d">1959-</subfield><subfield code="0">(DE-588)1047231301</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sedgewick, Robert</subfield><subfield code="d">1946-</subfield><subfield code="0">(DE-588)112418317</subfield><subfield code="4">edt</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">Workshop on Analytic Algorithmics and Combinatorics</subfield><subfield code="n">4</subfield><subfield code="d">2007</subfield><subfield code="c">New Orleans, La.</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)6516155-5</subfield><subfield code="4">oth</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">978-1-61197-297-9</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1137/1.9781611972979</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></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-72-SIA</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032664234</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611972979</subfield><subfield code="l">DE-91</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.9781611972979</subfield><subfield code="l">DE-20</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.9781611972979</subfield><subfield code="l">DE-706</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.9781611972979</subfield><subfield code="l">DE-29</subfield><subfield code="p">ZDB-72-SIA</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.BV047260356 |
illustrated | Illustrated |
indexdate | 2024-12-20T19:14:20Z |
institution | BVB |
institution_GND | (DE-588)6516155-5 |
isbn | 9781611972979 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032664234 |
oclc_num | 1249663446 |
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 (285 Seiten) Illustrationen |
psigel | ZDB-72-SIB ZDB-72-SIA ZDB-72-SIA TUM_Lizenz |
publishDate | 2007 |
publishDateSearch | 2007 |
publishDateSort | 2007 |
publisher | Society for Industrial and Applied Mathematics, SIAM |
record_format | marc |
spellingShingle | 2007 proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) Graphentheorie (DE-588)4113782-6 gnd Algorithmus (DE-588)4001183-5 gnd Diskrete Mathematik (DE-588)4129143-8 gnd |
subject_GND | (DE-588)4113782-6 (DE-588)4001183-5 (DE-588)4129143-8 (DE-588)1071861417 |
title | 2007 proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) |
title_alt | ANALCO07 |
title_auth | 2007 proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) |
title_exact_search | 2007 proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) |
title_full | 2007 proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) editors, Daniel Panario and Robert Sedgewick. |
title_fullStr | 2007 proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) editors, Daniel Panario and Robert Sedgewick. |
title_full_unstemmed | 2007 proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) editors, Daniel Panario and Robert Sedgewick. |
title_short | 2007 proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) |
title_sort | 2007 proceedings of the fourth workshop on analytic algorithmics and combinatorics analco |
topic | Graphentheorie (DE-588)4113782-6 gnd Algorithmus (DE-588)4001183-5 gnd Diskrete Mathematik (DE-588)4129143-8 gnd |
topic_facet | Graphentheorie Algorithmus Diskrete Mathematik Konferenzschrift |
url | https://doi.org/10.1137/1.9781611972979 |
work_keys_str_mv | AT panariodaniel 2007proceedingsofthefourthworkshoponanalyticalgorithmicsandcombinatoricsanalco AT sedgewickrobert 2007proceedingsofthefourthworkshoponanalyticalgorithmicsandcombinatoricsanalco AT workshoponanalyticalgorithmicsandcombinatoricsneworleansla 2007proceedingsofthefourthworkshoponanalyticalgorithmicsandcombinatoricsanalco AT panariodaniel analco07 AT sedgewickrobert analco07 AT workshoponanalyticalgorithmicsandcombinatoricsneworleansla analco07 |