随机算法 (Fall 2011)/Balls-into-balls Occupancy Problem: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

19 September 2011

19 July 2011

  • curprev 02:4502:45, 19 July 2011‎ imported>WikiSysop‎ 3,908 bytes +3,908‎ Created page with 'Now we ask about the loads of bins. Assuming that <math>m</math> balls are uniformly and independently assigned to <math>n</math> bins, for <math>1\le i\le n</math>, let <math>X_…'
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=随机算法_(Fall_2011)/Balls-into-balls_Occupancy_Problem"