Random Generation and Approximate Counting of Combinatorial Structures

Random subcubes as a toy model for constraint satisfaction problems

Randomized Self-Assembly for Exact Shapes

Randomness Testing of Compressed Data

Reachability-time games on timed automata

Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability

Real numbers having ultimately periodic representations in abstract numeration systems

Realizable Paths and the NL vs L Problem

Recognizing Members of the Tournament Equilibrium Set is NP-hard

Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP

Recombinations of Busy Beaver Machines

Reconstruction of Markov Random Fields from Samples: Some Easy Observations and Algorithms

Rectangle Size Bounds and Threshold Covers in Communication Complexity

Recursively Undecidable Properties of NP

Reducibility Among Fractional Stability Problems

Reducing SAT to 2-SAT

Reducing Tile Complexity for Self-Assembly Through Temperature Programming

Reducing Tile Complexity for the Self-Assembly of Scaled Shapes Through Temperature Programming

Reductions Between Expansion Problems

Refutation of Aslam's Proof that NP = P