research
∙
05/11/2023
Learning-Augmented Online Packet Scheduling with Deadlines
The modern network aims to prioritize critical traffic over non-critical...
share
research
∙
11/30/2022
Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity
Let G be a graph and suppose we are given, for each v ∈ V(G), a strict o...
research
∙
05/02/2022
Scheduling with Speed Predictions
Algorithms with predictions is a recent framework that has been used to ...
research
∙
12/09/2021
Estimating the Longest Increasing Subsequence in Nearly Optimal Time
Longest Increasing Subsequence (LIS) is a fundamental statistic of a seq...
research
∙
11/12/2021
A Competitive Algorithm for Throughout Maximization on Identical Machines
This paper considers the basic problem of scheduling jobs online with pr...
research
∙
07/05/2021
Incremental Edge Orientation in Forests
For any forest G = (V, E) it is possible to orient the edges E so that n...
research
∙
09/21/2020
Distributed Algorithms for Matching in Hypergraphs
We study the d-Uniform Hypergraph Matching (d-UHM) problem: given an n-v...
research
∙
11/05/2019
Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators
We present a (1+ε)-approximate parallel algorithm for computing shortest...
research
∙
05/02/2019
Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity
Many modern parallel systems, such as MapReduce, Hadoop and Spark, can b...
research
∙
05/08/2018
