On the Minimum Degree up to Local Complementation: Bounds and Complexity
On the NP-Completeness of Some Graph Cluster Measures
On the optimal compression of sets in PSPACE
On the Optimality of a Class of LP-based Algorithms
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