◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

David Witmer

7 papers hereh-index 10491 citations18 works total

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

author position
  • middle author1
  • last author6

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

fields
  • cs.CC4
  • cs.DS2
  • cs.IT1

identity via Semantic Scholar / OpenAlex

activity
20122017
most citedSparsest Cut on Bounded Treewidth Graphs: Algorithms and Hardness Results

14 citations · 56 across the 7 of their papers we have counts for

collaborators
Showing 2015Show all

3 papers · 1 filter

cs.IT2015★ 9 cited

Remarks on the Most Informative Function Conjecture at fixed mean

Guy Kindler, Ryan O'Donnell, David Witmer

In 2013, Courtade and Kumar posed the following problem: Let x∼{±1}n be uniformly random, and form y∼{±1}n by negating each bit…

cs.CC2015★ 8 cited

How to refute a random CSP

Sarah R. Allen, Ryan O'Donnell, David Witmer

Let P be a k-ary predicate over a finite alphabet. Consider a random CSP(P) instance I over n variables with m constraints. When m≫n the instance I will be unsa…

cs.CC2015★ 8 cited

Beating the random assignment on constraint satisfaction problems of bounded degree

Boaz Barak, Ankur Moitra, Ryan O'Donnell +7

We show that for any odd k and any instance of the Max-kXOR constraint satisfaction problem, there is an efficient algorithm that finds an assignment satisfying at least a $\frac…

◍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.