◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Spielman

17 papers hereh-index 5317.2k citations194 works total

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

author position
  • first author6
  • middle author8
  • last author3

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

fields
  • cs.DS4
  • math.CO3
  • math.ST2
  • cs.AI1
  • cs.CC1
  • cs.CG1
same name
  • D. Spielman — 1 paper, h 13

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
19982026
most citedExponential algorithmic speedup by quantum walk

836 citations · 984 across the 16 of their papers we have counts for

collaborators
Showing 1998 · math.COShow all

1 paper · 2 filters

math.CO1998

An Infinite Antichain of Permutations

Miklós Bóna, Daniel A. Spielman

We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain.

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