research
∙
08/19/2023
Laminar Matroid Secretary: Greedy Strikes Back
We show that a simple greedy algorithm is 4.75 probability-competitive f...
share
research
∙
03/11/2023
E2CoPre: Energy Efficient and Cooperative Collision Avoidance for UAV Swarms with Trajectory Prediction
This paper addresses the collision avoidance problem of UAV swarms in th...
research
∙
07/22/2022
WRHT: Efficient All-reduce for Distributed DNN Training in Optical Interconnect System
Communication efficiency plays an important role in accelerating the dis...
research
∙
05/13/2020
Fully Online Matching II: Beating Ranking and Water-filling
Karp, Vazirani, and Vazirani (STOC 1990) initiated the study of online b...
research
∙
10/18/2018
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model
Huang et al. (STOC 2018) introduced the fully online matching problem, a...
research
∙
06/06/2018
Online Makespan Minimization: The Power of Restart
We consider the online makespan minimization problem on identical machin...
research
∙
12/14/2017
