9 citations · 9 across the 2 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Online Smoothed Demand Management
Adam Lechowicz, Nicolas Christianson, Mohammad Hajiesmaili +2
We introduce and study a class of online problems called online smoothed demand management , motivated by paradigm shifts in grid integration and energy storage fo…
cs.DS2025
Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints
Adam Lechowicz, Nicolas Christianson, Bo Sun +4
We introduce and study spatiotemporal online allocation with deadline constraints (), a new online problem motivated by emerging challenges in sustainability and ene…
cs.DS2024
Risk-Sensitive Online Algorithms
Nicolas Christianson, Bo Sun, Steven Low +1
We study the design of risk-sensitive online algorithms, in which risk measures are used in the competitive analysis of randomized online algorithms. We introduce the CVaR-com…