Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Lower Bounds for Shared-Memory Leader Election under Bounded Write
  Contention   This paper gives tight logarithmic lower bounds on the solo step complexity
of leader election in an asynchronous shared-memory model with single-writer
multi-reader (SWMR) registers, for randomized obstruction-free algorithms.
  The approach extends to lower bounds for randomized obstruction-free
algorithms using multi-writer registers under bounded write concurrency,
showing a trade-off between the solo step complexity of a leader election
algorithm, and the worst-case contention incurred by a processor in an
execution.

26
The categories of this paper are: bayes-an
29
The categories of this paper are: funct-an
6
The categories of this paper are: astro-ph
13
The categories of this paper are: quant-ph
34
The categories of this paper are: chem-ph
35
The categories of this paper are: mtrl-th
18
The categories of this paper are: econ
28
The categories of this paper are: alg-geom
17
The categories of this paper are: q-fin
12
The categories of this paper are: nucl-th
5
The categories of this paper are: gr-qc
10
The categories of this paper are: q-bio
33
The categories of this paper are: plasm-ph
4
The categories of this paper are: cond-mat
2
The categories of this paper are: math
20
The categories of this paper are: acc-phys