◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Isaiah Lankham

2 papers hereh-index 553 citations21 works total

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

author position
  • last author2

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

fields
  • math.CO2

identity via Semantic Scholar / OpenAlex

most citedCombinatorics of patience sorting piles

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

collaborators

2 papers

math.CO2005

A Geometric Form for the Extended Patience Sorting Algorithm

Alexander Burstein, Isaiah Lankham

Patience Sorting is a combinatorial algorithm that can be viewed as an iterated, non-recursive form of the Schensted Insertion Algorithm. In recent work the authors extended Patien…

math.CO2005★ 13 cited

Combinatorics of patience sorting piles

Alexander Burstein, Isaiah Lankham

Despite having been introduced in 1962 by C.L. Mallows, the combinatorial algorithm Patience Sorting is only now beginning to receive significant attention due to such recent deep…

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