12 citations · 14 across the 3 of their papers we have counts for
3 papers
math.PR2009
On the diameter of the set of satisfying assignments in random satisfiable k-CNF formulas
Uriel Feige, Abraham D. Flaxman, Dan Vilenchik
It is known that random k-CNF formulas have a so-called satisfiability threshold at a density (namely, clause-variable ratio) of roughly 2^k\ln 2: at densities slightly below this…
physics.soc-ph2007★ 2 cited
Bias reduction in traceroute sampling: towards a more accurate map of the Internet
Abraham D. Flaxman, Juan Vera
Traceroute sampling is an important technique in exploring the internet router graph and the autonomous system graph. Although it is one of the primary techniques used in calculati…
cs.LG2004★ 12 cited
Online convex optimization in the bandit setting: gradient descent without a gradient
Abraham D. Flaxman, Adam Tauman Kalai, H. Brendan McMahan
We consider a the general online convex optimization framework introduced by Zinkevich. In this setting, there is a sequence of convex functions. Each period, we must choose a sign…