Qingsong Liu

Qingsong Liu is a Postdoctoral Researcher at the University of Massachusetts Amherst, affiliated with the Lederle Graduate Research Center. His primary focus is on online algorithms, optimization techniques, and their applications in distributed systems, communication networks, and cloud computing. He explores challenges such as fair resource allocation, scheduling under constraints, and privacy-preserving mechanisms.

Research interests include adversarial combinatorial bandits, real-time scheduling, and convex optimization with switching costs. His work often addresses multi-agent systems, constraint violations, and time-varying environments, aiming to develop scalable solutions for modern computational problems.

Recent publications highlight trends in dynamic regret analysis, decentralized scheduling, and privacy-enhanced DNS services (e.g., T2DNS). While no scientific awards or grants are explicitly listed, his contributions emphasize theoretical foundations and practical implementations in networking and machine learning domains.