Concentration of measure for the analysis of randomized algorithms /:
Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern applications. This book presents a coherent and unified treatment of probabilistic techniques for obtaining high probability estimates on the performance of randomized...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge ; New York :
Cambridge University Press,
©2009.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern applications. This book presents a coherent and unified treatment of probabilistic techniques for obtaining high probability estimates on the performance of randomized algorithms. It covers the basic toolkit from the Chernoff-Hoeffding bounds to more sophisticated techniques like martingales and isoperimetric inequalities, as well as some recent developments like Talagrand's inequality, transportation cost inequalities and log-Sobolev inequalities. Along the way, variations on the basic theme are examined, such as Chernoff-Hoeffding bounds in dependent settings. The authors emphasise comparative study of the different methods, highlighting respective strengths and weaknesses in concrete example applications. The exposition is tailored to discrete settings sufficient for the analysis of algorithms, avoiding unnecessary measure-theoretic details, thus making the book accessible to computer scientists as well as probabilists and discrete mathematicians. |
| Beschreibung: | 1 online resource (xiv, 196 pages) : illustrations |
| Bibliographie: | Includes bibliographical references (pages 189-193) and index. |
| ISBN: | 9780511580956 0511580959 9780511579554 0511579551 9780511581274 0511581270 9781107606609 1107606608 1107200318 9781107200319 1282302779 9781282302778 9786612302770 6612302771 0511580630 9780511580635 0511578814 9780511578816 0511580290 9780511580291 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn438824274 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr mnu---unuuu | ||
| 008 | 090924s2009 enka ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d OCLCQ |d OSU |d YDXCP |d OCLCQ |d CUS |d OCLCQ |d UMI |d DEBSZ |d LLB |d OCLCQ |d OCLCF |d OCLCQ |d COO |d COCUF |d OCLCQ |d UAB |d OCLCQ |d CEF |d OCLCQ |d CNMTR |d OL$ |d OCLCQ |d K6U |d LUN |d QGK |d OCLCO |d OCLCQ |d OCL |d OCLCO |d OCLCL |d SFB |d OCLCQ | ||
| 015 | |a GBA944700 |2 bnb | ||
| 016 | 7 | |z 015175080 |2 Uk | |
| 019 | |a 858807262 |a 1100367432 |a 1170984833 |a 1171312098 |a 1259265503 | ||
| 020 | |a 9780511580956 |q (electronic bk.) | ||
| 020 | |a 0511580959 |q (electronic bk.) | ||
| 020 | |a 9780511579554 |q (ebook) | ||
| 020 | |a 0511579551 |q (ebook) | ||
| 020 | |a 9780511581274 | ||
| 020 | |a 0511581270 | ||
| 020 | |a 9781107606609 |q (paperback) | ||
| 020 | |a 1107606608 | ||
| 020 | |a 1107200318 | ||
| 020 | |a 9781107200319 | ||
| 020 | |a 1282302779 | ||
| 020 | |a 9781282302778 | ||
| 020 | |a 9786612302770 | ||
| 020 | |a 6612302771 | ||
| 020 | |a 0511580630 | ||
| 020 | |a 9780511580635 | ||
| 020 | |a 0511578814 | ||
| 020 | |a 9780511578816 | ||
| 020 | |a 0511580290 | ||
| 020 | |a 9780511580291 | ||
| 020 | |z 9780521884273 |q (hardback ; |q alk. paper) | ||
| 020 | |z 0521884276 |q (hardback ; |q alk. paper) | ||
| 035 | |a (OCoLC)438824274 |z (OCoLC)858807262 |z (OCoLC)1100367432 |z (OCoLC)1170984833 |z (OCoLC)1171312098 |z (OCoLC)1259265503 | ||
| 037 | |a CL0500000300 |b Safari Books Online | ||
| 050 | 4 | |a QA273 |b .D765 2009eb | |
| 072 | 7 | |a MAT |x 041000 |2 bisacsh | |
| 082 | 7 | |a 518/.1 |2 22 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Dubhashi, Devdatt. |0 http://id.loc.gov/authorities/names/n2009014324 | |
| 245 | 1 | 0 | |a Concentration of measure for the analysis of randomized algorithms / |c Devdatt P. Dubhashi, Alessandro Panconesi. |
| 260 | |a Cambridge ; |a New York : |b Cambridge University Press, |c ©2009. | ||
| 300 | |a 1 online resource (xiv, 196 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 504 | |a Includes bibliographical references (pages 189-193) and index. | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a Chernoff-Hoeffding bounds -- Applications of the Chernoff-Hoeffding bounds -- Chernoff-Hoeffding bounds in dependent settings -- Interlude : probabilistic recurrences -- Martingales and the method of bounded differences -- The simple method of bounded differences in action -- The method of averaged bounded differences -- The method of bounded variances -- Interlude : the infamous upper tail -- Isoperimetric inequalities and concentration -- Talagrand's isoperimetric inequality -- Isoperimetric inequalities and concentration via transportation cost inequalities -- Quadratic transportation cost and Talagrand's inequality -- Log-Sobolev inequalities and concentration. | |
| 520 | |a Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern applications. This book presents a coherent and unified treatment of probabilistic techniques for obtaining high probability estimates on the performance of randomized algorithms. It covers the basic toolkit from the Chernoff-Hoeffding bounds to more sophisticated techniques like martingales and isoperimetric inequalities, as well as some recent developments like Talagrand's inequality, transportation cost inequalities and log-Sobolev inequalities. Along the way, variations on the basic theme are examined, such as Chernoff-Hoeffding bounds in dependent settings. The authors emphasise comparative study of the different methods, highlighting respective strengths and weaknesses in concrete example applications. The exposition is tailored to discrete settings sufficient for the analysis of algorithms, avoiding unnecessary measure-theoretic details, thus making the book accessible to computer scientists as well as probabilists and discrete mathematicians. | ||
| 546 | |a English. | ||
| 650 | 0 | |a Random variables. |0 http://id.loc.gov/authorities/subjects/sh85111355 | |
| 650 | 0 | |a Distribution (Probability theory) |0 http://id.loc.gov/authorities/subjects/sh85038545 | |
| 650 | 0 | |a Limit theorems (Probability theory) |0 http://id.loc.gov/authorities/subjects/sh85077023 | |
| 650 | 0 | |a Algorithms. |0 http://id.loc.gov/authorities/subjects/sh85003487 | |
| 650 | 0 | |a Computer algorithms. |0 http://id.loc.gov/authorities/subjects/sh91000149 | |
| 650 | 6 | |a Variables aléatoires. | |
| 650 | 6 | |a Distribution (Théorie des probabilités) | |
| 650 | 6 | |a Théorèmes limites (Théorie des probabilités) | |
| 650 | 6 | |a Algorithmes. | |
| 650 | 7 | |a distribution (statistics-related concept) |2 aat | |
| 650 | 7 | |a algorithms. |2 aat | |
| 650 | 7 | |a MATHEMATICS |x Numerical Analysis. |2 bisacsh | |
| 650 | 7 | |a Computer algorithms |2 fast | |
| 650 | 7 | |a Algorithms |2 fast | |
| 650 | 7 | |a Distribution (Probability theory) |2 fast | |
| 650 | 7 | |a Limit theorems (Probability theory) |2 fast | |
| 650 | 7 | |a Random variables |2 fast | |
| 655 | 0 | |a Electronic books. | |
| 655 | 4 | |a Electronic books. | |
| 700 | 1 | |a Panconesi, Alessandro. |0 http://id.loc.gov/authorities/names/nb2008011437 | |
| 776 | 0 | 8 | |i Print version: |a Dubhashi, Devdatt. |t Concentration of measure for the analysis of randomized algorithms. |d New York : Cambridge University Press, 2009 |z 9780521884273 |w (DLC) 2009009014 |w (OCoLC)297147088 |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=284347 |3 Volltext |
| 938 | |a EBSCOhost |b EBSC |n 284347 | ||
| 938 | |a YBP Library Services |b YANK |n 3108023 | ||
| 938 | |a YBP Library Services |b YANK |n 3095173 | ||
| 938 | |a YBP Library Services |b YANK |n 3104025 | ||
| 938 | |a YBP Library Services |b YANK |n 3277699 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn438824274 |
|---|---|
| _version_ | 1816881698870132736 |
| adam_text | |
| any_adam_object | |
| author | Dubhashi, Devdatt |
| author2 | Panconesi, Alessandro |
| author2_role | |
| author2_variant | a p ap |
| author_GND | http://id.loc.gov/authorities/names/n2009014324 http://id.loc.gov/authorities/names/nb2008011437 |
| author_facet | Dubhashi, Devdatt Panconesi, Alessandro |
| author_role | |
| author_sort | Dubhashi, Devdatt |
| author_variant | d d dd |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA273 |
| callnumber-raw | QA273 .D765 2009eb |
| callnumber-search | QA273 .D765 2009eb |
| callnumber-sort | QA 3273 D765 42009EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Chernoff-Hoeffding bounds -- Applications of the Chernoff-Hoeffding bounds -- Chernoff-Hoeffding bounds in dependent settings -- Interlude : probabilistic recurrences -- Martingales and the method of bounded differences -- The simple method of bounded differences in action -- The method of averaged bounded differences -- The method of bounded variances -- Interlude : the infamous upper tail -- Isoperimetric inequalities and concentration -- Talagrand's isoperimetric inequality -- Isoperimetric inequalities and concentration via transportation cost inequalities -- Quadratic transportation cost and Talagrand's inequality -- Log-Sobolev inequalities and concentration. |
| ctrlnum | (OCoLC)438824274 |
| dewey-full | 518/.1 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 518 - Numerical analysis |
| dewey-raw | 518/.1 |
| dewey-search | 518/.1 |
| dewey-sort | 3518 11 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05830cam a2200961 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn438824274</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr mnu---unuuu</controlfield><controlfield tag="008">090924s2009 enka ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OSU</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">CUS</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UMI</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">LLB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">COO</subfield><subfield code="d">COCUF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UAB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">CEF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">CNMTR</subfield><subfield code="d">OL$</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">K6U</subfield><subfield code="d">LUN</subfield><subfield code="d">QGK</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCL</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">GBA944700</subfield><subfield code="2">bnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="z">015175080</subfield><subfield code="2">Uk</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">858807262</subfield><subfield code="a">1100367432</subfield><subfield code="a">1170984833</subfield><subfield code="a">1171312098</subfield><subfield code="a">1259265503</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511580956</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511580959</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511579554</subfield><subfield code="q">(ebook)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511579551</subfield><subfield code="q">(ebook)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511581274</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511581270</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107606609</subfield><subfield code="q">(paperback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107606608</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107200318</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107200319</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1282302779</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781282302778</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9786612302770</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">6612302771</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511580630</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511580635</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511578814</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511578816</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511580290</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511580291</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521884273</subfield><subfield code="q">(hardback ;</subfield><subfield code="q">alk. paper)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521884276</subfield><subfield code="q">(hardback ;</subfield><subfield code="q">alk. paper)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)438824274</subfield><subfield code="z">(OCoLC)858807262</subfield><subfield code="z">(OCoLC)1100367432</subfield><subfield code="z">(OCoLC)1170984833</subfield><subfield code="z">(OCoLC)1171312098</subfield><subfield code="z">(OCoLC)1259265503</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">CL0500000300</subfield><subfield code="b">Safari Books Online</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA273</subfield><subfield code="b">.D765 2009eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">041000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">518/.1</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dubhashi, Devdatt.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n2009014324</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Concentration of measure for the analysis of randomized algorithms /</subfield><subfield code="c">Devdatt P. Dubhashi, Alessandro Panconesi.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">©2009.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiv, 196 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 189-193) and index.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Chernoff-Hoeffding bounds -- Applications of the Chernoff-Hoeffding bounds -- Chernoff-Hoeffding bounds in dependent settings -- Interlude : probabilistic recurrences -- Martingales and the method of bounded differences -- The simple method of bounded differences in action -- The method of averaged bounded differences -- The method of bounded variances -- Interlude : the infamous upper tail -- Isoperimetric inequalities and concentration -- Talagrand's isoperimetric inequality -- Isoperimetric inequalities and concentration via transportation cost inequalities -- Quadratic transportation cost and Talagrand's inequality -- Log-Sobolev inequalities and concentration.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern applications. This book presents a coherent and unified treatment of probabilistic techniques for obtaining high probability estimates on the performance of randomized algorithms. It covers the basic toolkit from the Chernoff-Hoeffding bounds to more sophisticated techniques like martingales and isoperimetric inequalities, as well as some recent developments like Talagrand's inequality, transportation cost inequalities and log-Sobolev inequalities. Along the way, variations on the basic theme are examined, such as Chernoff-Hoeffding bounds in dependent settings. The authors emphasise comparative study of the different methods, highlighting respective strengths and weaknesses in concrete example applications. The exposition is tailored to discrete settings sufficient for the analysis of algorithms, avoiding unnecessary measure-theoretic details, thus making the book accessible to computer scientists as well as probabilists and discrete mathematicians.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Random variables.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85111355</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Distribution (Probability theory)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85038545</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Limit theorems (Probability theory)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85077023</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85003487</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh91000149</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Variables aléatoires.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Distribution (Théorie des probabilités)</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorèmes limites (Théorie des probabilités)</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Algorithmes.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">distribution (statistics-related concept)</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithms.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Numerical Analysis.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Distribution (Probability theory)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Limit theorems (Probability theory)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Random variables</subfield><subfield code="2">fast</subfield></datafield><datafield tag="655" ind1=" " ind2="0"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Panconesi, Alessandro.</subfield><subfield code="0">http://id.loc.gov/authorities/names/nb2008011437</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Dubhashi, Devdatt.</subfield><subfield code="t">Concentration of measure for the analysis of randomized algorithms.</subfield><subfield code="d">New York : Cambridge University Press, 2009</subfield><subfield code="z">9780521884273</subfield><subfield code="w">(DLC) 2009009014</subfield><subfield code="w">(OCoLC)297147088</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=284347</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">284347</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">3108023</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">3095173</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">3104025</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">3277699</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| genre | Electronic books. |
| genre_facet | Electronic books. |
| id | ZDB-4-EBA-ocn438824274 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:16:52Z |
| institution | BVB |
| isbn | 9780511580956 0511580959 9780511579554 0511579551 9780511581274 0511581270 9781107606609 1107606608 1107200318 9781107200319 1282302779 9781282302778 9786612302770 6612302771 0511580630 9780511580635 0511578814 9780511578816 0511580290 9780511580291 |
| language | English |
| oclc_num | 438824274 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (xiv, 196 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Cambridge University Press, |
| record_format | marc |
| spelling | Dubhashi, Devdatt. http://id.loc.gov/authorities/names/n2009014324 Concentration of measure for the analysis of randomized algorithms / Devdatt P. Dubhashi, Alessandro Panconesi. Cambridge ; New York : Cambridge University Press, ©2009. 1 online resource (xiv, 196 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier Includes bibliographical references (pages 189-193) and index. Print version record. Chernoff-Hoeffding bounds -- Applications of the Chernoff-Hoeffding bounds -- Chernoff-Hoeffding bounds in dependent settings -- Interlude : probabilistic recurrences -- Martingales and the method of bounded differences -- The simple method of bounded differences in action -- The method of averaged bounded differences -- The method of bounded variances -- Interlude : the infamous upper tail -- Isoperimetric inequalities and concentration -- Talagrand's isoperimetric inequality -- Isoperimetric inequalities and concentration via transportation cost inequalities -- Quadratic transportation cost and Talagrand's inequality -- Log-Sobolev inequalities and concentration. Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern applications. This book presents a coherent and unified treatment of probabilistic techniques for obtaining high probability estimates on the performance of randomized algorithms. It covers the basic toolkit from the Chernoff-Hoeffding bounds to more sophisticated techniques like martingales and isoperimetric inequalities, as well as some recent developments like Talagrand's inequality, transportation cost inequalities and log-Sobolev inequalities. Along the way, variations on the basic theme are examined, such as Chernoff-Hoeffding bounds in dependent settings. The authors emphasise comparative study of the different methods, highlighting respective strengths and weaknesses in concrete example applications. The exposition is tailored to discrete settings sufficient for the analysis of algorithms, avoiding unnecessary measure-theoretic details, thus making the book accessible to computer scientists as well as probabilists and discrete mathematicians. English. Random variables. http://id.loc.gov/authorities/subjects/sh85111355 Distribution (Probability theory) http://id.loc.gov/authorities/subjects/sh85038545 Limit theorems (Probability theory) http://id.loc.gov/authorities/subjects/sh85077023 Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Variables aléatoires. Distribution (Théorie des probabilités) Théorèmes limites (Théorie des probabilités) Algorithmes. distribution (statistics-related concept) aat algorithms. aat MATHEMATICS Numerical Analysis. bisacsh Computer algorithms fast Algorithms fast Distribution (Probability theory) fast Limit theorems (Probability theory) fast Random variables fast Electronic books. Panconesi, Alessandro. http://id.loc.gov/authorities/names/nb2008011437 Print version: Dubhashi, Devdatt. Concentration of measure for the analysis of randomized algorithms. New York : Cambridge University Press, 2009 9780521884273 (DLC) 2009009014 (OCoLC)297147088 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=284347 Volltext |
| spellingShingle | Dubhashi, Devdatt Concentration of measure for the analysis of randomized algorithms / Chernoff-Hoeffding bounds -- Applications of the Chernoff-Hoeffding bounds -- Chernoff-Hoeffding bounds in dependent settings -- Interlude : probabilistic recurrences -- Martingales and the method of bounded differences -- The simple method of bounded differences in action -- The method of averaged bounded differences -- The method of bounded variances -- Interlude : the infamous upper tail -- Isoperimetric inequalities and concentration -- Talagrand's isoperimetric inequality -- Isoperimetric inequalities and concentration via transportation cost inequalities -- Quadratic transportation cost and Talagrand's inequality -- Log-Sobolev inequalities and concentration. Random variables. http://id.loc.gov/authorities/subjects/sh85111355 Distribution (Probability theory) http://id.loc.gov/authorities/subjects/sh85038545 Limit theorems (Probability theory) http://id.loc.gov/authorities/subjects/sh85077023 Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Variables aléatoires. Distribution (Théorie des probabilités) Théorèmes limites (Théorie des probabilités) Algorithmes. distribution (statistics-related concept) aat algorithms. aat MATHEMATICS Numerical Analysis. bisacsh Computer algorithms fast Algorithms fast Distribution (Probability theory) fast Limit theorems (Probability theory) fast Random variables fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85111355 http://id.loc.gov/authorities/subjects/sh85038545 http://id.loc.gov/authorities/subjects/sh85077023 http://id.loc.gov/authorities/subjects/sh85003487 http://id.loc.gov/authorities/subjects/sh91000149 |
| title | Concentration of measure for the analysis of randomized algorithms / |
| title_auth | Concentration of measure for the analysis of randomized algorithms / |
| title_exact_search | Concentration of measure for the analysis of randomized algorithms / |
| title_full | Concentration of measure for the analysis of randomized algorithms / Devdatt P. Dubhashi, Alessandro Panconesi. |
| title_fullStr | Concentration of measure for the analysis of randomized algorithms / Devdatt P. Dubhashi, Alessandro Panconesi. |
| title_full_unstemmed | Concentration of measure for the analysis of randomized algorithms / Devdatt P. Dubhashi, Alessandro Panconesi. |
| title_short | Concentration of measure for the analysis of randomized algorithms / |
| title_sort | concentration of measure for the analysis of randomized algorithms |
| topic | Random variables. http://id.loc.gov/authorities/subjects/sh85111355 Distribution (Probability theory) http://id.loc.gov/authorities/subjects/sh85038545 Limit theorems (Probability theory) http://id.loc.gov/authorities/subjects/sh85077023 Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Variables aléatoires. Distribution (Théorie des probabilités) Théorèmes limites (Théorie des probabilités) Algorithmes. distribution (statistics-related concept) aat algorithms. aat MATHEMATICS Numerical Analysis. bisacsh Computer algorithms fast Algorithms fast Distribution (Probability theory) fast Limit theorems (Probability theory) fast Random variables fast |
| topic_facet | Random variables. Distribution (Probability theory) Limit theorems (Probability theory) Algorithms. Computer algorithms. Variables aléatoires. Distribution (Théorie des probabilités) Théorèmes limites (Théorie des probabilités) Algorithmes. distribution (statistics-related concept) algorithms. MATHEMATICS Numerical Analysis. Computer algorithms Algorithms Random variables Electronic books. |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=284347 |
| work_keys_str_mv | AT dubhashidevdatt concentrationofmeasurefortheanalysisofrandomizedalgorithms AT panconesialessandro concentrationofmeasurefortheanalysisofrandomizedalgorithms |