Weina Wang

Orcid: 0000-0001-6808-0156

Affiliations:
  • Carnegie Mellon University, Pittsburgh, PA, USA
  • University of Illinois at Urbana-Champaign, IL, USA (2016-2018)
  • Arizona State University, Tempe, AZ, USA (2011-2016)


According to our database1, Weina Wang authored at least 55 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Attributed Graph Alignment.
IEEE Trans. Inf. Theory, August, 2024

On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment.
IEEE Trans. Inf. Theory, May, 2024

When is exponential asymptotic optimality achievable in average-reward restless bandits?
CoRR, 2024

Asymptotically Optimal Scheduling of Multiple Parallelizable Job Classes.
CoRR, 2024

Unichain and Aperiodicity are Sufficient for Asymptotic Optimality of Average-Reward Restless Bandits.
CoRR, 2024

Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation Extended Abstract.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

Efficient Reinforcement Learning for Routing Jobs in Heterogeneous Queueing Systems.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Near-Optimal Stochastic Bin-Packing in Large Service Systems with Time-Varying Item Sizes.
Proc. ACM Meas. Anal. Comput. Syst., December, 2023

Tackling Heterogeneous Traffic in Multi-access Systems via Erasure Coded Servers.
SIGMETRICS Perform. Evaluation Rev., April, 2023

Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation.
CoRR, 2023

Sample Efficient Reinforcement Learning in Mixed Systems through Augmented Samples and Its Applications to Queueing Networks.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Restless Bandits with Average Reward: Breaking the Uniform Global Attractor Assumption.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies.
Math. Oper. Res., November, 2022

Beyond response time: scheduling to speed up convergence in machine learning.
Queueing Syst. Theory Appl., 2022

The case for phase-aware scheduling of parallelizable jobs.
Perform. Evaluation, 2022

Maximizing Utilization under Time-Varying Resource Requirements.
CoRR, 2022

SurgeProtector: mitigating temporal algorithmic complexity attacks using adversarial scheduling.
Proceedings of the SIGCOMM '22: ACM SIGCOMM 2022 Conference, Amsterdam, The Netherlands, August 22, 2022

On low-complexity quickest intervention of mutated diffusion processes through local approximation.
Proceedings of the MobiHoc '22: The Twenty-third International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, Seoul, Republic of Korea, October 17, 2022

Sharp waiting-time bounds for multiserver jobs.
Proceedings of the MobiHoc '22: The Twenty-third International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, Seoul, Republic of Korea, October 17, 2022

Calibration with Privacy in Peer Review.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Probing to Minimize.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
The M/M/k with Deterministic Setup Times.
Proc. ACM Meas. Anal. Comput. Syst., 2021

Zero Queueing for Multi-Server Jobs.
Proc. ACM Meas. Anal. Comput. Syst., 2021

Impact of Social Learning on Privacy-Preserving Data Collection.
IEEE J. Sel. Areas Inf. Theory, 2021

Job Dispatching Policies for Queueing Systems with Unknown Service Rates.
Proceedings of the MobiHoc '21: The Twenty-second International Symposium on Theory, 2021

Attributed Graph Alignment.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Achieving Zero Asymptotic Queueing Delay for Parallel Jobs.
Proc. ACM Meas. Anal. Comput. Syst., 2020

Privacy-Utility Tradeoffs in Routing Cryptocurrency over Payment Channel Networks.
Proc. ACM Meas. Anal. Comput. Syst., 2020

On the Privacy-Utility Tradeoff in Peer-Review Data Analysis.
CoRR, 2020

Dispatching Parallel Jobs to Achieve Zero Queuing Delay.
CoRR, 2020

Optimal Resource Allocation for Elastic and Inelastic Jobs.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Caching with Delayed Hits.
Proceedings of the SIGCOMM '20: Proceedings of the 2020 Annual conference of the ACM Special Interest Group on Data Communication on the applications, 2020

2019
Delay asymptotics and bounds for multitask parallel jobs.
Queueing Syst. Theory Appl., 2019

QuickStop: A Markov Optimal Stopping Approach for Quickest Misinformation Detection.
Proc. ACM Meas. Anal. Comput. Syst., 2019

Almost Boltzmann Exploration.
CoRR, 2019

Data Collection from Privacy-Aware Users in the Presence of Social Learning.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

2018
The Value of Privacy: Strategic Data Subjects, Incentive Mechanisms, and Fundamental Limits.
ACM Trans. Economics and Comput., 2018

Delay Asymptotics and Bounds for Multi-Task Parallel Jobs.
SIGMETRICS Perform. Evaluation Rev., 2018

A Winners-Take-All Incentive Mechanism for Crowd-Powered Systems.
Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation, 2018

2017
Heavy-Traffic Delay Insensitivity in Connection-Level Models of Data Transfer with Proportionally Fair Bandwidth Sharing.
SIGMETRICS Perform. Evaluation Rev., 2017

The Drift Method for Heavy Traffic Limits, with Applications in Data Centers and Networks.
SIGMETRICS Perform. Evaluation Rev., 2017

Asymptotic response time analysis for multi-task parallel jobs.
CoRR, 2017

2016
MapTask Scheduling in MapReduce With Data Locality: Throughput and Heavy-Traffic Optimality.
IEEE/ACM Trans. Netw., 2016

On the Performance of Largest-Deficit-First for Scheduling Real-Time Traffic in Wireless Networks.
IEEE/ACM Trans. Netw., 2016

On the Relation Between Identifiability, Differential Privacy, and Mutual-Information Privacy.
IEEE Trans. Inf. Theory, 2016

Data locality in MapReduce: A network perspective.
Perform. Evaluation, 2016

Buying Data from Privacy-Aware Individuals: The Effect of Negative Payments.
Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Resource allocation for data-parallel computing in networks with data locality.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
A game-theoretic approach to quality control for collecting privacy-preserving data.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

Decentralized scheduling with data locality for data-parallel computation on peer-to-peer networks.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

A minimax distortion view of differentially private query release.
Proceedings of the 49th Asilomar Conference on Signals, Systems and Computers, 2015

2014
On the Tradeoff between Privacy and Distortion in Differential Privacy.
CoRR, 2014

A Minimax Distortion View of Non-Interactive Differential Privacy.
CoRR, 2014

2013
A throughput optimal algorithm for map task scheduling in mapreduce with data locality.
SIGMETRICS Perform. Evaluation Rev., 2013

Map task scheduling in MapReduce with data locality: Throughput and heavy-traffic optimality.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013


  Loading...