We consider the problem of sequential linear prediction of real-valued sequences under the square-error loss function. For this problem, a prediction algorithm has been demonstrate...
Andrew C. Singer, Suleyman Serdar Kozat, Meir Fede...
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...