- Weina Wang, Qiaomin Xie, Mor Harchol-Balter. Zero Queueing for Multi-Server Jobs. POMACS, 5(1), 2021.
- Iman Akbari, Mohammad A. Salahuddin, Leni Ven, Noura Limam, Raouf Boutaba, Bertrand Mathieu, Stephanie Moteau, Stéphane Tuffin. A Look Behind the Curtain: Traffic Classification in an Increasingly Encrypted Web. POMACS, 5(1), 2021.
- Thibaut Cuvelier, Richard Combes, Eric Gourdin. Statistically Efficient, Polynomial-Time Algorithms for Combinatorial Semi-Bandits. POMACS, 5(1), 2021.
- Behnam Pourghassemi, Jordan Bonecutter, Zhou Li 0001, Aparna Chandramowlishwaran. adPerf: Characterizing the Performance of Third-party Ads. POMACS, 5(1), 2021.
- Lishan Yang, Bin Nie, Adwait Jog, Evgenia Smirni. SUGAR: Speeding Up GPGPU Application Resilience Estimation with Input Sizing. POMACS, 5(1), 2021.
- Zhaowei Zhu, Jingxuan Zhu, Ji Liu 0001, Yang Liu 0018. Federated Bandit: A Gossiping Approach. POMACS, 5(1), 2021.
- Jing Tang 0004, Xueyan Tang, Andrew Lim 0001, Kai Han 0003, Chongshou Li, Junsong Yuan. Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint. POMACS, 5(1), 2021.
- Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid 0001. Input-Dynamic Distributed Algorithms for Communication Networks. POMACS, 5(1), 2021.
- Kai Han 0003, Shuang Cui, Tianshuai Zhu, Enpei Zhang, Benwei Wu, Zhizhuo Yin, Tong Xu, ShaoJie Tang, He Huang 0001. Approximation Algorithms for Submodular Data Summarization with a Knapsack Constraint. POMACS, 5(1), 2021.
- Sungjin Im, Benjamin Moseley, Kamesh Munagala, Kirk Pruhs. Dynamic Weighted Fairness with Minimal Disruptions. POMACS, 4(1), 2020.