The following pages link to Michael Mitzenmacher (Q378241):
Displayed 50 items.
- (Q3579460) (← links)
- (Q3579482) (← links)
- The Hiring Problem and Lake Wobegon Strategies (Q3586178) (← links)
- Tight Thresholds for Cuckoo Hashing via XORSAT (Q3587381) (← links)
- Privacy Preserving Keyword Searches on Remote Encrypted Data (Q3593165) (← links)
- Capacity Bounds for Sticky Channels (Q3604462) (← links)
- Using the Power of Two Choices to Improve Bloom Filters (Q3622688) (← links)
- Some Open Questions Related to Cuckoo Hashing (Q3639230) (← links)
- (Q4234070) (← links)
- (Q4250194) (← links)
- (Q4250203) (← links)
- (Q4252384) (← links)
- (Q4406375) (← links)
- Average-case analyses of first fit and random fit bin packing (Q4487093) (← links)
- (Q4526978) (← links)
- Linear waste of best fit bin packing on skewed distributions (Q4537630) (← links)
- (Q4542543) (← links)
- (Q4542551) (← links)
- (Q4542556) (← links)
- Efficient erasure correcting codes (Q4544507) (← links)
- Improved low-density parity-check codes using irregular graphs (Q4544508) (← links)
- Voronoi Choice Games (Q4598158) (← links)
- A Brief History of Generative Models for Power Law and Lognormal Distributions (Q4665450) (← links)
- Network Applications of Bloom Filters: A Survey (Q4672750) (← links)
- Dynamic Models for File Sizes and Double Pareto Distributions (Q4672753) (← links)
- Parallel randomized load balancing (Q4705325) (← links)
- (Q4761355) (← links)
- (Q4788604) (← links)
- (Q4801182) (← links)
- (Q4818862) (← links)
- (Q4828948) (← links)
- Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability (Q4916042) (← links)
- Studying Balanced Allocations with Differential Equations (Q4934786) (← links)
- (Q4941821) (← links)
- (Q4952672) (← links)
- (Q4952676) (← links)
- Codes for Deletion and Insertion Channels With Segmented Errors (Q4976044) (← links)
- When Simple Hash Functions Suffice (Q5027292) (← links)
- Algorithms with Predictions (Q5027296) (← links)
- Load Thresholds for Cuckoo Hashing with Double Hashing (Q5116493) (← links)
- Constant time per edge is optimal on rooted tree networks (Q5137341) (← links)
- Dynamic algorithms for LIS and distance to monotonicity (Q5144953) (← links)
- Optimal plans for aggregation (Q5170875) (← links)
- More Analysis of Double Hashing for Balanced Allocations (Q5194938) (← links)
- A New Approach to Analyzing Robin Hood Hashing (Q5194939) (← links)
- Arithmetic Progression Hypergraphs: Examining the Second Moment Method (Q5195241) (← links)
- Adaptive Cuckoo Filters (Q5232721) (← links)
- Distance-Sensitive Bloom Filters (Q5233465) (← links)
- Hierarchical Heavy Hitters with the Space Saving Algorithm (Q5233728) (← links)
- Designing Floating Codes for Expected Performance (Q5281559) (← links)