Cs-Cc
On Quantification of Anchor Placement
Turing-equivalent automata using a fixed-size quantum memory
On groups that have normal forms computable in logspace
Simulating Special but Natural Quantum Circuits
A direct product theorem for bounded-round public-coin randomized communication complexity
A New Order-theoretic Characterisation of the Polytime Computable Functions
Social Influence as a Voting System: a Complexity Analysis of Parameters and Properties
Fuel Efficient Computation in Passive Self-Assembly
Graph Operations on Parity Games and Polynomial-Time Algorithms
New affine-invariant codes from lifting
Hamming Approximation of NP Witnesses
A note on anti-coordination and social interactions
On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem
Between Arrow and Gibbard-Satterthwaite; A representation theoretic approach
On Quantum Turing Machine Halting Deterministically
Sliding Windows with Limited Storage
The number system hidden inside the Boolean satisfiability problem
The computational complexity of Minesweeper
On the CNF-complexity of bipartite graphs containing no $K_{2,2}$s
A polynomial time algorithm for computing the HNF of a module over the integers of a number field
Compression with wildcards: All models of a Boolean 2-CNF
Adversary Lower Bound for Element Distinctness
