Computing an Integer Prime Factoring in O(n^2.5)

Computing Crossing Numbers in Quadratic Time

Computing finite-dimensional bipartite quantum separability

Computing Least Fixed Points of Probabilistic Systems of Polynomials

Computing Lempel-Ziv Factorization Online

Computing Majority with Triple Queries

Computing Minimum Spanning Trees with Uncertainty

Computing multiway cut within the given excess over the largest minimum isolating cut

Computing q-gram Frequencies on Collage Systems

Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts

Computing Resolution-Path Dependencies in Linear Time

Computing the diameter polynomially faster than APSP

Computing the Girth of a Planar Graph in Linear Time

Computing the Number of Longest Common Subsequences

Computing the Tutte polynomial in vertex-exponential time

Conauto-2.0: Fast Isomorphism Testing and Automorphism Group Computation

Concave Generalized Flows with Applications to Market Equilibria

CONCISE: Compressed 'n' Composable Integer Set

Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems

Confluent Persistence Revisited