FPRAS for computing a lower bound for weighted matching polynomial of graphs
Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas
From heaps of matches to the limits of computability
From Holant To #CSP And Back: Dichotomy For Holant$^c$ Problems
From Invariants to Canonization in Parallel
From Neel to NPC: Colouring Small Worlds
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits
Frugal and Truthful Auctions for Vertex Covers, Flows, and Cuts
Functions that preserve p-randomness