Everything about Patience sorting

🧭 Start here: a 6-step reading path

1. Read the overview: Patience sortingA 5-minute orientation
2. Skim a recent paper: Sorting and global uniqueness in two-good HARA economies with many patience typesInfluential work since 2022
3. Pick up a classic book: Overcoming Anxiety for DummiesThe most-reprinted book on the subject
4. Read the landmark paper: Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theoremCited 233 times
5. Go sideways: Pigeonhole sortA closely related topic
6. Go sideways: Longest increasing subsequenceA closely related topic

🏆 Landmark papers (most cited)

• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem

  David Aldous, Persi Diaconis · 1999 · Bulletin of the American Mathematical Society · 233 citations

• Enumerating longest increasing subsequences and patience sorting

  Sergei Bespamyatnikh, Michael Segal · 2000 · Information Processing Letters · 54 citations

• Affine Shuffles, Shuffles with Cuts, the Whitehouse Module, and Patience Sorting

  Jason Fulman · 2000 · Journal of Algebra · 19 citations

• Patience Sorting

  C. L. Mallows · 1963 · SIAM Review · 13 citations

• Patience Sorting

  C. L. Mallows · 1962 · SIAM Review · 9 citations

• The monoids of the patience sorting algorithm

  Alan J. Cain, António Malheiro, Fábio M. Silva · 2019 · International Journal of Algebra and Computation · 5 citations

• A Cost Optimal Parallel Algorithm for Patience Sorting

  TAKAAKI NAKASHIMA, AKIHIRO FUJIWARA · 2006 · Parallel Processing Letters · 5 citations

• A geometric form for the extended patience sorting algorithm

  Alexander Burstein, Isaiah Lankham · 2006 · Advances in Applied Mathematics · 1 citations

🆕 Influential since 2022

• Sorting and global uniqueness in two-good HARA economies with many patience types

  Andrea Loi, Stefano Matta · 2026 · Economic Theory Bulletin · 0 citations

📚 Books worth reading

• Overcoming Anxiety for DummiesCharles H. Elliott, Ph.D., Laura L. Smith Ph.D. · 2002
• Cartesian meditationsEdmund Husserl, Dorion Cairns · 1960
• Contes des féesCharles Perrault · 1862
• Winsor McCayWinsor McCay · 2003
• The Christians daily walk in holy security and peaceHenry Scudder · 1674
• The Conspirators HierarchyJohn Coleman · 1992
• Blue horsesMary Oliver · 2014
• A Catholic history of Alabama and the FloridasAustin Carroll · 1908

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Pigeonhole sort Pigeonhole sorting is a sorting algorithm that is suitable for sorting lists of elements where the number n of elements and the length N of the range of…
• Longest increasing subsequence In computer science, the longest increasing subsequence problem aims to find a subsequence of a given sequence in which the subsequence's elements are…
• Selection sort In computer science, selection sort is an in-place comparison sorting algorithm. It has a O(n2) time complexity, which makes it inefficient on large lists…
• Bogosort In computer science, bogosort (also known as permutation sort and stupid sort) is a sorting algorithm based on the generate and test paradigm. The function…
• K-way merge algorithm In computer science, k-way merge algorithms or multiway merges are a specific type of sequence merge algorithms that specialize in taking in k sorted lists…
• Merge sort Merge sort (also commonly spelled as mergesort or merge-sort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations…
• Shuffling Shuffling is a technique used to randomize a deck of playing cards, introducing an element of chance into card games. Various shuffling methods exist,…
• Longest common subsequence A longest common subsequence (LCS) is the longest subsequence common to all sequences in a set of sequences (often just two sequences). It differs from…