Groebner basis for a multivariate polynomial ideal is a finite basis of polynomials that has many useful properties. Large memory requirements and computation time for most practical problems hinder the use of Groebner basis in many areas.

Abstract: In many programming languages, values have an associated type that the compilers enforces. For example, adding a value of type INTEGER to a value of type STRING will be flagged as an error by these compilers.

Machine translation has been one of the key problems in computational linguistics. An important part of the same is to get the order of words in the translated sentence correct.

Abstract: Suppose that you have log(n) bits of free working memory, plus an additional poly(n) bits of auxiliary memory which is *full*.

Abstract: In this series of two talks, we will investigate the power of randomized algorithms for the maximum cardinality matching (MCM) and the maximum weight matching (MWM) problems in the online preemptive model.