Seminars

This paper proves the first super-logarithmic lower bounds on the cell-probe complexity of dynamic boolean (a.k.a. decision) data structure problems, a long-standing milestone in data structure lower bounds.We introduce a new method for proving...

Communication complexity studies the minimal amount of information two parties need to exchange to compute a joint function of their inputs. Results, especially lower bounds in this basic model found applications in many other areas of computer...

One of the great mysteries in computational condensed matter physics is the remarkable practical success of the Density Matrix Renormalization Group (DMRG) algorithm, since its invention a quarter century ago, for finding low energy states of 1D...

One of the great mysteries in computational condensed matter physics is the remarkable practical success of the Density Matrix Renormalization Group (DMRG) algorithm, since its invention a quarter century ago, for finding low energy states of 1D...