Chicago Journal of Theoretical Computer Science, 2010
: d-collapsibility is NP-complete for d greater or equal to 4.
Selected Papers from CATS 2009
, Makoto Tatsuta
: Type Checking and Inference for Polymorphic and Existential Types in Multiple-Quantifier and Type-Free Systems.
: Distributing Frequency-Dependent Data Stream Computations.
, founded at