A Path Algorithm for Affine Kazhdan-Lusztig Polynomials
  We develop an algorithm for computing affine Kazhdan-Lusztig polynomials, for all Lie types. This generalizes our previously published algorithm for type A, which in turn is a faster version of an algorithm due to Lascouz, Leclerc and Thibon (proposed in the setting of Hecke algebras of type A, at roots of unity.) 
Frederick M. Goodman and Hans Wenzl