Probabilistic Methods for Algorithmic Discrete Mathematics:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1998
|
| Schriftenreihe: | Algorithms and Combinatorics
16 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | The book gives an accessible account of modern pro- babilistic methods for analyzing combinatorial structures and algorithms. Each topic is approached in a didactic manner but the most recent developments are linked to the basic ma- terial. Extensive lists of references and a detailed index will make this a useful guide for graduate students and researchers. Special features included: - a simple treatment of Talagrand inequalities and their applications - an overview and many carefully worked out examples of the probabilistic analysis of combinatorial algorithms - a discussion of the "exact simulation" algorithm (in the context of Markov Chain Monte Carlo Methods) - a general method for finding asymptotically optimal or near optimal graph colouring, showing how the probabilistic method may be fine-tuned to explit the structure of the underlying graph - a succinct treatment of randomized algorithms and derandomization techniques |
| Beschreibung: | 1 Online-Ressource (XVII, 325 p) |
| ISBN: | 9783662127889 9783642084263 |
| ISSN: | 0937-5511 |
| DOI: | 10.1007/978-3-662-12788-9 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042423483 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s1998 |||| o||u| ||||||eng d | ||
| 020 | |a 9783662127889 |c Online |9 978-3-662-12788-9 | ||
| 020 | |a 9783642084263 |c Print |9 978-3-642-08426-3 | ||
| 024 | 7 | |a 10.1007/978-3-662-12788-9 |2 doi | |
| 035 | |a (OCoLC)863895535 | ||
| 035 | |a (DE-599)BVBBV042423483 | ||
| 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 511.6 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Habib, Michel |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Probabilistic Methods for Algorithmic Discrete Mathematics |c edited by Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed |
| 264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 1998 | |
| 300 | |a 1 Online-Ressource (XVII, 325 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Algorithms and Combinatorics |v 16 |x 0937-5511 | |
| 500 | |a The book gives an accessible account of modern pro- babilistic methods for analyzing combinatorial structures and algorithms. Each topic is approached in a didactic manner but the most recent developments are linked to the basic ma- terial. Extensive lists of references and a detailed index will make this a useful guide for graduate students and researchers. Special features included: - a simple treatment of Talagrand inequalities and their applications - an overview and many carefully worked out examples of the probabilistic analysis of combinatorial algorithms - a discussion of the "exact simulation" algorithm (in the context of Markov Chain Monte Carlo Methods) - a general method for finding asymptotically optimal or near optimal graph colouring, showing how the probabilistic method may be fine-tuned to explit the structure of the underlying graph - a succinct treatment of randomized algorithms and derandomization techniques | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Algebra / Data processing | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Distribution (Probability theory) | |
| 650 | 4 | |a Computation by Abstract Devices | |
| 650 | 4 | |a Symbolic and Algebraic Manipulation | |
| 650 | 4 | |a Probability Theory and Stochastic Processes | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Baum |g Mathematik |0 (DE-588)4004849-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Markov-Ketten-Monte-Carlo-Verfahren |0 (DE-588)4508520-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Diskrete Mathematik |0 (DE-588)4129143-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorische Wahrscheinlichkeitstheorie |0 (DE-588)4132446-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Verzweigungsprozess |0 (DE-588)4188184-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Randomisierter Algorithmus |0 (DE-588)4176929-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Probabilistischer Algorithmus |0 (DE-588)4504622-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Perkolationstheorie |0 (DE-588)4323583-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Diskrete Mathematik |0 (DE-588)4129143-8 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 2 | |a Kombinatorische Wahrscheinlichkeitstheorie |0 (DE-588)4132446-8 |D s |
| 689 | 0 | |8 2\p |5 DE-604 | |
| 689 | 1 | 0 | |a Verzweigungsprozess |0 (DE-588)4188184-9 |D s |
| 689 | 1 | 1 | |a Baum |g Mathematik |0 (DE-588)4004849-4 |D s |
| 689 | 1 | |8 3\p |5 DE-604 | |
| 689 | 2 | 0 | |a Randomisierter Algorithmus |0 (DE-588)4176929-6 |D s |
| 689 | 2 | |8 4\p |5 DE-604 | |
| 689 | 3 | 0 | |a Perkolationstheorie |0 (DE-588)4323583-9 |D s |
| 689 | 3 | |8 5\p |5 DE-604 | |
| 689 | 4 | 0 | |a Probabilistischer Algorithmus |0 (DE-588)4504622-0 |D s |
| 689 | 4 | |8 6\p |5 DE-604 | |
| 689 | 5 | 0 | |a Markov-Ketten-Monte-Carlo-Verfahren |0 (DE-588)4508520-1 |D s |
| 689 | 5 | |8 7\p |5 DE-604 | |
| 700 | 1 | |a McDiarmid, Colin |e Sonstige |4 oth | |
| 700 | 1 | |a Ramirez-Alfonsin, Jorge |e Sonstige |4 oth | |
| 700 | 1 | |a Reed, Bruce |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-662-12788-9 |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-027858900 | ||
| 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 | |
| 883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 5\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 6\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 7\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153099291459584 |
|---|---|
| any_adam_object | |
| author | Habib, Michel |
| author_facet | Habib, Michel |
| author_role | aut |
| author_sort | Habib, Michel |
| author_variant | m h mh |
| building | Verbundindex |
| bvnumber | BV042423483 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)863895535 (DE-599)BVBBV042423483 |
| 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.6 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-3-662-12788-9 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04850nmm a2200913zcb4500</leader><controlfield tag="001">BV042423483</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s1998 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783662127889</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-662-12788-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642084263</subfield><subfield code="c">Print</subfield><subfield code="9">978-3-642-08426-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-662-12788-9</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)863895535</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042423483</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">511.6</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">Habib, Michel</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Probabilistic Methods for Algorithmic Discrete Mathematics</subfield><subfield code="c">edited by Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVII, 325 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">Algorithms and Combinatorics</subfield><subfield code="v">16</subfield><subfield code="x">0937-5511</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">The book gives an accessible account of modern pro- babilistic methods for analyzing combinatorial structures and algorithms. Each topic is approached in a didactic manner but the most recent developments are linked to the basic ma- terial. Extensive lists of references and a detailed index will make this a useful guide for graduate students and researchers. Special features included: - a simple treatment of Talagrand inequalities and their applications - an overview and many carefully worked out examples of the probabilistic analysis of combinatorial algorithms - a discussion of the "exact simulation" algorithm (in the context of Markov Chain Monte Carlo Methods) - a general method for finding asymptotically optimal or near optimal graph colouring, showing how the probabilistic method may be fine-tuned to explit the structure of the underlying graph - a succinct treatment of randomized algorithms and derandomization techniques</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra / Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Distribution (Probability theory)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computation by Abstract Devices</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Symbolic and Algebraic Manipulation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Probability Theory and Stochastic Processes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Baum</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4004849-4</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">Markov-Ketten-Monte-Carlo-Verfahren</subfield><subfield code="0">(DE-588)4508520-1</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="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Wahrscheinlichkeitstheorie</subfield><subfield code="0">(DE-588)4132446-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verzweigungsprozess</subfield><subfield code="0">(DE-588)4188184-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Randomisierter Algorithmus</subfield><subfield code="0">(DE-588)4176929-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Probabilistischer Algorithmus</subfield><subfield code="0">(DE-588)4504622-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Perkolationstheorie</subfield><subfield code="0">(DE-588)4323583-9</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)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><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="1"><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="2"><subfield code="a">Kombinatorische Wahrscheinlichkeitstheorie</subfield><subfield code="0">(DE-588)4132446-8</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">Verzweigungsprozess</subfield><subfield code="0">(DE-588)4188184-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Baum</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4004849-4</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="689" ind1="2" ind2="0"><subfield code="a">Randomisierter Algorithmus</subfield><subfield code="0">(DE-588)4176929-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Perkolationstheorie</subfield><subfield code="0">(DE-588)4323583-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Probabilistischer Algorithmus</subfield><subfield code="0">(DE-588)4504622-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">6\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Markov-Ketten-Monte-Carlo-Verfahren</subfield><subfield code="0">(DE-588)4508520-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">7\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">McDiarmid, Colin</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ramirez-Alfonsin, Jorge</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Reed, Bruce</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-662-12788-9</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-027858900</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\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">5\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">6\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">7\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)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV042423483 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:13Z |
| institution | BVB |
| isbn | 9783662127889 9783642084263 |
| issn | 0937-5511 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027858900 |
| oclc_num | 863895535 |
| 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 (XVII, 325 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | Springer Berlin Heidelberg |
| record_format | marc |
| series2 | Algorithms and Combinatorics |
| spelling | Habib, Michel Verfasser aut Probabilistic Methods for Algorithmic Discrete Mathematics edited by Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed Berlin, Heidelberg Springer Berlin Heidelberg 1998 1 Online-Ressource (XVII, 325 p) txt rdacontent c rdamedia cr rdacarrier Algorithms and Combinatorics 16 0937-5511 The book gives an accessible account of modern pro- babilistic methods for analyzing combinatorial structures and algorithms. Each topic is approached in a didactic manner but the most recent developments are linked to the basic ma- terial. Extensive lists of references and a detailed index will make this a useful guide for graduate students and researchers. Special features included: - a simple treatment of Talagrand inequalities and their applications - an overview and many carefully worked out examples of the probabilistic analysis of combinatorial algorithms - a discussion of the "exact simulation" algorithm (in the context of Markov Chain Monte Carlo Methods) - a general method for finding asymptotically optimal or near optimal graph colouring, showing how the probabilistic method may be fine-tuned to explit the structure of the underlying graph - a succinct treatment of randomized algorithms and derandomization techniques Mathematics Computer science Algebra / Data processing Combinatorics Distribution (Probability theory) Computation by Abstract Devices Symbolic and Algebraic Manipulation Probability Theory and Stochastic Processes Datenverarbeitung Informatik Mathematik Baum Mathematik (DE-588)4004849-4 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Markov-Ketten-Monte-Carlo-Verfahren (DE-588)4508520-1 gnd rswk-swf Diskrete Mathematik (DE-588)4129143-8 gnd rswk-swf Kombinatorische Wahrscheinlichkeitstheorie (DE-588)4132446-8 gnd rswk-swf Verzweigungsprozess (DE-588)4188184-9 gnd rswk-swf Randomisierter Algorithmus (DE-588)4176929-6 gnd rswk-swf Probabilistischer Algorithmus (DE-588)4504622-0 gnd rswk-swf Perkolationstheorie (DE-588)4323583-9 gnd rswk-swf 1\p (DE-588)4113937-9 Hochschulschrift gnd-content Diskrete Mathematik (DE-588)4129143-8 s Algorithmus (DE-588)4001183-5 s Kombinatorische Wahrscheinlichkeitstheorie (DE-588)4132446-8 s 2\p DE-604 Verzweigungsprozess (DE-588)4188184-9 s Baum Mathematik (DE-588)4004849-4 s 3\p DE-604 Randomisierter Algorithmus (DE-588)4176929-6 s 4\p DE-604 Perkolationstheorie (DE-588)4323583-9 s 5\p DE-604 Probabilistischer Algorithmus (DE-588)4504622-0 s 6\p DE-604 Markov-Ketten-Monte-Carlo-Verfahren (DE-588)4508520-1 s 7\p DE-604 McDiarmid, Colin Sonstige oth Ramirez-Alfonsin, Jorge Sonstige oth Reed, Bruce Sonstige oth https://doi.org/10.1007/978-3-662-12788-9 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 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 6\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 7\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Habib, Michel Probabilistic Methods for Algorithmic Discrete Mathematics Mathematics Computer science Algebra / Data processing Combinatorics Distribution (Probability theory) Computation by Abstract Devices Symbolic and Algebraic Manipulation Probability Theory and Stochastic Processes Datenverarbeitung Informatik Mathematik Baum Mathematik (DE-588)4004849-4 gnd Algorithmus (DE-588)4001183-5 gnd Markov-Ketten-Monte-Carlo-Verfahren (DE-588)4508520-1 gnd Diskrete Mathematik (DE-588)4129143-8 gnd Kombinatorische Wahrscheinlichkeitstheorie (DE-588)4132446-8 gnd Verzweigungsprozess (DE-588)4188184-9 gnd Randomisierter Algorithmus (DE-588)4176929-6 gnd Probabilistischer Algorithmus (DE-588)4504622-0 gnd Perkolationstheorie (DE-588)4323583-9 gnd |
| subject_GND | (DE-588)4004849-4 (DE-588)4001183-5 (DE-588)4508520-1 (DE-588)4129143-8 (DE-588)4132446-8 (DE-588)4188184-9 (DE-588)4176929-6 (DE-588)4504622-0 (DE-588)4323583-9 (DE-588)4113937-9 |
| title | Probabilistic Methods for Algorithmic Discrete Mathematics |
| title_auth | Probabilistic Methods for Algorithmic Discrete Mathematics |
| title_exact_search | Probabilistic Methods for Algorithmic Discrete Mathematics |
| title_full | Probabilistic Methods for Algorithmic Discrete Mathematics edited by Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed |
| title_fullStr | Probabilistic Methods for Algorithmic Discrete Mathematics edited by Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed |
| title_full_unstemmed | Probabilistic Methods for Algorithmic Discrete Mathematics edited by Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed |
| title_short | Probabilistic Methods for Algorithmic Discrete Mathematics |
| title_sort | probabilistic methods for algorithmic discrete mathematics |
| topic | Mathematics Computer science Algebra / Data processing Combinatorics Distribution (Probability theory) Computation by Abstract Devices Symbolic and Algebraic Manipulation Probability Theory and Stochastic Processes Datenverarbeitung Informatik Mathematik Baum Mathematik (DE-588)4004849-4 gnd Algorithmus (DE-588)4001183-5 gnd Markov-Ketten-Monte-Carlo-Verfahren (DE-588)4508520-1 gnd Diskrete Mathematik (DE-588)4129143-8 gnd Kombinatorische Wahrscheinlichkeitstheorie (DE-588)4132446-8 gnd Verzweigungsprozess (DE-588)4188184-9 gnd Randomisierter Algorithmus (DE-588)4176929-6 gnd Probabilistischer Algorithmus (DE-588)4504622-0 gnd Perkolationstheorie (DE-588)4323583-9 gnd |
| topic_facet | Mathematics Computer science Algebra / Data processing Combinatorics Distribution (Probability theory) Computation by Abstract Devices Symbolic and Algebraic Manipulation Probability Theory and Stochastic Processes Datenverarbeitung Informatik Mathematik Baum Mathematik Algorithmus Markov-Ketten-Monte-Carlo-Verfahren Diskrete Mathematik Kombinatorische Wahrscheinlichkeitstheorie Verzweigungsprozess Randomisierter Algorithmus Probabilistischer Algorithmus Perkolationstheorie Hochschulschrift |
| url | https://doi.org/10.1007/978-3-662-12788-9 |
| work_keys_str_mv | AT habibmichel probabilisticmethodsforalgorithmicdiscretemathematics AT mcdiarmidcolin probabilisticmethodsforalgorithmicdiscretemathematics AT ramirezalfonsinjorge probabilisticmethodsforalgorithmicdiscretemathematics AT reedbruce probabilisticmethodsforalgorithmicdiscretemathematics |