Concentration of measure for the analysis of randomized algorithms / Devdatt Dubhashi, Alessandro Panconesi.
Saved in:
: | |
---|---|
TeilnehmendeR: | |
Year of Publication: | 2009 |
Language: | English |
Online Access: | |
Physical Description: | xiv, 196 p. :; ill. |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
500451942 |
---|---|
ctrlnum |
(MiAaPQ)500451942 (Au-PeEL)EBL451942 (CaPaEBR)ebr10333193 (OCoLC)438728734 |
collection |
bib_alma |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01531nam a2200409 a 4500</leader><controlfield tag="001">500451942</controlfield><controlfield tag="003">MiAaPQ</controlfield><controlfield tag="005">20200520144314.0</controlfield><controlfield tag="006">m o d | </controlfield><controlfield tag="007">cr cn|||||||||</controlfield><controlfield tag="008">090306s2009 nyua sb 001 0 eng </controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="z"> 2009009014</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="020" ind1=" " ind2=" "><subfield code="z">9780521884273 (hardback : alk. paper)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521884276 (hardback : alk. paper)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)500451942</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL451942</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaPaEBR)ebr10333193</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)438728734</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">MiAaPQ</subfield><subfield code="c">MiAaPQ</subfield><subfield code="d">MiAaPQ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA273</subfield><subfield code="b">.D765 2009</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">518/.1</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dubhashi, Devdatt.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Concentration of measure for the analysis of randomized algorithms</subfield><subfield code="h">[electronic resource] /</subfield><subfield code="c">Devdatt Dubhashi, Alessandro Panconesi.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><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">xiv, 196 p. :</subfield><subfield code="b">ill.</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (p. 189-193) and index.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="a">Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Random variables.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Distribution (Probability theory)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Limit theorems (Probability theory)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Algorithms.</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></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">ProQuest (Firm)</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=451942</subfield><subfield code="z">Click to View</subfield></datafield></record></collection> |
record_format |
marc |
spelling |
Dubhashi, Devdatt. Concentration of measure for the analysis of randomized algorithms [electronic resource] / Devdatt Dubhashi, Alessandro Panconesi. New York : Cambridge University Press, 2009. xiv, 196 p. : ill. Includes bibliographical references (p. 189-193) and index. Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries. Random variables. Distribution (Probability theory) Limit theorems (Probability theory) Algorithms. Electronic books. Panconesi, Alessandro. ProQuest (Firm) https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=451942 Click to View |
language |
English |
format |
Electronic eBook |
author |
Dubhashi, Devdatt. |
spellingShingle |
Dubhashi, Devdatt. Concentration of measure for the analysis of randomized algorithms |
author_facet |
Dubhashi, Devdatt. Panconesi, Alessandro. ProQuest (Firm) ProQuest (Firm) |
author_variant |
d d dd |
author2 |
Panconesi, Alessandro. ProQuest (Firm) |
author2_variant |
a p ap |
author2_role |
TeilnehmendeR TeilnehmendeR |
author_corporate |
ProQuest (Firm) |
author_sort |
Dubhashi, Devdatt. |
title |
Concentration of measure for the analysis of randomized algorithms |
title_full |
Concentration of measure for the analysis of randomized algorithms [electronic resource] / Devdatt Dubhashi, Alessandro Panconesi. |
title_fullStr |
Concentration of measure for the analysis of randomized algorithms [electronic resource] / Devdatt Dubhashi, Alessandro Panconesi. |
title_full_unstemmed |
Concentration of measure for the analysis of randomized algorithms [electronic resource] / Devdatt Dubhashi, Alessandro Panconesi. |
title_auth |
Concentration of measure for the analysis of randomized algorithms |
title_new |
Concentration of measure for the analysis of randomized algorithms |
title_sort |
concentration of measure for the analysis of randomized algorithms |
publisher |
Cambridge University Press, |
publishDate |
2009 |
physical |
xiv, 196 p. : ill. |
callnumber-first |
Q - Science |
callnumber-subject |
QA - Mathematics |
callnumber-label |
QA273 |
callnumber-sort |
QA 3273 D765 42009 |
genre |
Electronic books. |
genre_facet |
Electronic books. |
url |
https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=451942 |
illustrated |
Illustrated |
dewey-hundreds |
500 - Science |
dewey-tens |
510 - Mathematics |
dewey-ones |
518 - Numerical analysis |
dewey-full |
518/.1 |
dewey-sort |
3518 11 |
dewey-raw |
518/.1 |
dewey-search |
518/.1 |
oclc_num |
438728734 |
work_keys_str_mv |
AT dubhashidevdatt concentrationofmeasurefortheanalysisofrandomizedalgorithms AT panconesialessandro concentrationofmeasurefortheanalysisofrandomizedalgorithms AT proquestfirm concentrationofmeasurefortheanalysisofrandomizedalgorithms |
status_str |
n |
ids_txt_mv |
(MiAaPQ)500451942 (Au-PeEL)EBL451942 (CaPaEBR)ebr10333193 (OCoLC)438728734 |
is_hierarchy_title |
Concentration of measure for the analysis of randomized algorithms |
author2_original_writing_str_mv |
noLinkedField noLinkedField |
_version_ |
1792330692802117632 |