• Publications
  • Influence
On the relative complexity of approximate counting problems
TLDR
This work describes and investigates a third class of counting problems, of intermediate complexity, that is not known to be identical to (i) or (ii), and can be characterised as the hardest problems in a logically defined subclass of #P.
Stabilizing consensus with the power of two choices
TLDR
The main result is a simple randomized algorithm called median rule that, with high probability, just needs O(log m log log n + log n) time and work per process to arrive at an almost stable consensus for any set of m legal values as long as an adversary can corrupt the states of at most √n processes at any time.
The Complexity of Weighted Boolean #CSP
TLDR
A dichotomy theorem is given for the complexity of computing the partition function of an instance of a weighted Boolean constraint satisfaction problem that is parameterized by a finite set of nonnegative functions that may be used to assign weights to the configurations of a problem instance.
Strong Spatial Mixing with Fewer Colors for Lattice Graphs
TLDR
The idea is to construct the recursive coupling from a system of recurrences rather than from a single recurrence, which gives an analysis with a horizon of more than one level of induction, which leads to improved results.
Distributed selfish load balancing
TLDR
A natural protocol for the agents is discussed which can be implemented in a strongly distributed setting, uses no central control, and has good convergence properties and a lower bound of Ω (max{log log m, n}) for the convergence time is given.
A proportionate fair scheduling rule with good worst-case performance
TLDR
This paper considers a variant of the Surplus Fair Scheduling algorithm, which retains the properties that make SFS empirically attractive but allows the first proof of proportionate fairness in a multiprocessor context, and shows that no job lags more than p H(n)-p+1 steps below its target number of services.
Markov chain comparison
This is an expository paper, focussing on the following scenario. We have two Markov chains, M and M'. By some means, we have obtained a bound on the mixing time of M'. We wish to compare M with M'
Computational Complexity of Weighted Threshold Games
TLDR
This work studies the core, the least core, and the nucleolus, distinguishing those problems that are polynomial-time computable from those that are NP-hard, and providing pseudopolynomial and approximation algorithms for the NP- hard problems.
Adaptive Drift Analysis
We show that, for any c>0, the (1+1) evolutionary algorithm using an arbitrary mutation rate pn=c/n finds the optimum of a linear objective function over bit strings of length n in expected time
A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications
TLDR
Read‐once MC‐nets is presented, a new class ofMC‐nets that is provably more compact than basic MC‐ nets, while retaining the attractive computational properties of basic MC­nets.
...
...