Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probabilities
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Basel
Birkhäuser Basel
2002
|
| Schriftenreihe: | Trends in Mathematics
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | These are the Proceedings of the International Colloquium of Mathematics and Computer Science held at the University of Versailles-St-Quentin, September 18-20,2002. This colloquium is the second one in a now regularly established series the first venue in September 2000 in Versailles. The present issue is cen following tered around Combinatorics, Random Graphs and Networks, Algorithms Analysis and Trees, Branching Processes and Trees, Applied Random Combinatorics. The contributions have been carefully reviewed for their scientific quality and originality by the Scientific Committee chaired by P. Flajolet and composed by P. Chassaing, B. Chauvin, M. Drmota, J. Fill, P. Flajolet, A. Frieze, D. Gardy, S. Janson, C. Krattenthaler, G. Louchard, A. Mokkadem, R. Pemantle, P. Robert, J. Spencer, B. Ycart. We do thank them for their impressive work. We also thank the invited speakers: D. Aldous, L. Devroye, S. Janson, M. Krivelevich, B. Pittel, H. Prodinger, M. Steele, the authors of submitted papers and the participants for their contribution to the success of the conference. A. Baffert and C. Ducoin deserve special thanks for their kind and efficient contribution to the material preparation of the colloquium. Finally, we express our acknowledgements to the laboratory of Mathemat ics (LAMA), the laboratory of Computer Science (PRISM), the University of Versailles-St-Quentin, the Centre National de la Recherche Scientifique (CNRS) and the Institut National de Recherche en Informatique et Automatique (INRIA) for providing generous financial and material support |
| Beschreibung: | 1 Online-Ressource (XIII, 543 p) |
| ISBN: | 9783034882118 9783034894753 |
| DOI: | 10.1007/978-3-0348-8211-8 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV042422065 | ||
| 003 | DE-604 | ||
| 005 | 20180626 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s2002 |||| o||u| ||||||eng d | ||
| 020 | |a 9783034882118 |c Online |9 978-3-0348-8211-8 | ||
| 020 | |a 9783034894753 |c Print |9 978-3-0348-9475-3 | ||
| 024 | 7 | |a 10.1007/978-3-0348-8211-8 |2 doi | |
| 035 | |a (OCoLC)1184322357 | ||
| 035 | |a (DE-599)BVBBV042422065 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 005.74 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Chauvin, Brigitte |e Verfasser |0 (DE-588)170894835 |4 aut | |
| 245 | 1 | 0 | |a Mathematics and Computer Science II |b Algorithms, Trees, Combinatorics and Probabilities |c edited by Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Abdelkader Mokkadem |
| 264 | 1 | |a Basel |b Birkhäuser Basel |c 2002 | |
| 300 | |a 1 Online-Ressource (XIII, 543 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Trends in Mathematics | |
| 500 | |a These are the Proceedings of the International Colloquium of Mathematics and Computer Science held at the University of Versailles-St-Quentin, September 18-20,2002. This colloquium is the second one in a now regularly established series the first venue in September 2000 in Versailles. The present issue is cen following tered around Combinatorics, Random Graphs and Networks, Algorithms Analysis and Trees, Branching Processes and Trees, Applied Random Combinatorics. The contributions have been carefully reviewed for their scientific quality and originality by the Scientific Committee chaired by P. Flajolet and composed by P. Chassaing, B. Chauvin, M. Drmota, J. Fill, P. Flajolet, A. Frieze, D. Gardy, S. Janson, C. Krattenthaler, G. Louchard, A. Mokkadem, R. Pemantle, P. Robert, J. Spencer, B. Ycart. We do thank them for their impressive work. We also thank the invited speakers: D. Aldous, L. Devroye, S. Janson, M. Krivelevich, B. Pittel, H. Prodinger, M. Steele, the authors of submitted papers and the participants for their contribution to the success of the conference. A. Baffert and C. Ducoin deserve special thanks for their kind and efficient contribution to the material preparation of the colloquium. Finally, we express our acknowledgements to the laboratory of Mathemat ics (LAMA), the laboratory of Computer Science (PRISM), the University of Versailles-St-Quentin, the Centre National de la Recherche Scientifique (CNRS) and the Institut National de Recherche en Informatique et Automatique (INRIA) for providing generous financial and material support | ||
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Coding theory | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Systems theory | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computer Science | |
| 650 | 4 | |a Data Structures, Cryptology and Information Theory | |
| 650 | 4 | |a Coding and Information Theory | |
| 650 | 4 | |a Discrete Mathematics in Computer Science | |
| 650 | 4 | |a Probability and Statistics in Computer Science | |
| 650 | 4 | |a Systems Theory, Control | |
| 650 | 4 | |a Informatik | |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-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 Mathematische Methode |0 (DE-588)4155620-3 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)1071861417 |a Konferenzschrift |y 2002 |z Versailles |2 gnd-content | |
| 689 | 0 | 0 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | 1 | |a Mathematische Methode |0 (DE-588)4155620-3 |D s |
| 689 | 0 | |8 2\p |5 DE-604 | |
| 689 | 1 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 1 | |8 3\p |5 DE-604 | |
| 700 | 1 | |a Flajolet, Philippe |e Sonstige |4 oth | |
| 700 | 1 | |a Gardy, Danièle |e Sonstige |4 oth | |
| 700 | 1 | |a Mokkadem, Abdelkader |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-0348-8211-8 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027857482 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153095971667968 |
|---|---|
| any_adam_object | |
| author | Chauvin, Brigitte |
| author_GND | (DE-588)170894835 |
| author_facet | Chauvin, Brigitte |
| author_role | aut |
| author_sort | Chauvin, Brigitte |
| author_variant | b c bc |
| building | Verbundindex |
| bvnumber | BV042422065 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)1184322357 (DE-599)BVBBV042422065 |
| dewey-full | 005.74 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.74 |
| dewey-search | 005.74 |
| dewey-sort | 15.74 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1007/978-3-0348-8211-8 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04324nmm a2200697zc 4500</leader><controlfield tag="001">BV042422065</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180626 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2002 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783034882118</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-0348-8211-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783034894753</subfield><subfield code="c">Print</subfield><subfield code="9">978-3-0348-9475-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-0348-8211-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1184322357</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042422065</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-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.74</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chauvin, Brigitte</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)170894835</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Mathematics and Computer Science II</subfield><subfield code="b">Algorithms, Trees, Combinatorics and Probabilities</subfield><subfield code="c">edited by Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Abdelkader Mokkadem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Basel</subfield><subfield code="b">Birkhäuser Basel</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIII, 543 p)</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="490" ind1="0" ind2=" "><subfield code="a">Trends in Mathematics</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">These are the Proceedings of the International Colloquium of Mathematics and Computer Science held at the University of Versailles-St-Quentin, September 18-20,2002. This colloquium is the second one in a now regularly established series the first venue in September 2000 in Versailles. The present issue is cen following tered around Combinatorics, Random Graphs and Networks, Algorithms Analysis and Trees, Branching Processes and Trees, Applied Random Combinatorics. The contributions have been carefully reviewed for their scientific quality and originality by the Scientific Committee chaired by P. Flajolet and composed by P. Chassaing, B. Chauvin, M. Drmota, J. Fill, P. Flajolet, A. Frieze, D. Gardy, S. Janson, C. Krattenthaler, G. Louchard, A. Mokkadem, R. Pemantle, P. Robert, J. Spencer, B. Ycart. We do thank them for their impressive work. We also thank the invited speakers: D. Aldous, L. Devroye, S. Janson, M. Krivelevich, B. Pittel, H. Prodinger, M. Steele, the authors of submitted papers and the participants for their contribution to the success of the conference. A. Baffert and C. Ducoin deserve special thanks for their kind and efficient contribution to the material preparation of the colloquium. Finally, we express our acknowledgements to the laboratory of Mathemat ics (LAMA), the laboratory of Computer Science (PRISM), the University of Versailles-St-Quentin, the Centre National de la Recherche Scientifique (CNRS) and the Institut National de Recherche en Informatique et Automatique (INRIA) for providing generous financial and material support</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Coding theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Systems theory</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">Data Structures, Cryptology and Information Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Coding and Information Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Probability and Statistics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Systems Theory, Control</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-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">Mathematische Methode</subfield><subfield code="0">(DE-588)4155620-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2002</subfield><subfield code="z">Versailles</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2="1"><subfield code="a">Mathematische Methode</subfield><subfield code="0">(DE-588)4155620-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Flajolet, Philippe</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gardy, Danièle</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mokkadem, Abdelkader</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-0348-8211-8</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027857482</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\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 | 1\p (DE-588)1071861417 Konferenzschrift 2002 Versailles gnd-content |
| genre_facet | Konferenzschrift 2002 Versailles |
| id | DE-604.BV042422065 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:10Z |
| institution | BVB |
| isbn | 9783034882118 9783034894753 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027857482 |
| oclc_num | 1184322357 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (XIII, 543 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Birkhäuser Basel |
| record_format | marc |
| series2 | Trends in Mathematics |
| spelling | Chauvin, Brigitte Verfasser (DE-588)170894835 aut Mathematics and Computer Science II Algorithms, Trees, Combinatorics and Probabilities edited by Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Abdelkader Mokkadem Basel Birkhäuser Basel 2002 1 Online-Ressource (XIII, 543 p) txt rdacontent c rdamedia cr rdacarrier Trends in Mathematics These are the Proceedings of the International Colloquium of Mathematics and Computer Science held at the University of Versailles-St-Quentin, September 18-20,2002. This colloquium is the second one in a now regularly established series the first venue in September 2000 in Versailles. The present issue is cen following tered around Combinatorics, Random Graphs and Networks, Algorithms Analysis and Trees, Branching Processes and Trees, Applied Random Combinatorics. The contributions have been carefully reviewed for their scientific quality and originality by the Scientific Committee chaired by P. Flajolet and composed by P. Chassaing, B. Chauvin, M. Drmota, J. Fill, P. Flajolet, A. Frieze, D. Gardy, S. Janson, C. Krattenthaler, G. Louchard, A. Mokkadem, R. Pemantle, P. Robert, J. Spencer, B. Ycart. We do thank them for their impressive work. We also thank the invited speakers: D. Aldous, L. Devroye, S. Janson, M. Krivelevich, B. Pittel, H. Prodinger, M. Steele, the authors of submitted papers and the participants for their contribution to the success of the conference. A. Baffert and C. Ducoin deserve special thanks for their kind and efficient contribution to the material preparation of the colloquium. Finally, we express our acknowledgements to the laboratory of Mathemat ics (LAMA), the laboratory of Computer Science (PRISM), the University of Versailles-St-Quentin, the Centre National de la Recherche Scientifique (CNRS) and the Institut National de Recherche en Informatique et Automatique (INRIA) for providing generous financial and material support Computer science Data structures (Computer science) Coding theory Computational complexity Systems theory Algorithms Computer Science Data Structures, Cryptology and Information Theory Coding and Information Theory Discrete Mathematics in Computer Science Probability and Statistics in Computer Science Systems Theory, Control Informatik Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Mathematische Methode (DE-588)4155620-3 gnd rswk-swf 1\p (DE-588)1071861417 Konferenzschrift 2002 Versailles gnd-content Informatik (DE-588)4026894-9 s Mathematische Methode (DE-588)4155620-3 s 2\p DE-604 Theoretische Informatik (DE-588)4196735-5 s 3\p DE-604 Flajolet, Philippe Sonstige oth Gardy, Danièle Sonstige oth Mokkadem, Abdelkader Sonstige oth https://doi.org/10.1007/978-3-0348-8211-8 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Chauvin, Brigitte Mathematics and Computer Science II Algorithms, Trees, Combinatorics and Probabilities Computer science Data structures (Computer science) Coding theory Computational complexity Systems theory Algorithms Computer Science Data Structures, Cryptology and Information Theory Coding and Information Theory Discrete Mathematics in Computer Science Probability and Statistics in Computer Science Systems Theory, Control Informatik Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd Mathematische Methode (DE-588)4155620-3 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)4026894-9 (DE-588)4155620-3 (DE-588)1071861417 |
| title | Mathematics and Computer Science II Algorithms, Trees, Combinatorics and Probabilities |
| title_auth | Mathematics and Computer Science II Algorithms, Trees, Combinatorics and Probabilities |
| title_exact_search | Mathematics and Computer Science II Algorithms, Trees, Combinatorics and Probabilities |
| title_full | Mathematics and Computer Science II Algorithms, Trees, Combinatorics and Probabilities edited by Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Abdelkader Mokkadem |
| title_fullStr | Mathematics and Computer Science II Algorithms, Trees, Combinatorics and Probabilities edited by Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Abdelkader Mokkadem |
| title_full_unstemmed | Mathematics and Computer Science II Algorithms, Trees, Combinatorics and Probabilities edited by Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Abdelkader Mokkadem |
| title_short | Mathematics and Computer Science II |
| title_sort | mathematics and computer science ii algorithms trees combinatorics and probabilities |
| title_sub | Algorithms, Trees, Combinatorics and Probabilities |
| topic | Computer science Data structures (Computer science) Coding theory Computational complexity Systems theory Algorithms Computer Science Data Structures, Cryptology and Information Theory Coding and Information Theory Discrete Mathematics in Computer Science Probability and Statistics in Computer Science Systems Theory, Control Informatik Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd Mathematische Methode (DE-588)4155620-3 gnd |
| topic_facet | Computer science Data structures (Computer science) Coding theory Computational complexity Systems theory Algorithms Computer Science Data Structures, Cryptology and Information Theory Coding and Information Theory Discrete Mathematics in Computer Science Probability and Statistics in Computer Science Systems Theory, Control Informatik Theoretische Informatik Mathematische Methode Konferenzschrift 2002 Versailles |
| url | https://doi.org/10.1007/978-3-0348-8211-8 |
| work_keys_str_mv | AT chauvinbrigitte mathematicsandcomputerscienceiialgorithmstreescombinatoricsandprobabilities AT flajoletphilippe mathematicsandcomputerscienceiialgorithmstreescombinatoricsandprobabilities AT gardydaniele mathematicsandcomputerscienceiialgorithmstreescombinatoricsandprobabilities AT mokkademabdelkader mathematicsandcomputerscienceiialgorithmstreescombinatoricsandprobabilities |