The following pages link to Michael Mitzenmacher (Q378241):
Displayed 50 items.
- Detecting Novel Associations in Large Data Sets (Q143203) (← links)
- Item:Q378241 (redirect page) (← links)
- Item:Q378241 (redirect page) (← links)
- Revisiting the COUNTER algorithms for list update (Q287261) (← links)
- External-memory multimaps (Q378243) (← links)
- Bounds on the greedy routing algorithm for array networks (Q676436) (← links)
- A derandomization using min-wise independent permutations (Q876688) (← links)
- Human-guided search (Q972653) (← links)
- A survey of results for deletion channels and related synchronization channels (Q980780) (← links)
- Bubblesearch: a simple heuristic for improving priority-based greedy algorithms (Q1045924) (← links)
- On the analysis of randomized load balancing schemes (Q1293921) (← links)
- Computational complexity of loss networks (Q1318715) (← links)
- Average case analyses of list update algorithms, with applications to data compression (Q1393071) (← links)
- Min-wise independent permutations (Q1577016) (← links)
- An empirical study of the maximal and total information coefficients and leading measures of dependence (Q1647596) (← links)
- Models and algorithms for graph watermarking (Q1799199) (← links)
- Delayed information and action in on-line algorithms (Q1854463) (← links)
- A scaling result for explosive processes (Q1883643) (← links)
- Streaming graph computations with a helpful advisor (Q1939657) (← links)
- Simple multi-party set reconciliation (Q2075624) (← links)
- Equitability, interval estimation, and statistical power (Q2218039) (← links)
- Exhaustive approaches to 2D rectangular perfect packings (Q2390210) (← links)
- Improving the performance of invertible Bloom lookup tables (Q2445904) (← links)
- Hardness of peeling with stashes (Q2630336) (← links)
- An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings (Q2719118) (← links)
- (Q2768395) (← links)
- Analysis of Timing-Based Mutual Exclusion with Random Times (Q2784482) (← links)
- Compressed bloom filters (Q2787676) (← links)
- Practical verified computation with streaming interactive proofs (Q2826047) (← links)
- (Q2833177) (← links)
- Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified (Q2904755) (← links)
- (Q2921670) (← links)
- Analysis of timing-based mutual exclusion with random times (Q2942747) (← links)
- Measuring dependence powerfully and equitably (Q2953635) (← links)
- Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation (Q3012949) (← links)
- Cuckoo Hashing with Pages (Q3092265) (← links)
- (Q3113742) (← links)
- Anonymous Card Shuffling and Its Applications to Parallel Mixnets (Q3167043) (← links)
- Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket (Q3191209) (← links)
- (Q3191600) (← links)
- Less hashing, same performance: Building a better Bloom filter (Q3522836) (← links)
- Power Laws for Monkeys Typing Randomly: The Case of Unequal Probabilities (Q3546732) (← links)
- Binary intersymbol interference channels: gallager codes, density evolution, and code performance bounds (Q3547114) (← links)
- Verification-Based Decoding for Packet-Based Low-Density Parity-Check Codes (Q3547290) (← links)
- On the Hardness of Finding Optimal Multiple Preset Dictionaries (Q3547386) (← links)
- A Simple Lower Bound for the Capacity of the Deletion Channel (Q3547899) (← links)
- On Lower Bounds for the Capacity of Deletion Channels (Q3547905) (← links)
- Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the $q$-ary Random Deletion Channel for Large $q$ (Q3548125) (← links)
- Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels (Q3548896) (← links)
- (Q3579408) (← links)