Cs-Cc
ASMs and Operational Algorithmic Completeness of Lambda Calculus
Polyominoes Simulating Arbitrary-Neighborhood Zippers and Tilings
Derandomized Parallel Repetition via Structured PCPs
What makes a phase transition? Analysis of the random satisfiability problem
Computational Transition at the Uniqueness Threshold
A Complete Characterization of Statistical Query Learning with Applications to Evolvability
Deterministic Sample Sort For GPUs
Bounded Rationality, Strategy Simplification, and Equilibrium
Phase Transitions in the Coloring of Random Graphs
On Some Classes of Functions and Hypercubes
Fermions and Loops on Graphs. I. Loop Calculus for Determinant
Characterization Of any Non-linear Boolean function Using A Set of Linear Operators
A criterion for "easiness" of certain SAT problems
Branching-time model checking of one-counter processes
Almost-Euclidean subspaces of $ell_1^N$ via tensor products: a simple approach to randomness reduction
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions
An analysis of a random algorithm for estimating all the matchings
Recognizing Members of the Tournament Equilibrium Set is NP-hard
Reducing Tile Complexity for the Self-Assembly of Scaled Shapes Through Temperature Programming
The Graver Complexity of Integer Programming
Kolmogorov Complexity in perspective. Part II: Classification, Information Processing and Duality
On Bounded Integer Programming
