Jieming Mao

Jieming Mao (毛杰明)

I'm a fourth year Ph.D. student in Department of Computer Science at Princeton University . I am fortunate to be advised by Mark Braverman.

I am interested in communication complexity, information theory and algorithmic mechanism design.

I did my undergrad in Institute for Theoretical Computer Science at Tsinghua University.

Publications

    Multi-armed Bandit Problems with Strategic Arms

    Mark Braverman, Jieming Mao, Jon Schneider, Matthew Weinberg
    Manuscript

    On Simultaneous Two-player Combinatorial Auctions

    Mark Braverman, Jieming Mao, Matthew Weinberg
    Manuscript

    Competitive Analysis of the Top-K Ranking Problem

    Xi Chen, Sivakanth Gopi, Jieming Mao, Jon Schneider
    SODA 2017 [arXiv]

    Parallel Algoirithms for Select and Partition with Noisy Comparisons

    Mark Braverman, Jieming Mao, Matthew Weinberg
    STOC 2016 [arXiv]

    Coding for Interactive Communication Correcting Insertions and Deletions

    Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky
    ICALP 2016 [arXiv]

    Interpolating Between Truthful and Non-truthful Mechanisms for Combinatorial Auctions

    Mark Braverman, Jieming Mao, Matthew Weinberg
    SODA 2016 [arXiv]

    Near-optimal Bounds on Bounded-round Quantum Communication Complexity of Disjointness

    Mark Braverman, Ankit Garg, Young Kun Ko, Jieming Mao, Dave Touchette
    FOCS 2015, QIP 2016 [ECCC]

    Simulating Noisy Channel Interaction

    Mark Braverman, Jieming Mao
    ITCS 2015 [ECCC]

    Tighter Relations Between Sensitivity and Other Complexity Measures

    Andris Ambainis, Mohammad Bavarian, Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo
    ICALP 2014 [ECCC]

    On the Sensitivity Complexity of Bipartite Graph Properties

    Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo
    Theor. Comput. Sci. 468: 83-91 (2013)

Email:


jiemingm AT cs dot princeton dot edu

Contact:


Jieming Mao,
Department of Computer Science,
Princeton University,
35 Olden Street,
Princeton, NJ 08540