Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Truly Tight-in-$\Delta$ Bounds for Bipartite Maximal Matching and
  Variants   In a recent breakthrough result, Balliu et al. [FOCS'19] proved a
deterministic $\Omega(\min(\Delta,\log n /\log \log n))$-round and a randomized
$\Omega(\min(\Delta,\log \log n/\log \log \log n))$-round lower bound for the
complexity of the bipartite maximal matching problem on $n$-node graphs in the
LOCAL model of distributed computing.
  Both lower bounds are asymptotically tight as a function of the maximum
degree $\Delta$.
  We provide truly tight bounds in $\Delta$ for the complexity of bipartite
maximal matching and many natural variants, up to and including the additive
constant.
  As a by-product, our results yield a considerably simplified version of the
proof by Balliu et al.
  We show that our results can be obtained via bounded automatic round
elimination, a version of the recent automatic round elimination technique by
Brandt [PODC'19] that is particularly suited for automatization from a
practical perspective.
  In this context, our work can be seen as another step towards the
automatization of lower bounds in the LOCAL model.

21
The categories of this paper are: adap-org
10
The categories of this paper are: q-bio
36
The categories of this paper are: cmp-lg
17
The categories of this paper are: q-fin
18
The categories of this paper are: econ
8
The categories of this paper are: hep-ex
0
The categories of this paper are: hep-ph
27
The categories of this paper are: comp-gas
19
The categories of this paper are: eess
9
The categories of this paper are: nlin
29
The categories of this paper are: funct-an
37
The categories of this paper are: supr-con
25
The categories of this paper are: patt-sol
11
The categories of this paper are: hep-lat
31
The categories of this paper are: ao-sci
35
The categories of this paper are: mtrl-th