Research
Developing efficient algorithms that power faster, smarter, and more reliable computing across diverse applications.
Coinduction is a powerful technique for reasoning about unfounded sets, unbounded structures, infinite automata, and interactive computations. Where induction corresponds to least fixed points semantics, co-induction corresponds to greatest fixed point semantics. In this talk…
Is matching in NC, i.e., is there a deterministic fast parallel algorithm for it? This has been an outstanding open question in TCS for over three decades, ever since the discovery of Random NC matching…
Our results are: ** Introduce the problem of finding stable matchings that are robust to errors in the input. ** An efficient algorithm for the following class of errors: Permute arbitrarily the preference list of…
What is the common denominator between the following situations: a doctor choosing among different drugs for a sequence of patients; a website selecting ads for its visitors based on the information it has about them;…
