A Counterexample to the Generalized Linial-Nisan Conjecture
A Critique of "Solving the P/NP Problem Under Intrinsic Uncertainty", arXiv:0811.0463
A Critique of a Polynomial-time SAT Solver Devised by Sergey Gubin
A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative Weights
A definable number which cannot be approximated algorithmically
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
A dichotomy theorem for conservative general-valued CSPs
A Dichotomy Theorem for Polynomial Evaluation
A Dichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs
A direct product theorem for bounded-round public-coin randomized communication complexity
A direct sum theorem in communication complexity via message compression
A discrepancy lower bound for information complexity
A Divergence Formula for Randomness and Dimension
A Divergence Formula for Randomness and Dimension (Short Version)
A Dual Approach for Solving Nonlinear Infinite-Norm Minimization Problems with Applications in Separable Cases
A Dual Polynomial for OR
A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two
A Family of Counter Examples to an Approach to Graph Isomorphism
A first approach for a possible cellular automaton model of fluids dynamics
A Formalization of Polytime Functions