“(Private) Kernelized Bandits with Distributed Biased Feedback”, AI Convergence Seminar, Ewha Womans University, July 2024.
“Fair Resource Allocation and Learning: Combinatorial Sleeping Bandits with Fairness Constraints,” The Renouard Distinguished Lecture Series, School of Engineering and Applied Science, Gonzaga University, April 2022.
“Fair Resource Allocation and Learning: Combinatorial Sleeping Bandits with Fairness Constraints,” Old Dominion University, December 2021.
“Fair Resource Allocation and Learning: Combinatorial Sleeping Bandits with Fairness Constraints,” Middle East Technical University, Turkey, November 2021.
“Fair Resource Allocation and Learning: Combinatorial Sleeping Bandits with Fairness Constraints,” 55th Annual Conference on Information Sciences and Systems (CISS), March 2021.
“Fair Resource Allocation and Learning: Combinatorial Sleeping Bandits with Fairness Constraints,” University of Massachusetts Dartmouth, November 2020.
“Fair Resource Allocation and Learning: Combinatorial Sleeping Bandits with Fairness Constraints,” University at Buffalo, February 2020.
“Fair Resource Allocation and Learning: Combinatorial Sleeping Bandits with Fairness Constraints,” Virginia Tech, January 2020.
“Combinatorial Sleeping Bandits with Fairness Constraints,” University of Delaware, November 2019.
“Combinatorial Sleeping Bandits with Fairness Constraints,” Yale University, October 2019.
“Combinatorial Sleeping Bandits with Fairness Constraints,” The 40th IEEE Sarnoff Symposium, Newark, NJ, September 2019.
“Combinatorial Sleeping Bandits with Fairness Constraints,” Shanghai Jiaotong University, China, August 2019.
“Combinatorial Sleeping Bandits with Fairness Constraints,” Nanchang University, China, August 2019.
“Combinatorial Sleeping Bandits with Fairness Constraints,” Zhejiang University of Technology, China, August 2019.
“Convex Optimization Algorithms,” Summer Workshop on Computing and Statistics, College of Science and Technology, Temple University, June 2019.
“What Queueing Theory Teaches Us About Computer and Network Systems Design,” CIS 1001 Invited Lecture, Temple University, April 2019.
“The Power of Waiting for More than One Response in Minimizing the Age-of-Information,” University of Delaware, September 2018.
“The Power of Waiting for More than One Response in Minimizing the Age-of-Information,” Villanova University, September 2018.
“The Power of Waiting for More than One Response in Minimizing the Age-of-Information,” Shanghai Jiaotong University, China, December 2017.
“The Power of Waiting for More than One Response in Minimizing the Age-of-Information,” Shanghai University, China, December 2017.
“The Power of Waiting for More than One Response in Minimizing the Age-of-Information,” Southern University of Science and Technology, China, December 2017.
“The Power of Waiting for More than One Response in Minimizing the Age-of-Information,” Zhejiang University of Technology, China, November 2017.
“What Queueing Theory Teaches Us About Computer and Networking Systems Design,” NSF REU Faculty Seminar, Temple University, July 2017.
“Node-based Scheduling: Maximizing Throughput and Minimizing Evacuation Time,” Fish Bowl Seminar Series, Texas A&M University, September 2016.
“On Designing High Throughput, Low Delay, and Low Complexity Mechanisms for Wireless Networks: A Multichannel Perspective,” NSF REU Faculty Seminar, Temple University, July 2016.
“On Designing High Throughput, Low Delay, and Low Complexity Mechanisms for Wireless Networks: A Multichannel Perspective,” ECE Colloquium, George Washington University, September 2014.