Fast Approximation Algorithms for Near-optimal Large-scale Network Monitoring
Fast Approximation in Subspaces by Doubling Metric Decomposition
Fast Approximation of Centrality
Fast approximation of matrix coherence and statistical leverage
Fast Arc-Annotated Subsequence Matching in Linear Space
Fast Arithmetics Using Chinese Remaindering
Fast C-K-R Partitions of Sparse Graphs
Fast Compressed Tries through Path Decompositions
Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs
Fast computation of the performance evaluation of biometric systems: application to multibiometric
Fast Construction of Nets in Low Dimensional Metrics, and Their Applications
Fast Deterministic Consensus in a Noisy Environment
Fast Detour Computation for Ride Sharing
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Fast evaluation of union-intersection expressions
Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions
Fast Fraction-Integer Method for Computing Multiplicative Inverse
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
Fast Incremental and Personalized PageRank
Fast Isomorphism Testing of Graphs with Regularly-Connected Components