Map task scheduling in MapReduce with data locality: Throughput and heavy-traffic optimality. - Weina Wang 001; Kai Zhu 002; Lei Ying 001; Jian Tan 001; Li Zhang 002 (INFOCOM, 2013)

A throughput optimal algorithm for map task scheduling in mapreduce with data locality. - Weina Wang 001; Kai Zhu 002; Lei Ying 001; Jian Tan 001; Li Zhang 002 (SIGMETRICS Perform. Evaluation Rev., 2013)

A Minimax Distortion View of Non-Interactive Differential Privacy. - Weina Wang 001; Lei Ying 001; Junshan Zhang (CoRR, 2014)

On the Tradeoff between Privacy and Distortion in Differential Privacy. - Weina Wang 001; Lei Ying 001; Junshan Zhang (CoRR, 2014)

A minimax distortion view of differentially private query release. - Weina Wang 001; Lei Ying 001; Junshan Zhang (ACSSC, 2015)

Decentralized scheduling with data locality for data-parallel computation on peer-to-peer networks. - Weina Wang 001; Matthew Barnard; Lei Ying 001 (Allerton, 2015)

A game-theoretic approach to quality control for collecting privacy-preserving data. - Weina Wang 001; Lei Ying 001; Junshan Zhang (Allerton, 2015)

Resource allocation for data-parallel computing in networks with data locality. - Weina Wang 001; Lei Ying 001 (Allerton, 2016)

Buying Data from Privacy-Aware Individuals: The Effect of Negative Payments. - Weina Wang 001; Lei Ying 001; Junshan Zhang (WINE, 2016)

Data locality in MapReduce: A network perspective. - Weina Wang 001; Lei Ying 001 (Perform. Evaluation, 2016)

On the Relation Between Identifiability, Differential Privacy, and Mutual-Information Privacy. - Weina Wang 001; Lei Ying 001; Junshan Zhang (IEEE Trans. Inf. Theory, 2016)

On the Performance of Largest-Deficit-First for Scheduling Real-Time Traffic in Wireless Networks. - Xiaohan Kang; Weina Wang 001; Juan José Jaramillo; Lei Ying 001 (IEEE/ACM Trans. Netw., 2016)

MapTask Scheduling in MapReduce With Data Locality: Throughput and Heavy-Traffic Optimality. - Weina Wang 001; Kai Zhu 002; Lei Ying 001; Jian Tan 001; Li Zhang 002 (IEEE/ACM Trans. Netw., 2016)

Asymptotic response time analysis for multi-task parallel jobs. - Weina Wang 001; Mor Harchol-Balter; Haotian Jiang; Alan Scheller-Wolf; R. Srikant 001 (CoRR, 2017)

The Drift Method for Heavy Traffic Limits, with Applications in Data Centers and Networks. - Siva Theja Maguluri; R. Srikant 001; Weina Wang 001 (SIGMETRICS Perform. Evaluation Rev., 2017)

Heavy-Traffic Delay Insensitivity in Connection-Level Models of Data Transfer with Proportionally Fair Bandwidth Sharing. - Weina Wang 001; Siva Theja Maguluri; R. Srikant 001; Lei Ying 001 (SIGMETRICS Perform. Evaluation Rev., 2017)

A Winners-Take-All Incentive Mechanism for Crowd-Powered Systems. - Pengfei Jiang 001; Weina Wang 001; Yao Zhou; Jingrui He; Lei Ying 001 (NetEcon@SIGMETRICS, 2018)

Delay Asymptotics and Bounds for Multi-Task Parallel Jobs. - Weina Wang 001; Mor Harchol-Balter; Haotian Jiang; Alan Scheller-Wolf; R. Srikant 001 (SIGMETRICS Perform. Evaluation Rev., 2018)

The Value of Privacy: Strategic Data Subjects, Incentive Mechanisms, and Fundamental Limits. - Weina Wang 001; Lei Ying 001; Junshan Zhang (ACM Trans. Economics and Comput., 2018)

Data Collection from Privacy-Aware Users in the Presence of Social Learning. - Abdullah Basar Akbay; Weina Wang 001; Junshan Zhang (Allerton, 2019)

Almost Boltzmann Exploration. - Harsh Gupta; Seo Taek Kong; R. Srikant 001; Weina Wang 001 (CoRR, 2019)

QuickStop: A Markov Optimal Stopping Approach for Quickest Misinformation Detection. - Honghao Wei; Xiaohan Kang; Weina Wang 001; Lei Ying 001 (Proc. ACM Meas. Anal. Comput. Syst., 2019)

Delay asymptotics and bounds for multitask parallel jobs. - Weina Wang 001; Mor Harchol-Balter; Haotian Jiang; Alan Scheller-Wolf; R. Srikant 001 (Queueing Syst. Theory Appl., 2019)

Caching with Delayed Hits. - Nirav Atre; Justine Sherry; Weina Wang 001; Daniel S. Berger (SIGCOMM, 2020)

Optimal Resource Allocation for Elastic and Inelastic Jobs. - Benjamin Berg; Mor Harchol-Balter; Benjamin Moseley; Weina Wang 001; Justin Whitehouse (SPAA, 2020)

Dispatching Parallel Jobs to Achieve Zero Queuing Delay. - Wentao Weng; Weina Wang 001 (CoRR, 2020)

On the Privacy-Utility Tradeoff in Peer-Review Data Analysis. - Wenxin Ding; Nihar B. Shah; Weina Wang 001 (CoRR, 2020)

Privacy-Utility Tradeoffs in Routing Cryptocurrency over Payment Channel Networks. - Weizhao Tang; Weina Wang 001; Giulia Fanti; Sewoong Oh (Proc. ACM Meas. Anal. Comput. Syst., 2020)

Achieving Zero Asymptotic Queueing Delay for Parallel Jobs. - Wentao Weng; Weina Wang 001 (Proc. ACM Meas. Anal. Comput. Syst., 2020)

Attributed Graph Alignment. - Ning Zhang; Weina Wang 001; Lele Wang 001 (ISIT, 2021)

Job Dispatching Policies for Queueing Systems with Unknown Service Rates. - Tuhinangshu Choudhury; Gauri Joshi; Weina Wang 001; Sanjay Shakkottai (MobiHoc, 2021)

Impact of Social Learning on Privacy-Preserving Data Collection. - Abdullah Basar Akbay; Weina Wang 001; Junshan Zhang (IEEE J. Sel. Areas Inf. Theory, 2021)

Zero Queueing for Multi-Server Jobs. - Weina Wang 001; Qiaomin Xie; Mor Harchol-Balter (Proc. ACM Meas. Anal. Comput. Syst., 2021)

The M/M/k with Deterministic Setup Times. - Jalani Williams; Mor Harchol-Balter; Weina Wang 001 (Proc. ACM Meas. Anal. Comput. Syst., 2021)

Probing to Minimize. - Weina Wang 001; Anupam Gupta 001; Jalani Williams (ITCS, 2022)

Calibration with Privacy in Peer Review. - Wenxin Ding; Gautam Kamath 001; Weina Wang 001; Nihar B. Shah (ISIT, 2022)

Sharp waiting-time bounds for multiserver jobs. - Yige Hong; Weina Wang 001 (MobiHoc, 2022)

On low-complexity quickest intervention of mutated diffusion processes through local approximation. - Qining Zhang; Honghao Wei; Weina Wang 001; Lei Ying 001 (MobiHoc, 2022)

SurgeProtector: mitigating temporal algorithmic complexity attacks using adversarial scheduling. - Nirav Atre; Hugo Sadok; Erica Chiang; Weina Wang 001; Justine Sherry (SIGCOMM, 2022)

Maximizing Utilization under Time-Varying Resource Requirements. - Yige Hong; Qiaomin Xie; Weina Wang 001 (CoRR, 2022)

The case for phase-aware scheduling of parallelizable jobs. - Benjamin Berg; Justin Whitehouse; Benjamin Moseley; Weina Wang 001; Mor Harchol-Balter (Perform. Evaluation, 2022)

Beyond response time: scheduling to speed up convergence in machine learning. - Weina Wang 001 (Queueing Syst. Theory Appl., 2022)

Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies. - Weina Wang 001; Siva Theja Maguluri; R. Srikant 001; Lei Ying 001 (Math. Oper. Res., 2022)

Restless Bandits with Average Reward: Breaking the Uniform Global Attractor Assumption. - Yige Hong; Qiaomin Xie; Yudong Chen 001; Weina Wang 001 (NeurIPS, 2023)

Sample Efficient Reinforcement Learning in Mixed Systems through Augmented Samples and Its Applications to Queueing Networks. - Honghao Wei; Xin Liu 049; Weina Wang 001; Lei Ying 001 (NeurIPS, 2023)

Tackling Heterogeneous Traffic in Multi-access Systems via Erasure Coded Servers. - Tuhinangshu Choudhury; Weina Wang 001; Gauri Joshi (SIGMETRICS Perform. Evaluation Rev., 2023)

Near-Optimal Stochastic Bin-Packing in Large Service Systems with Time-Varying Item Sizes. - Yige Hong; Qiaomin Xie; Weina Wang 001 (Proc. ACM Meas. Anal. Comput. Syst., 2023)

Efficient Reinforcement Learning for Routing Jobs in Heterogeneous Queueing Systems. - Neharika Jali; Guannan Qu; Weina Wang 001; Gauri Joshi (AISTATS, 2024)

Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation Extended Abstract. - Ziao Wang; Weina Wang 001; Lele Wang 001 (COLT, 2024)

Unichain and Aperiodicity are Sufficient for Asymptotic Optimality of Average-Reward Restless Bandits. - Yige Hong; Qiaomin Xie; Yudong Chen 001; Weina Wang 001 (CoRR, 2024)

Asymptotically Optimal Scheduling of Multiple Parallelizable Job Classes. - Benjamin Berg; Benjamin Moseley; Weina Wang 001; Mor Harchol-Balter (CoRR, 2024)

When is exponential asymptotic optimality achievable in average-reward restless bandits? - Yige Hong; Qiaomin Xie; Yudong Chen 001; Weina Wang 001 (CoRR, 2024)

Achieving O(1/N) Optimality Gap in Restless Bandits through Diffusion Approximation. - Chen Yan; Weina Wang 001; Lei Ying 001 (CoRR, 2024)

On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment. - Ziao Wang; Ning Zhang; Weina Wang 001; Lele Wang 001 (IEEE Trans. Inf. Theory, 2024)

Attributed Graph Alignment. - Ning Zhang; Ziao Wang; Weina Wang 001; Lele Wang 001 (IEEE Trans. Inf. Theory, 2024)

Job assignment in machine learning inference systems with accuracy constraints. - Tuhinangshu Choudhury; Gauri Joshi; Weina Wang 001 (Perform. Evaluation, 2025)

ID policy (with reassignment) is asymptotically optimal for heterogeneous weakly-coupled MDPs. - Xiangcheng Zhang; Yige Hong; Weina Wang 001 (CoRR, 2025)

Efficient Algorithms for Attributed Graph Alignment With Vanishing Edge Correlation. - Ziao Wang; Weina Wang 001; Lele Wang 001 (IEEE Trans. Inf. Theory, 2025)