# Jieming Mao

According to our database

Collaborative distances:

^{1}, Jieming Mao authored at least 41 papers between 2013 and 2022.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2022

CoRR, 2022

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Optimal Mechanisms for Value Maximizers with Budget Constraints via Target Clipping.

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

ACM Trans. Economics and Comput., 2021

CoRR, 2021

CoRR, 2021

Proceedings of the WWW '21: The Web Conference 2021, 2021

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Proceedings of the Conference on Learning Theory, 2020

2019

Exponential Separations in Local Differential Privacy Through Communication Complexity.

CoRR, 2019

Proceedings of the World Wide Web Conference, 2019

Proceedings of the World Wide Web Conference, 2019

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Proceedings of the 36th International Conference on Machine Learning, 2019

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Proceedings of the Conference on Learning Theory, 2019

Proceedings of the Conference on Learning Theory, 2019

2018

IEEE Trans. Inf. Theory, 2018

CoRR, 2018

A Nearly Instance Optimal Algorithm for Top-<i>k</i> Ranking under the Multinomial Logit Model.

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017

IEEE Trans. Inf. Theory, 2017

A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model.

CoRR, 2017

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

CoRR, 2016

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions.

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Near-optimal bounds on bounded-round quantum communication complexity of disjointness.

Electron. Colloquium Comput. Complex., 2015

2014

Electron. Colloquium Comput. Complex., 2014

Electron. Colloquium Comput. Complex., 2014

2013

Theor. Comput. Sci., 2013

New upper bound on block sensitivity and certificate complexity in terms of sensitivity.

CoRR, 2013