Jieming Mao

According to our database1, Jieming Mao authored at least 15 papers between 2013 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Optimal Instance Adaptive Algorithm for the Top-K Ranking Problem.
IEEE Trans. Information Theory, 2018

Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness.
SIAM J. Comput., 2018

Combinatorial Assortment Optimization.
Proceedings of the Web and Internet Economics - 14th International Conference, 2018

A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

On Simultaneous Two-player Combinatorial Auctions.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Selling to a No-Regret Buyer.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Contextual Pricing for Lipschitz Buyers.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Competitive analysis of the top-K ranking problem.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Parallel algorithms for select and partition with noisy comparisons.
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

Coding for Interactive Communication Correcting Insertions and Deletions.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Simulating Noisy Channel Interaction.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
Tighter Relations between Sensitivity and Other Complexity Measures.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
On the sensitivity complexity of bipartite graph properties.
Theor. Comput. Sci., 2013


  Loading...