The modern network aims to prioritize critical traffic over non-critical...
Let G be a graph and suppose we are given, for each v ∈ V(G), a strict
o...
Algorithms with predictions is a recent framework that has been used to
...
Longest Increasing Subsequence (LIS) is a fundamental statistic of a
seq...
This paper considers the basic problem of scheduling jobs online with
pr...
For any forest G = (V, E) it is possible to orient the edges E so that n...
We study the d-Uniform Hypergraph Matching (d-UHM) problem: given an
n-v...
We present a (1+ε)-approximate parallel algorithm for computing
shortest...
Many modern parallel systems, such as MapReduce, Hadoop and Spark, can b...
We study graph connectivity problem in MPC model. On an undirected graph...