◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Applegate

13 papers hereh-index 216.5k citations55 works total

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

author position
  • first author10
  • middle author1

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

fields
  • math.NT6
  • math.CO4
  • math.OC3
same name
  • D. Applegate — 33 papers, h 24
  • D. Applegate — 2 papers, h 5
  • D. Applegate — 1 paper, h 8
  • D. Applegate — 1 paper, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20012021
most citedFaster First-Order Primal-Dual Methods for Linear Programming using Restarts and Sharpness

40 citations · 73 across the 13 of their papers we have counts for

collaborators
Showing math.COShow all

4 papers · 1 filter

math.CO2017

Analysis of the gift exchange problem

Moa Apagodu, David Applegate, N. J. A. Sloane +1

In the gift exchange game there are n players and n wrapped gifts. When a player's number is called, that person can either choose one of the remaining wrapped gifts, or can "steal…

math.CO2010★ 6 cited

The Toothpick Sequence and Other Sequences from Cellular Automata

David Applegate, Omar E. Pol, N. J. A. Sloane

A two-dimensional arrangement of toothpicks is constructed by the following iterative procedure. At stage 1, place a single toothpick of length 1 on a square grid, aligned with the…

math.CO2009★ 4 cited

The Gift Exchange Problem

David Applegate, N. J. A. Sloane

The aim of this paper is to solve the "gift exchange" problem: you are one of n players, and there are n wrapped gifts on display; when your turn comes, you can either choose any o…

math.CO2002★ 2 cited

On Asymmetric Coverings and Covering Numbers

David Applegate, E. M. Rains, N. J. A. Sloane

An asymmetric covering D(n,R) is a collection of special subsets S of an n-set such that every subset T of the n-set is contained in at least one special S with |S| - |T| <= R. In…

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