“‘Sorting’ Tag”,2019-12-16 (statistical comparison)⁠:

Bibliography for tag cs/algorithm/sorting, most recent first: 1 related tag, 27 annotations, & 20 links (parent).

• See Also
• Gwern
  • “Can You Unsort Lists for Diversity?”, Gwern2019
  • “The sort –key Trick”, Gwern2014
  • “Resorting Media Ratings”, Gwern2015
• Links
  • “Classical Sorting Algorithms As a Model of Morphogenesis: Self-Sorting Arrays Reveal Unexpected Competencies in a Minimal Model of Basal Intelligence”, Zhang et al 2023
  • “Learning Transformer Programs”, Friedman et al 2023
  • “Tracr: Compiled Transformers As a Laboratory for Interpretability”, Lindner et al 2023
  • “A Generalist Neural Algorithmic Learner”, Ibarz et al 2022
  • “Learning With Differentiable Algorithms”, Petersen2022
  • “Vectorized and Performance-Portable Quicksort”, Blacher et al 2022
  • “Is This the Simplest (and Most Surprising) Sorting Algorithm Ever?”, Fung2021
  • “RASP: Thinking Like Transformers”, Weiss et al 2021
  • “Why Are Tar.xz Files 15× Smaller When Using Python’s Tar Library Compared to MacOS Tar?”, Lindestøkke2021
  • “PiRank: Learning To Rank via Differentiable Sorting”, Swezey et al 2020
  • “Engineering In-Place (Shared-Memory) Sorting Algorithms”, Axtmann et al 2020
  • “Sparse Sinkhorn Attention”, Tay et al 2020
  • “Fast Differentiable Sorting and Ranking”, Blondel et al 2020
  • “Stochastic Optimization of Sorting Networks via Continuous Relaxations”, Grover et al 2019
  • “In-Place Parallel Super Scalar Samplesort (IPS⁴o)”, Axtmann et al 2017
  • “Programming With a Differentiable Forth Interpreter”, Bošnjak et al 2016
  • “BlockQuicksort: How Branch Mispredictions Don’t Affect Quicksort”, Edelkamp & Weiß 2016
  • “Adaptive Computation Time for Recurrent Neural Networks”, Graves2016
  • “Pointer Networks”, Vinyals et al 2015
  • “Neural Turing Machines”, Graves et al 2014
  • “How Inefficient Can a Sort Algorithm Be?”, Lerma2014
  • “Sorting from Noisy Information”, Braverman & Mossel2009
  • “SimHash: Hash-Based Similarity Detection”, Sadowski & Levin2007
  • “Noisy Sorting Without Resampling”, Braverman & Mossel2007
  • “Noisy Binary Search and Its Applications”, Karp & Kleinberg2007
  • “Proving 50-Year-Old Sorting Networks Optimal: Part 1”
  • “Zero Tolerance for Bias”
  • Sort By Magic
    • compression
    • transformer-lab interpretability
    • differentiable-sorting fast-sort adaptive-sort vectorized-sort neural-sort
    • hashing
  • Wikipedia
• Miscellaneous
• Bibliography