Complexity of Monadic inf-datalog. Application to temporal logic

Complexity of Splits Reconstruction for Low-Degree Trees

Compositional competitiveness for distributed algorithms

Compressed Matrix Multiplication

Compressed Representations of Permutations, and Applications

Compressed String Dictionaries

Compressed Text Indexes:From Theory to Practice!

Compressed Transmission of Route Descriptions

Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal

Compressive Mechanism: Utilizing Sparse Representation in Differential Privacy

Computation in Large-Scale Scientific and Internet Data Applications is a Focus of MMDS 2010

Computing a Discrete Logarithm in O(n^3)

Computing a Frobenius Coin Problem decision problem in O(n^2)

Computing a Longest Common Palindromic Subsequence

Computing a Nonnegative Matrix Factorization -- Provably

Computing alignment plots efficiently

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