Neil Immerman
Top View
- On the Complexity of the St-Connectivity Problem
- Descriptive Complexity
- Bibliography
- Dynamic Complexity of Expansion
- What Is Theoretical Computer Science? (Preliminary Version)
- Progress in Computational Complexity Theory
- Realizable Paths and the NL Vs L Problem
- STOC ’95 to Qualify for the Early Registration Fee, Your Registration Application Must Be Postmarked by Monday, May 1, 1995
- Subspace-Invariant Ac0 Formulas
- Satisfiability Coding Lemma
- Directed Planar Reachability Is in Unambiguous Log-Space
- Streaming Algorithms Via Reductions