Faster exon assembly by sparse spliced alignment
Faster FAST(Feedback Arc Set in Tournaments)
Faster fully compressed pattern matching by recompression
Faster generation of random spanning trees
Faster Information Dissemination in Dynamic Networks via Network Coding
Faster Least Squares Approximation
Faster Parameterized Algorithms using Linear Programming
Faster Parametric Shortest Path and Minimum Balance Algorithms
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