Parallel algorithms for select and partition with noisy comparisons M Braverman, J Mao, SM Weinberg Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 44 | 2016 |

Coding for interactive communication correcting insertions and deletions M Braverman, R Gelles, J Mao, R Ostrovsky IEEE Transactions on Information Theory 63 (10), 6256-6270, 2017 | 38 | 2017 |

Differentially private fair learning M Jagielski, M Kearns, J Mao, A Oprea, A Roth, S Sharifi-Malvajerdi, ... International Conference on Machine Learning, 3000-3008, 2019 | 36 | 2019 |

The role of interactivity in local differential privacy M Joseph, J Mao, S Neel, A Roth 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 32 | 2019 |

Competitive analysis of the top-*K* ranking problemX Chen, S Gopi, J Mao, J Schneider Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 30 | 2017 |

Tighter relations between sensitivity and other complexity measures A Ambainis, M Bavarian, Y Gao, J Mao, X Sun, S Zuo International Colloquium on Automata, Languages, and Programming, 101-113, 2014 | 29 | 2014 |

Near-optimal bounds on the bounded-round quantum communication complexity of disjointness M Braverman, A Garg, YK Ko, J Mao, D Touchette SIAM Journal on Computing 47 (6), 2277-2314, 2018 | 28 | 2018 |

Locally private gaussian estimation M Joseph, J Kulkarni, J Mao, SZ Wu Advances in Neural Information Processing Systems, 2984-2993, 2019 | 26 | 2019 |

A Nearly Instance Optimal Algorithm for Top-*k* Ranking under the Multinomial Logit ModelX Chen, Y Li, J Mao Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 26 | 2018 |

Selling to a no-regret buyer M Braverman, J Mao, J Schneider, M Weinberg Proceedings of the 2018 ACM Conference on Economics and Computation, 523-538, 2018 | 23 | 2018 |

Contextual pricing for lipschitz buyers J Mao, R Leme, J Schneider Advances in Neural Information Processing Systems, 5643-5651, 2018 | 22 | 2018 |

Exponential separations in local differential privacy M Joseph, J Mao, A Roth Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 16 | 2020 |

On simultaneous two-player combinatorial auctions M Braverman, J Mao, SM Weinberg Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 15 | 2018 |

Multi-armed bandit problems with strategic arms M Braverman, J Mao, J Schneider, SM Weinberg Conference on Learning Theory, 383-416, 2019 | 12 | 2019 |

Bayesian exploration with heterogeneous agents N Immorlica, J Mao, A Slivkins, ZS Wu The World Wide Web Conference, 751-761, 2019 | 11 | 2019 |

Connecting robust shuffle privacy and pan-privacy V Balcer, A Cheu, M Joseph, J Mao Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 9 | 2021 |

Pan-private uniformity testing K Amin, M Joseph, J Mao Conference on Learning Theory, 183-218, 2020 | 8 | 2020 |

Interpolating between truthful and non-truthful mechanisms for combinatorial auctions M Braverman, J Mao, SM Weinberg Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 8 | 2016 |

Simulating noisy channel interaction M Braverman, J Mao Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015 | 8 | 2015 |

Incentivizing Exploration with Selective Data Disclosure N Immorlica, J Mao, A Slivkins, ZS Wu arXiv preprint arXiv:1811.06026, 2018 | 5 | 2018 |