Inapproximability of the Tutte polynomial

Inapproximability of the Tutte polynomial of a planar graph

Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems

Inclusion of Unambiguous RE#s is NP-Hard

Independence of P vs. NP in regards to oracle relativizations

Independence Properties of Algorithmically Random Sequences

Independent sets in random graphs from the weighted second moment method

Individual Communication Complexity

Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition

Inseparability and Strong Hypotheses for Disjoint NP Pairs

Instant Computing - A New Computation Paradigm

Instruction sequences and non-uniform complexity theory

Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack

Interactive proofs with competing teams of no-signaling provers

Interference Automata

Intractability of the Minimum-Flip Supertree problem and its variants

Intrinsically Universal Cellular Automata

Intuitionistic implication makes model checking hard

Is Space a Stronger Resource than Time? Positive Answer for the Nondeterministic at-Least-Quadratic Time Case

Isomorphic Implication