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...
Whenever rational agents form coalitions to execute tasks, doing so via a decentralized negotiation process—while more robust and democratic—may lead to a loss of efficiency ...
Georgios Chalkiadakis, Edith Elkind, Maria Polukar...
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
We study online social networks in which relationships can be either positive (indicating relations such as friendship) or negative (indicating relations such as opposition or ant...
Jure Leskovec, Daniel P. Huttenlocher, Jon M. Klei...
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...