Identifying Shapes Using Self-Assembly (extended abstract)

If P \neq NP then Some Strongly Noninvertible Functions are Invertible

Immunity and Pseudorandomness of Context-Free Languages

Implementation of Logical Functions in the Game of Life

Implicit complexity for coinductive data: a characterization of corecurrence

Impossibility of independence amplification in Kolmogorov complexity theory

Improved Approximation of Linear Threshold Functions

Improved Direct Product Theorems for Randomized Query Complexity

Improved Exponential Time Lower Bound of Knapsack Problem under BT model

Improved hardness results for unique shortest vector problem

Improved Inapproximability For Submodular Maximization

Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model

Improved Inapproximability Results for Maximum k-Colorable Subgraph

Improved Lower Bounds for the Shortest Superstring and Related Problems

Improved Monotone Circuit Depth Upper Bound for Directed Graph Reachability

Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization

Inapproximability of Combinatorial Optimization Problems

Inapproximability of maximal strip recovery

Inapproximability of Maximum Weighted Edge Biclique and Its Applications

Inapproximability of NP-Complete Variants of Nash Equilibrium