Cs-Cc
Where are the really hard manipulation problems? The phase transition in manipulating the veto rule
New Learning and Testing Problems for Read-Once Functions
Hardness and Algorithms for Rainbow Connectivity
The Computational Power of Minkowski Spacetime
k-Means has Polynomial Smoothed Complexity
Note on Max Lin-2 above Average
A Recursive Definition of the Holographic Standard Signature
The One-Way Communication Complexity of Group Membership
On the complexity of stratified logics
Homogeneous and Non Homogeneous Algorithms
Inapproximability for metric embeddings into R^d
Faster Polynomial Multiplication via Discrete Fourier Transforms
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
Radio resource allocation in OFDMA multi-cell networks
PageRank Optimization by Edge Selection
Differential Recursion and Differentially Algebraic Functions
Ambiguity and Communication
The Complexity of Determining Existence a Hamiltonian Cycle is $O(n^3)$
A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent
Compression-based investigation of the dynamical properties of cellular automata and other systems
Tetravex is NP-complete
The P versus NP Brief
