| Record ID | marc_loc_updates/v40.i21.records.utf8:15789109:878 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_updates/v40.i21.records.utf8:15789109:878?format=raw |
LEADER: 00878cam a2200265 a 4500
001 2012392283
003 DLC
005 20120519080334.0
008 120420s2012 enka b 001 0 eng
010 $a 2012392283
020 $a9781107606609
040 $aDLC$cDLC
042 $apcc
050 00 $aQA273$b.D765 2012
100 1 $aDubhashi, Devdatt.
245 10 $aConcentration of measure for the analysis of randomized algorithms /$cDevdatt Dubhashi, Alessandro Panconesi.
250 $a1st pbk. ed.
260 $aCambridge ;$aNew York :$bCambridge University Press,$c2012.
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.