Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Fooling Views: A New Lower Bound Technique for Distributed Computations
  under Congestion   We introduce a novel lower bound technique for distributed graph algorithms
under bandwidth limitations.
  We define the notion of \emph{fooling views} and exemplify its strength by
proving two new lower bounds for triangle membership in the CONGEST(B) model:
  (i) Any $1$-round algorithm requires $B\geq c\Delta \log n$ for a constant
$c>0$.
  (ii) If $B=1$, even in constant-degree graphs any algorithm must take
$\Omega(\log^* n)$ rounds.
  The implication of the former is the first proven separation between the
LOCAL and the CONGEST models for deterministic triangle membership.
  The latter result is the first non-trivial lower bound on the number of
rounds required, even for \emph{triangle detection}, under limited bandwidth.
  All previous known techniques are provably incapable of giving these bounds.
  We hope that our approach may pave the way for proving lower bounds for
additional problems in various settings of distributed computing for which
previous techniques do not suffice.

20
The categories of this paper are: acc-phys
16
The categories of this paper are: stat
13
The categories of this paper are: quant-ph
15
The categories of this paper are: nucl-ex
28
The categories of this paper are: alg-geom
29
The categories of this paper are: funct-an
8
The categories of this paper are: hep-ex
11
The categories of this paper are: hep-lat
2
The categories of this paper are: math
23
The categories of this paper are: solv-int
18
The categories of this paper are: econ
9
The categories of this paper are: nlin
25
The categories of this paper are: patt-sol
22
The categories of this paper are: chao-dyn
6
The categories of this paper are: astro-ph
17
The categories of this paper are: q-fin