Existentially Restricted Quantified Constraint Satisfaction

Explicit Optimal Hardness via Gaussian stability results

Exploring k-Colorability

Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix

Exponential Time Complexity of Weighted Counting of Independent Sets

Expressing an NP-Complete Problem as the Solvability of a Polynomial Equation

Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence

Extractors and an efficient variant of Muchnik's theorem

Fairness Through Awareness

Fast algorithms for computing isogenies between elliptic curves

Fast and Simple Methods For Computing Control Points

Fast Balanced Partitioning in Hard, Even on Grids and Trees

Fast Enumeration of Combinatorial Objects

Fast Exact Method for Solving the Travelling Salesman Problem

Faster Polynomial Multiplication via Discrete Fourier Transforms

Feasible Depth

Finding and counting vertex-colored subtrees

Finding Exact Minimal Polynomial by Approximations

Finding of k in Fagin's R. Theorem 24

Finite automata for testing uniqueness of Eulerian trails