On the Parameterized Complexity of Default Logic and Autoepistemic Logic

On the parity complexity measures of Boolean functions

On the polynomial depth of various sets of random strings

On the Power of Positive Turing Reductions

On the Power of Unambiguity in Logspace

On the probabilistic approach to the random satisfiability problem

On the Problem of Local Randomness in Privacy Amplification with an Active Adversary

On the Proof Complexity of Deep Inference

On the Relative Strength of Pebbling and Resolution

On the Running Time of the Shortest Programs

On the Satisfiability Threshold and Clustering of Solutions of Random 3-SAT Formulas

On the Scaling Window of Model RB

On the Sensitivity of Cyclically-Invariant Boolean Functions

On the Simulation of Adaptive Measurements via Postselection

On the Solution of Graph Isomorphism by Dynamical Algorithms

On the solution of the Graph Isomorphism Problem Part 1

On the Solution-Space Geometry of Random Constraint Satisfaction Problems

On the structure of linear-time reducibility

On the survey-propagation equations for the random K-satisfiability problem

On the time complexity of 2-tag systems and small universal Turing machines