Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function

Critique of Feinstein's Proof that P is not Equal to NP

Cross-Composition: A New Technique for Kernelization Lower Bounds

Cryptographic Randomized Response Techniques

Curves That Must Be Retraced

Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings

Decidability and Universality in Symbolic Dynamical Systems

Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton

Decision Problems For Convex Languages

Decomposition Techniques for Subgraph Matching

Decompositions of graphs of functions and efficient iterations of lookup tables

Defying Dimensions Mod 6

Degree two approximate Boolean #CSPs with variable weights

Dense locally testable codes cannot have constant rate and distance

Densities and entropies in cellular automata

Depth as Randomness Deficiency

Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas

Derandomization of Online Assignment Algorithms for Dynamic Graphs

Derandomized Parallel Repetition via Structured PCPs

Derandomizing from Random Strings