research
∙
05/10/2023
Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
Given 𝐀∈ℝ^n × n with entries bounded in magnitude by 1, it is well-known...
share
research
∙
03/11/2023
No-regret Algorithms for Fair Resource Allocation
We consider a fair resource allocation problem in the no-regret setting ...
research
∙
09/25/2021
Optimizing Age-of-Information in Adversarial Environments with Channel State Information
This paper considers a multi-user downlink scheduling problem with acces...
research
∙
09/16/2021
Sublinear Time Eigenvalue Approximation via Random Sampling
We study the problem of approximating the eigenspectrum of a symmetric m...
research
∙
11/10/2020
Optimizing the Age-of-Information for Mobile Users in Adversarial and Stochastic Environments
We study a multi-user downlink scheduling problem for optimizing the fre...
research
∙
05/12/2020
Competitive Algorithms for Minimizing the Maximum Age-of-Information
In this short paper, we consider the problem of designing a near-optimal...
research
∙
03/31/2020
Fundamental Limits of Online Network-Caching
Optimal caching of files in a content distribution network (CDN) is a pr...
research
∙
01/15/2020
Fundamental Limits of Age-of-Information in Stationary and Non-stationary Environments
We study the multi-user scheduling problem for minimizing the Age of Inf...
research
∙
12/24/2019