◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Flaxman

3 papers hereh-index 7091.6k citations206 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2
  • middle author1

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • cs.LG1
  • math.PR1
  • physics.soc-ph1

identity via Semantic Scholar / OpenAlex

activity
20042009
most citedOnline convex optimization in the bandit setting: gradient descent without a gradient

12 citations · 14 across the 3 of their papers we have counts for

collaborators
Showing 2009 · math.PRShow all

1 paper · 2 filters

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…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.