Cs-Cc
Classical and quantum satisfiability
Classical and quantum partition bound and detector inefficiency
Observability of Turing Machines: a Refinement of the Theory of Computation
Approximating the partition function of planar two-state spin systems
Amortized communication complexity of an equality predicate
Sparse extractor families for all the entropy
The physical limit of logical compare operation
Satisfiability vs. Finite Satisfiability in Elementary Modal Logics
Set graphs. II. Complexity of set graph recognition and similar problems
Towards the fixed parameter tractability of constructing minimal phylogenetic networks from arbitrary sets of nonbinary trees
The Cost of Address Translation
Lattice Sparsification and the Approximate Closest Vector Problem
Maximum Balanced Subgraph Problem Parameterized Above Lower Bound
Natural Proofs Versus Derandomization
One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece
AND and/or OR: Uniform Polynomial-Size Circuits
Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time
Is Turings Thesis the Consequence of a More General Physical Principle?
On the Complexity of Trial and Error
On the rank of $ntimes n$ matrix multiplication
Random k-SAT and the Power of Two Choices
Polynomial Path Orders: A Maximal Model
