Jieming Mao

Available identifiers

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6147397	2024-01-15	Paper
Exponential Separations in Local Privacy	2023-10-31	Paper
Exponential Separations in Local Differential Privacy	2021-02-02	Paper
Combinatorial assortment optimization	2020-06-18	Paper
Near-optimal bounds on the bounded-round quantum communication complexity of disjointness	2018-12-19	Paper
Optimal Instance Adaptive Algorithm for the Top-$K$ Ranking Problem	2018-09-19	Paper
Competitive analysis of the top-$K$ ranking problem	2018-07-16	Paper
Interpolating between truthful and non-truthful mechanisms for combinatorial auctions	2018-07-16	Paper
Coding for Interactive Communication Correcting Insertions and Deletions	2018-06-27	Paper
A nearly instance optimal algorithm for top-$k$ ranking under the multinomial logit model	2018-03-15	Paper
On simultaneous two-player combinatorial auctions	2018-03-15	Paper
Coding for interactive communication correcting insertions and deletions	2017-12-19	Paper
Parallel algorithms for select and partition with noisy comparisons	2017-09-29	Paper
Simulating noisy channel interaction (extended abstract)	2017-05-19	Paper
Tighter relations between sensitivity and other complexity measures	2014-07-01	Paper
On the sensitivity complexity of bipartite graph properties	2013-02-19	Paper

This page was built for person: Jieming Mao