The following pages link to Michael Mitzenmacher (Q378241):
Displaying 10 items.
- Detecting Novel Associations in Large Data Sets (Q143203) (← links)
- Bounds on the greedy routing algorithm for array networks (Q676436) (← links)
- Human-guided search (Q972653) (← links)
- Bubblesearch: a simple heuristic for improving priority-based greedy algorithms (Q1045924) (← links)
- On the analysis of randomized load balancing schemes (Q1293921) (← links)
- Min-wise independent permutations (Q1577016) (← links)
- Some Open Questions Related to Cuckoo Hashing (Q3639230) (← links)
- A Brief History of Generative Models for Power Law and Lognormal Distributions (Q4665450) (← links)
- More Robust Hashing: Cuckoo Hashing with a Stash (Q5901158) (← links)
- Analyses of load stealing models based on families of differential equations (Q5929089) (← links)
