◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Spielman

6 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 author4
  • middle author1
  • last author1

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

fields
  • cs.DS2
  • cs.CG1
  • math.CO1
  • math.OC1
  • quant-ph1

identity via Semantic Scholar / OpenAlex

activity
19982004
most citedExponential algorithmic speedup by quantum walk

836 citations · 912 across the 5 of their papers we have counts for

collaborators
Showing 1998Show all

1 paper · 1 filter

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.