| Record ID | ia:concentrationofm0000dubh |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/concentrationofm0000dubh/concentrationofm0000dubh_marc.xml |
| Download MARC binary | https://www.archive.org/download/concentrationofm0000dubh/concentrationofm0000dubh_meta.mrc |
LEADER: 01049cam a2200301 a 4500
001 2009009014
003 DLC
005 20100311084902.0
008 090306s2009 nyua b 001 0 eng
010 $a 2009009014
015 $aGBA944700$2bnb
016 7 $a015175080$2Uk
020 $a9780521884273 (hardback : alk. paper)
020 $a0521884276 (hardback : alk. paper)
035 $a(OCoLC)ocn297147088
040 $aDLC$cDLC$dYDX$dBTCTA$dYDXCP$dUKM$dCDX$dDLC
050 00 $aQA273$b.D765 2009
082 00 $a518/.1$222
100 1 $aDubhashi, Devdatt.
245 10 $aConcentration of measure for the analysis of randomized algorithms /$cDevdatt Dubhashi, Alessandro Panconesi.
260 $aNew York :$bCambridge University Press,$c2009.
300 $axiv, 196 p. :$bill. ;$c24 cm.
504 $aIncludes bibliographical references (p. 189-193) and index.
650 0 $aRandom variables.
650 0 $aDistribution (Probability theory)
650 0 $aLimit theorems (Probability theory)
650 0 $aAlgorithms.
700 1 $aPanconesi, Alessandro.