Faster Radix Sort via Virtual Memory and Write-Combining

Faster Replacement Paths

Faster Streaming algorithms for graph spanners

Faster subsequence recognition in compressed strings

Faster Subset Selection for Matrices and Applications

Faster Treasure Hunt and Better Strongly Universal Exploration Sequences

FastSIR Algorithm: A Fast Algorithm for simulation of epidemic spread in large networks by using SIR compartment model

Fault-Tolerant Consensus in Unknown and Anonymous Networks

Fault-Tolerant Facility Location: a randomized dependent LP-rounding algorithm

Fault-tolerant routing in peer-to-peer systems

Fault-Tolerant Spanners: Better and Simpler

Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems

Feedback Vertex Set in Mixed Graphs

Finding a Feasible Flow in a Strongly Connected Network

Finding approximate palindromes in strings

Finding Cliques of a Graph using Prime Numbers

Finding Connected Components on Map-reduce in Logarithmic Rounds

Finding Cycles and Trees in Sublinear Time

Finding Dense Subgraphs in G(n,1/2)

Finding Endogenously Formed Communities