文章引用情况
1
FAULT-TOLERANT SUBGRAPH FOR SINGLE-SOURCE REACHABILITY: GENERAL AND OPTIMAL2
STRUCTURE OF PROTOCOLS FOR XOR FUNCTIONS3
CONSTRAINT SATISFACTION PROBLEMS FOR REDUCTS OF HOMOGENEOUS GRAPHS4
COUNTING HYPERGRAPH COLORINGS IN THE LOCAL LEMMA REGIME5
THE INDEPENDENCE NUMBER OF THE BIRKHOFF POLYTOPE GRAPH, AND APPLICATIONS TO MAXIMALLY RECOVERABLE CODES6
DETERMINISTIC COMMUNICATION IN RADIO NETWORKS7
ALGEBRAIC ATTACKS AGAINST RANDOM LOCAL FUNCTIONS AND THEIR COUNTERMEASURES8
APPROXIMATION VIA CORRELATION DECAY WHEN STRONG SPATIAL MIXING FAILS9
USING PETAL-DECOMPOSITIONS TO BUILD A LOW STRETCH SPANNING TREE10
IF THE CURRENT CLIQUE ALGORITHMS ARE OPTIMAL, SO IS VALIANT'S PARSER