◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

DeVon Ingram

3 papers hereh-index 120 citations3 works total

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

author position
  • sole author1
  • first author1
  • middle author1

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

fields
  • cs.CC2
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20172025
most citedAn Upper Bound on the GKS Game via Max Bipartite Matching

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

collaborators

3 papers

math.CO2025

On the Range of the Permanent of (±1)-Matrices

DeVon Ingram, Alexander Razborov

We establish a superpolynomial lower bound on the range of the permanent function on the set of n×n matrices with ±1 entries.

cs.CC2021

The Acrobatics of BQP

Scott Aaronson, DeVon Ingram, William Kretschmer

One can fix the randomness used by a randomized algorithm, but there is no analogous notion of fixing the quantumness used by a quantum algorithm. Underscoring this fundamental dif…

cs.CC2017★ 1 cited

An Upper Bound on the GKS Game via Max Bipartite Matching

DeVon Ingram

The sensitivity conjecture is a longstanding conjecture concerning the relationship between the degree and sensitivity of a Boolean function. In 2015, a communication game was form…

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