Weina Wang
Orcid: 0000-0001-6808-0156Affiliations:
- 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:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on cs.cmu.edu
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
IEEE Trans. Inf. Theory, May, 2024
When is exponential asymptotic optimality achievable in average-reward restless bandits?
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
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
SIGMETRICS Perform. Evaluation Rev., April, 2023
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
Queueing Syst. Theory Appl., 2022
Perform. Evaluation, 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
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
Proceedings of the IEEE International Symposium on Information Theory, 2022
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
2021
IEEE J. Sel. Areas Inf. Theory, 2021
Proceedings of the MobiHoc '21: The Twenty-second International Symposium on Theory, 2021
Proceedings of the IEEE International Symposium on Information Theory, 2021
2020
Proc. ACM Meas. Anal. Comput. Syst., 2020
Proc. ACM Meas. Anal. Comput. Syst., 2020
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020
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
Queueing Syst. Theory Appl., 2019
Proc. ACM Meas. Anal. Comput. Syst., 2019
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
SIGMETRICS Perform. Evaluation Rev., 2018
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
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
Proceedings of the Web and Internet Economics - 12th International Conference, 2016
Proceedings of the 54th Annual Allerton Conference on Communication, 2016
2015
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
Proceedings of the 49th Asilomar Conference on Signals, Systems and Computers, 2015
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