Searching for authors named "Michael Mitzenmacher" – sorted by Relevance.
-
On the Analysis of Randomized Load Balancing Schemes
- Schemes Michael Mitzenmacher d i g i t a l Systems Research Center 130 Lytton Avenue Palo Alto
- Cited by 44 (7 self) – Add To MetaCart
-
Tight Thresholds for The Pure Literal Rule
- SRC Technical Note 1997 - 011 June 17, 1997 Tight Thresholds for The Pure Literal Rule Michael
- Cited by 14 (3 self) – Add To MetaCart
-
Analyses of Load Stealing Models Based on Differential Equations
- Analyses of Load Stealing Models Based on Di#erential Equations Michael Mitzenmacher Digital
- Cited by 15 (0 self) – Add To MetaCart
-
Studying Balanced Allocations with Differential Equations
- Equations Michael Mitzenmacher d i g i t a l Systems Research Center 130 Lytton Avenue Palo Alto
- Cited by 14 (3 self) – Add To MetaCart
-
Polynomial time low-density parity-check codes with rates very close to the capacity of the q-ary random deletion channel for large q
- Michael Mitzenmacher, Member, IEEE Abstract—We demonstrate polynomial-time deletion codes based
- Cited by 1 (0 self) – Add To MetaCart
-
A Note on Low Density Parity Check Codes for Erasures and Errors
- for Erasures and Errors Michael Mitzenmacher Systems Research Center 130 Lytton Avenue Palo Alto, California
- Cited by 4 (0 self) – Add To MetaCart
-
Constant Time Per Edge is Optimal on Rooted Tree Networks
- Michael Mitzenmacher Computer Science Division U.C. Berkeley Berkeley, CA 94720 mitzen
- Cited by 11 (6 self) – Add To MetaCart
-
Bounds on the Greedy Routing Algorithm for Array Networks
- Routing Algorithm for Array Networks Michael Mitzenmacher* Computer Science Division, University
- Cited by 26 (6 self) – Add To MetaCart
-
How Useful is Old Information?
- SRC Technical Note 1998 - 002 February 8, 1998 How Useful Is Old Information? Michael Mitzenmacher
- Cited by 70 (10 self) – Add To MetaCart
-
Dynamic models for file sizes and double pareto distributions
- Distributions Michael Mitzenmacher Abstract. In this paper, we introduce and analyze a new, dynamic generative
- Cited by 25 (0 self) – Add To MetaCart

