“‘Sorting’ Tag”,2019-12-16 ():
Bibliography for tag
cs/algorithm/sorting, most recent first: 1 related tag, 27 annotations, & 20 links (parent).
- See Also
- Gwern
- Links
- “Classical Sorting Algorithms As a Model of Morphogenesis: Self-Sorting Arrays Reveal Unexpected Competencies in a Minimal Model of Basal Intelligence”, et al 2023
- “Learning Transformer Programs”, et al 2023
- “Tracr: Compiled Transformers As a Laboratory for Interpretability”, et al 2023
- “A Generalist Neural Algorithmic Learner”, et al 2022
- “Learning With Differentiable Algorithms”, 2022
- “Vectorized and Performance-Portable Quicksort”, et al 2022
- “Is This the Simplest (and Most Surprising) Sorting Algorithm Ever?”, 2021
- “RASP: Thinking Like Transformers”, et al 2021
- “Why Are Tar.xz Files 15× Smaller When Using Python’s Tar Library Compared to MacOS Tar?”, 2021
- “PiRank: Learning To Rank via Differentiable Sorting”, et al 2020
- “Engineering In-Place (Shared-Memory) Sorting Algorithms”, et al 2020
- “Sparse Sinkhorn Attention”, et al 2020
- “Fast Differentiable Sorting and Ranking”, et al 2020
- “Stochastic Optimization of Sorting Networks via Continuous Relaxations”, et al 2019
- “In-Place Parallel Super Scalar Samplesort (IPS4o)”, et al 2017
- “Programming With a Differentiable Forth Interpreter”, et al 2016
- “BlockQuicksort: How Branch Mispredictions Don’t Affect Quicksort”, Edelkamp & Weiß 2016
- “Adaptive Computation Time for Recurrent Neural Networks”, 2016
- “Pointer Networks”, et al 2015
- “Neural Turing Machines”, et al 2014
- “How Inefficient Can a Sort Algorithm Be?”, 2014
- “Sorting from Noisy Information”, 2009
- “SimHash: Hash-Based Similarity Detection”, 2007
- “Noisy Sorting Without Resampling”, 2007
- “Noisy Binary Search and Its Applications”, 2007
- “Proving 50-Year-Old Sorting Networks Optimal: Part 1”
- “Zero Tolerance for Bias”
- Sort By Magic
- Wikipedia
- Miscellaneous
- Bibliography