‘algorithm’ directory
- See Also
- Gwern
- Links
- “Mold: A Massively Parallel Linker”, Ueyama 2026
- “SlopCodeBench: Benchmarking How Coding Agents Degrade Over Long-Horizon Iterative Tasks”, Orlanski et al 2026
- “Flash-KMeans: Fast and Memory-Efficient Exact K-Means”, Yang et al 2026
- “The Biggest Trackmania Pathfinding Competition”, Wirtual 2026
- “How AI Helps Break the Cost Barrier to COBOL Modernization”, Anthropic 2026
- “[Unique-8 That Xor to 216 − 1]”, Pro 2026
- “How Michael Abrash Doubled Quake’s Frame-Rate”, Sanglard 2026
- “Building a C Compiler With a Team of Parallel Claudes: We Tasked Claude-4.6-Opus Using Agent Teams to Build a C Compiler [In Rust], and Then (Mostly) Walked Away. Here’s What It Taught Us about the Future of Autonomous Software Development”, Carlini 2026
- “Differentiable Logic Synthesis: Spectral Coefficient Selection via Sinkhorn-Constrained Composition”, Pavlov 2026
- “Gogipav14/spectral-Llm: Differentiable Logic Synthesis: Spectral Coefficient Selection via Sinkhorn-Constrained Composition”, Pavlov 2026
- “Full Unicode Search at 50× ICU Speed With AVX-512”, Vardanian 2025
- “I Am Sorry, but Everyone Is Getting Syntax Highlighting Wrong: If Everything Is Highlighted, Nothing Is Highlighted”, Prokopov 2025
- “Tensor Logic: The Language of AI”, Domingos 2025
- “Tensor Logic Homepage”, Domingos 2025
- “Optimizing a MOS 6502 CPU Apple Image Decoder, from 70 Minutes to 1 Minute”, Leroy-Mira 2025
- “Extending the ‘XOR Trick’ to Billions of Rows: an Introduction to Invertible Bloom Filters [For Set Differences]”, Nochlin 2025
- “Papers With Computer-Checked Proofs”, Bernstein 2025
- “XXt Can Be Faster”, Rybin et al 2025
- “The Fastest Way Yet to Color Graphs”, Nadis 2025
- “What If ODF [OpenOffice] Used SQLite?”, Hipp 2025
- “Breaking the Sorting Barrier for Directed Single-Source Shortest Paths”, Duan et al 2025
- “After 20 Years, the Globally Optimal Boggle Board”
- “The Impossible Calculator: Google Android’s Calculator Is (Probably) the Most Widely Used Calculator in the World. It’s Also the Most Advanced”, Popovitch 2025
- “Graph Neural Networks Extrapolate Out-Of-Distribution for Shortest Paths”, Nerem et al 2025
- “
llama2.c64: Inference Llama-2 on a Commodore 64”, Witkowiak 2025 - “
korea81998: Provably Shortest-Possible Walking Tour to 81,998 Bars in South Korea [178 Days, 1 Hour, 56 Minutes, 17 Seconds Walk]”, Cook et al 2025 - “The Prospero Challenge: Render the Image As Quickly As Possible”, Keeter 2025
- “All about XOR”, Tatham 2025
- “Developer Philosophy”, Hughes 2025
- “Ramanujan Property and Edge Universality of Random Regular Graphs”, Huang et al 2024
- “Learning Solver Design: Automating Factorio Balancers”, Venturini 2024
- “Generalized Dijkstra in Haskell”, flupe 2024
- “Float Self-Tagging”, Melançon et al 2024
- “Breaking Bad: How Compilers Break Constant-Time”, Schneider et al 2024
- “Vizing’s Theorem in Near-Linear Time”, Assadi et al 2024
- “It’s Not Easy Being Green: On the Energy Efficiency of Programming Languages”, Kempen et al 2024
- “Glue and Coprocessor Architectures”, Buterin 2024
- “The Widening Gap: The Benefits and Harms of Generative AI for Novice Programmers”, Prather et al 2024
- “Amit’s A✱ Pages”, Patel 2024
- “Writing Commit Messages”, Tatham 2024
- “Polyamorous Scheduling”, Gąsieniec et al 2024
- “Troubleshooting: The Skill That Never Goes Obsolete”, Curiositry 2024
- “Beyond A✱: Better Planning With Transformers via Search Dynamics Bootstrapping (Searchformer)”, Lehnert et al 2024
- “Hamiltonicity of Expanders: Optimal Bounds and Applications”, Draganić et al 2024
- “Databases in 2024: A Year in Review”
- “Efficient Parallelization of an Ubiquitous Sequential Computation”, Heinsen 2023
- “Towards Automatic Design of Factorio Blueprints”, Patterson et al 2023
- “How Does Naming Affect LLMs on Code Analysis Tasks?”, Wang et al 2023
- “U-Net CNN in APL: Exploring Zero-Framework, Zero-Library Machine Learning”, Hsu & Serrão 2023
- “The Silent (R)evolution of SAT: Today’s Powerful, Robust SAT Solvers Have Become Primary Tools for Solving Hard Computational Problems”, Fichte et al 2023
- “Blockwise Parallel Transformer for Long Context Large Models”, Liu & Abbeel 2023
- “You And Your Research”, Hamming 2023
- “Distinct Elements in Streams: An Algorithm for the (Text) Book”, Chakraborty et al 2023
- “How to Optimize a CUDA Matmul Kernel for CuBLAS-Like Performance: a Worklog”, Boehm 2022
- “Monolith: Real Time Recommendation System With Collisionless Embedding Table”, Liu et al 2022
- “A Library for Representing Python Programs As Graphs for Machine Learning”, Bieber et al 2022
- “TextWorldExpress: Simulating Text Games at One Million Steps Per Second”, Jansen & Côté 2022
- “Learning With Combinatorial Optimization Layers: a Probabilistic Approach”, Dalle et al 2022
- “Overwatch: Learning Patterns in Code Edit Sequences”, Zhang et al 2022
- “Heisenbugs: The Most Elusive Kind of Bug, and How to Capture Them With Perfect Replayability—Eliminate Heisenbugs and Endless Debugging Sessions!”, Ovadia 2022
- “Progress in Mathematical Programming Solvers 2001–2020”, Koch et al 2022
- “Searching for Cyclic TV Reference Paradoxes”, Pinheiro 2022
- “Fast Text Placement Scheme for ASCII Art Synthesis”, Chung & Kwon 2022
- “Monarch: Expressive Structured Matrices for Efficient and Accurate Training”, Dao et al 2022
- “Maximum Flow and Minimum-Cost Flow in Almost-Linear Time”, Chen et al 2022
- “Clock: 解説”
- “Bamboo Trimming Revisited: Simple Algorithms Can Do Well Too”, Kuszmaul 2022
- “What Goes into Making an OS to Be Unix Compliant Certified?”, Lambert 2022
- “Silent Bugs in Deep Learning Frameworks: An Empirical Study of Keras and TensorFlow”, Tambon et al 2021
- “Improving Real-Time Rendering of Dynamic Digital Characters in Cycles”, Dietrich 2021
- “Real Time Cluster Path Tracing”, Xie et al 2021
- “Small-Amp: Test Amplification in a Dynamically Typed Language”, Abdi et al 2021
- “Introducing Triton: Open-Source GPU Programming for Neural Networks”, Tillet 2021
- “Learning a Large Neighborhood Search Algorithm for Mixed Integer Programs”, Sonnerat et al 2021
- “Hacker News Folk Wisdom on Visual Programming”, Keer 2021
- “Real-Time Neural Radiance Caching for Path Tracing”, Müller et al 2021
- “Randomness In Neural Network Training: Characterizing The Impact of Tooling”, Zhuang et al 2021
- “How Developers Choose Names”, Feitelson et al 2021
- “Pretrained Transformers As Universal Computation Engines”, Lu et al 2021
- “Entropy Trade-Offs in Artistic Design: A Case Study of Tamil kolam”, Tran et al 2021
- “Investment versus Reward in a Competitive Knapsack Problem”, Neumann & Gros 2021
- “MLGO: a Machine Learning Guided Compiler Optimizations Framework”, Trofin et al 2021
- “NNUE: The Neural Network of the Stockfish Chess Engine”, Goucher 2021
- “You Could Have Invented Fenwick Trees”
- “Solving Any Sudoku Puzzle [In Python 3]”, Norvig 2021
- “I Know What You Bought At Chipotle for $9.81 by Solving A Linear Inverse Problem”, Fleder & Shah 2020
- “Presyn: Modeling Black-Box Components With Probabilistic Synthesis”, Collie et al 2020
- “Why Johnny Won’t Upgrade”, Mattheij 2020
- “Optimal Peanut Butter and Banana Sandwiches”, Rosenthal 2020
- “A Time Leap Challenge for SAT Solving”, Fichte et al 2020
- “Measuring Hardware Overhang”, Hippke 2020
- “A Bayesian Approach to the Simulation Argument”, Kipping 2020
- “Algorithms With Predictions”, Mitzenmacher & Vassilvitskii 2020
- “Towards an API for the Real Numbers”, Boehm 2020
- “BanditPAM: Almost Linear Time k-Medoids Clustering via Multi-Armed Bandits”, Tiwari et al 2020
- “Funnel-Transformer: Filtering out Sequential Redundancy for Efficient Language Processing”, Dai et al 2020
- “Lessons Learned from Bugs in Models of Human History”, Ragsdale et al 2020
- “Measuring the Algorithmic Efficiency of Neural Networks”, Hernandez & Brown 2020
- “Tech Notes: The Success and Failure of Ninja”
- “Bringing GNU Emacs to Native Code”, Corallo et al 2020
- “Learning-Based Memory Allocation for C++ Server Workloads”, Maas et al 2020
- “Reinforcement Learning for Combinatorial Optimization: A Survey”, Mazyavkina et al 2020
- “The History of the URL”, Bloom 2020
- “Quantifying Independently Reproducible Machine Learning”, Raff 2020
- “Solving Billion-Scale Knapsack Problems”, Zhang et al 2020
- “Taxonomy of Real Faults in Deep Learning Systems”, Humbatova et al 2019
- “They Might Never Tell You It’s Broken”, Chevalier-Boisvert 2019
- “Co-Dfns: A Data Parallel Compiler Hosted on the GPU”, Hsu 2019c
- “Hyrum’s Law: An Observation on Software Engineering”, Wright 2019
- “Grandmaster Level in StarCraft II Using Multi-Agent Reinforcement Learning”, Vinyals et al 2019
- “Local-First Software: You Own Your Data, in spite of the Cloud [Paper]”, Kleppmann et al 2019
- “Gated Linear Networks”, Veness et al 2019
- “A Step Toward Quantifying Independently Reproducible Machine Learning Research”, Raff 2019
- “Different Languages, Similar Encoding Efficiency: Comparable Information Rates across the Human Communicative Niche”, Coupé et al 2019
- “A View on Deep Reinforcement Learning in System Optimization”, Haj-Ali et al 2019
- “Moral Permissibility of Action Plans”, Lindner et al 2019
- “ParPaRaw: Massively Parallel Parsing of Delimiter-Separated Raw Data”, Stehle & Jacobsen 2019
- “Real-World Dynamic Programming: Seam Carving”, Das 2019
- “Local-First Software: You Own Your Data, in spite of the Cloud [Web]”, Kleppmann et al 2019
- “GAP: Generalizable Approximate Graph Partitioning Framework”, Nazi et al 2019
- “Parsing Gigabytes of JSON per Second”, Langdale & Lemire 2019
- “AutoPhase: Compiler Phase-Ordering for High Level Synthesis With Deep Reinforcement Learning”, Haj-Ali et al 2019
- “Reinventing the Wheel: Discovering the Optimal Rolling Shape With PyTorch”, Wiener 2019
- “Algorithms [kufi Cover]”, Erickson 2019
- “Meta-Learning Neural Bloom Filters”, Rae 2019
- “SageDB: A Learned Database System”, Kraska 2019
- “Test Driving ‘Power of Two Random Choices’ Load Balancing”, Tarreau 2019
- “Slow Software”, McGranaghan 2018
- “Learning to Perform Local Rewriting for Combinatorial Optimization”, Chen & Tian 2018
- “How to Shuffle a Big Dataset”, Hardin 2018
- “Deterministic Implementations for Reproducibility in Deep Reinforcement Learning”, Nagarajan et al 2018
- “Learning to Optimize Join Queries With Deep Reinforcement Learning”, Krishnan et al 2018
- “Always Measure One Level Deeper: Performance Measurements Often Go Wrong, Reporting Surface-Level Results That Are More Marketing Than Science”, Ousterhout 2018
- “Learning to Optimize Tensor Programs”, Chen et al 2018
- “Optimizing Query Evaluations Using Reinforcement Learning for Web Search”, Rosset et al 2018
- “Learning Memory Access Patterns”, Hashemi et al 2018
- “Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions”, Vasilache et al 2018
- “Innovation and Cumulative Culture through Tweaks and Leaps in Online Programming Contests”, Miu et al 2018
- “Collapsing Towers of Interpreters”, Amin & Rompf 2017
- “The Case for Learned Index Structures”, Kraska et al 2017
- “Naming Things Is Hard”
- “Automatic Differentiation in PyTorch”, Paszke et al 2017
- “From Punched Cards to Flat Screens: A Technical Autobiography”, Hazel 2017
- “DAG Reduction: Fast Answering Reachability Queries”, Zhou et al 2017
- “Stochastic Constraint Programming As Reinforcement Learning”, Prestwich et al 2017
- “Learning to Superoptimize Programs”, Bunel et al 2017
- “Web Bloat”, Luu 2017
- “Exact Instructions Challenge—This Is Why My Kids Hate Me [PB&J Sandwich Programming Challenge]”, Darnit 2017
- “Resource-Efficient Machine Learning in 2 KB RAM for the Internet of Things”, Kumar et al 2017
- “Machine Learning for Systems and Systems for Machine Learning”, Dean 2017
- “Collapsing-Towers [Codebase for Amin & Rompf 2017]”, Amin & Rompf 2017
- “From NAND To Tetris: Building a Modern Computer from First Principles”, Nisan & Schocken 2017
- “P≟NP § AI”, Aaronson 2017 (page 5)
- “Neural Combinatorial Optimization With Reinforcement Learning”, Bello et al 2016
- “The Doodle Theorem, and Beyond: Colin Wright Juggles Euler, Doodling and Millennium Problems”, Wright 2016
- “Coz: Finding Parallel Code That Counts With Causal Profiling”, Curtsinger & Berger 2016
- “Stop Designing Languages. Write Libraries Instead”, Li 2016
- “A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents”, Aziz & Mackenzie 2016
- “Why WhatsApp Only Needs 50 Engineers for Its 900M Users: One of the (Many) Intriguing Parts of the WhatsApp Story Is That It Has Achieved Such Enormous Scale With Such a Tiny Team”, Metz 2015
- “Scalability! But at What COST?”, McSherry et al 2015
- “Inferring Algorithmic Patterns With Stack-Augmented Recurrent Nets”, Joulin & Mikolov 2015
- The Ph.D. Grind: A Ph.D. Student Memoir, Guo 2015
- “Tales of the Tail: Hardware, OS, and Application-Level Sources of Tail Latency”, Li et al 2014c
- “The Misfortunes of a Trio of Mathematicians Using Computer Algebra Systems—Can We Trust in Them?”, Durán et al 2014
- “Always Bet on Text”, graydon2 2014
- “Simple Testing Can Prevent Most Critical Failures: An Analysis of Production Failures in Distributed Data-Intensive Systems”, Yuan et al 2014
- “The Mystery Machine: End-To-End Performance Analysis of Large-Scale Internet Services”, Chow et al 2014 (page 2)
- “Literate Programming: Knuth Is Doing It Wrong”, Agaram 2014
- “Core-Guided MaxSAT With Soft Cardinality Constraints”, Morgado et al 2014
- “40 Years of Formal Methods: Some Obstacles and Some Possibilities?”, Bjørner & Havelund 2014
- “Algorithmic Progress in Six Domains”, Grace 2013
- “You Could Have Invented Parser Combinators”
- “Intelligence Explosion Microeconomics”, Yudkowsky 2013
- “Homotopy Groups of Suspended Classifying Spaces: An Experimental Approach”, Romero & Rubio 2013
- “Bounded Kolmogorov Complexity Based on Cognitive Models”, Strannegård et al 2013
- “Really Automatic Scalable Object-Oriented Reengineering”, Trudel et al 2013
- “How to Speed up a Python Program 114,000×”, Schachter 2012
- “Planning As Satisfiability: Heuristics”, Rintanen 2012
- “The Algebraic Combinatorial Approach for Low-Rank Matrix Completion”, Király et al 2012
- “Evaluating the Design of the R Language: Objects and Functions for Data Analysis”, Morandat et al 2012
- “The International SAT Solver Competitions”, Järvisalo et al 2012
- “You Could Have Invented Fractional Cascading”, ezyang 2012
- “Uniform Random Generation of Large Acyclic Digraphs”, Kuipers & Moffa 2012
- “National Cryptologic Museum Opens New Exhibit on Dr. John Nash”, NSA 2012
- “How Trello Is Different”, Spolsky 2012
- “A Brief History of NP-Completeness, 1954–2012”, Johnson 2012
- “Cutting the Pipe: Achieving Sub-Second Iteration Times”, 5.1.1 2012
- “STEPS Toward Expressive Programming Systems: "A Science Experiment"”, Ohshima et al 2012 (page 2)
- “Why Philosophers Should Care About Computational Complexity”, Aaronson 2011
- “Zen Puzzle Garden Is NP-Complete”, Houston et al 2011
- “Minimal Boolean Formulas”, Cox 2011
- “You’re Doing It Wrong: Think You’ve Mastered the Art of Server Performance? Think Again.”, Kamp 2010
- “You Could Have Invented Zippers”, ezyang 2010
- “Formal Theory of Creativity & Fun & Intrinsic Motivation (1990–2010)”, Schmidhuber 2010
- “Retrospective: An Axiomatic Basis For Computer Programming; C. A. R. Hoare Revisits His past Communications Article on the Axiomatic Approach to Programming and Uses It As a Touchstone for the Future”, Hoare 2009
- “Coolex: The Coolest Way to Generate Combinations”, Ruskey & Williams 2009
- “The Hidden Mathematics of Bathrooms”, Lugo 2009
- “De-Anonymizing Social Networks”, Narayanan & Shmatikov 2009
- “The Gödel Letter”, Gödel 2009
- “Producing Wrong Data Without Doing Anything Obviously Wrong!”, Mytkowicz et al 2009
- “The Tactical Amulet Extraction Bot: Predicting and Controlling NetHack’s Randomness”
- “Is There A Fourth Futamura Projection?”, Robert 2009
- “Dual-Pivot Quicksort Algorithm”, Yaroslavskiy 2009
- “Driven by Compression Progress: A Simple Principle Explains Essential Aspects of Subjective Beauty, Novelty, Surprise, Interestingness, Attention, Curiosity, Creativity, Art, Science, Music, Jokes”, Schmidhuber 2008
- “Aggregating Inconsistent Information: Ranking and Clustering”, Ailon et al 2008
- “Rendering Synthetic Objects into Real Scenes: Bridging Traditional and Image-Based Graphics With Global Illumination and High Dynamic Range Photography”, Debevec 2008
- “Bigtable: A Distributed Storage System for Structured Data”, Chang et al 2008
- “Interview With Donald Knuth”, Binstock 2008
- “Optimal Boarding Method for Airline Passengers”, Steffen 2008
- “Harnessing Vision for Computation”, Changizi 2008
- “Dijkstra: Quick and Dirty”, Beane 2007
- “Time-Reversal in Conway’s Life As SAT”, Bain 2007
- “An Example of Statistical Investigation of the Text Eugene Onegin Concerning the Connection of Samples in Chains”, Markov 2006
- “Communication in Economic Mechanisms”, Segal 2006b
- “How To Break Anonymity of the Netflix Prize Dataset”, Narayanan & Shmatikov 2006
- “Global Multiple Objective Line Breaking”, Holkner 2006
- “Oral History of Butler Lampson § WWW”, Lampson & Kay 2006 (page 36)
- “You Could Have Invented Monads! (And Maybe You Already Have.)”, sigfpe 2006
- “We Are Sorry to Inform You...”, Santini 2005
- “History of Combinatorial Generation (The Art of Computer Programming: Volume 4: Pre-Fascicle 4B: §7.2.1.7) § Pg22”, Knuth 2005 (page 22)
- “Modeling Bursts and Heavy Tails in Human Dynamics”, Vazquez et al 2005
- “Group Theory in the Bedroom: An Insomniac’s Guide to the Curious Mathematics of Mattress Flipping”, Hayes 2005
- “NP-Complete Problems and Physical Reality”, Aaronson 2005
- “Lower-Stretch Spanning Trees”, Elkin et al 2004
- “A Short History of Computational Complexity”, Fortnow et al 2003
- “Least Effort and the Origins of Scaling in Human Language”, Cancho & Sole 2003
- “Extended Comment on Language Trees and Zipping”, Goodman 2002
- “Solving Real-World Linear Programs: A Decade and More of Progress”, Bixby 2002
- “A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances”, Hyyrö 2002
- “Naked Objects: a Technique for Designing More Expressive Systems”, Pawson & Matthews 2001
- “On Proebsting’s Law”, Scott 2001
- “Peopleware: Why Measure Performance”, DeMarco & Lister 2001
- “The Effects of Moore’s Law and Slacking on Large Computations”, Gottbrath et al 1999
- “Bridging the Algorithm Gap: A Linear-Time Functional Program for Paragraph Formatting”, Moor & Gibbons 1999
- “Growing a Language [Grow-Speech]”, Steele 1998
- “Feynman’s War: Modeling Weapons, Modeling Nature”, Galison 1998
- “The Concave Least-Weight Subsequence Problem Revisited”, Wilber 1998
- “Algorithm 781: Generating Hilbert’s Space-Filling Curve by Recursion”, Breinholt & Schierz 1998
- “Applications of Randomness in System Performance Measurement”, Blackwell 1998
- “The PageRank Citation Ranking: Bringing Order to the Web”, Page et al 1998
- “Proebsting’s Law: Compiler Advances Double Computing Power Every 18 Years”, Proebsting 1998
- “The T-Experiments: Errors in Scientific Software”, Hatton 1997
- “Duplication and Partial Evaluation: For a Better Understanding of Reflective Languages”, Asai et al 1996
- “George Prices’s Contributions to Evolutionary Genetics”, Frank 1995
- “The Nature of Selection”, Price 1995
- “Digital Filters, Part II”, Hamming 1995
- “A Plea for Lean Software”, Wirth 1995
- “Building a Large Annotated Corpus of English: The Penn Treebank”, Marcus et al 1993
- “Partition Testing Does Not Inspire Confidence”, Hamlet & Taylor 1990
- “On the Computational Complexity of the Jones and Tutte Polynomials”, Jaeger et al 1990
- “A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming”, Galil & Park 1990
- “Planning and Learning in Permutation Groups”, Mose et al 1989
- “Separating Strings With Small Automata”, Robson 1989
- “Optimal Nonlinear Approximation”, DeVore et al 1989
- “Hypertext and the Oxford English Dictionary”, Raymond & Tompa 1988
- Three Scientists and Their Gods: Looking for Meaning in an Age of Information, Wright 1988
- “Incentive Engineering: for Computational Resource Management”, Drexler & Miller 1988
- “The Least Weight Subsequence Problem”, Hirschberg & Larmore 1987
- “Geometric Applications of a Matrix Searching Algorithm”, Aggarwal et al 1986
- “The Back of the Envelope Returns”, Bentley 1986
- “Average Case Complete Problems”, Levin 1986
- “Probabilistic Counting Algorithms for Data Base Applications”, Flajolet & Martin 1985
- “Programming As Theory Building”, Naur 1985
- “The Back of the Envelope”, Bentley 1984
- “The Competitive Allocation Process Is Informationally Efficient Uniquely”, Jordan 1982
- “Epigrams on Programming”, Perlis 1982
- “Procedural Reflection in Programming Languages”, Smith 1982
- “On Holy Wars and a Plea for Peace”, Cohen 1981
- “Mutation Analysis Of Program Test Data”, Budd 1980
- “A Correct Preprocessing Algorithm for Boyer-Moore String-Searching”, Rytter 1980
- “Algorithms for Loop Matchings”, Nussinov et al 1978
- “Fast Pattern Matching in Strings”, Knuth et al 1977
- “Structured Programming With
go ToStatements”, Knuth 1974 - Interstellar Communication: Scientific Perspectives, Ponnamperuma & Cameron 1974
- “A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations”, Kogge & Stone 1973
- “Universal Sequential Search Problems”, Levin 1973
- “The Dangers of Computer-Science Theory”, Knuth 1973
- “Choosing a Point from the Surface of a Sphere”, Marsaglia 1972
- “The Humble Programmer [EWD340]”, Dijkstra 1972
- “The Pattern of Streets”, Alexander 1966
- “A New Version of the Euclidean Algorithm”, Blankinship 1963
- “A Simple Randomization Procedure”, Sandelius 1962
- “Generation of Random Permutations of Given Number of Elements Using Random Sampling Numbers”, Rao 1961
- “Addressing for Random-Access Storage”, Peterson 1957
- “Fixing the Internet for Real Time Applications: Part I”
- “Fixing the Internet for Real Time Applications: Part II”
- “The Codeless Code: Case 96: ‘Stateless’”
- “Programmed Differently? Testing for Gender Differences in Python Programming Style and Quality on GitHub”
- “Accidentally Quadratic”
- “Summing ASCII Encoded Integers on Haswell at Almost the Speed of
memcpy” - “We Need Visual Programming. No, Not like That.”
- “Visualizing Algorithms”
- “The Final Cut [Ford-Fulkerson’s Max-Flow Min-Cut As Planning Paradigm]”
- “Bug #1815423 ‘X86_64 TCG: Incorrect Floating Point Cast to Int.’”
- “Personality Value”
- “We Ported the Original Doom to SQL”
- “The Untold Story of SQLite With Richard Hipp”
- “XDL 2.0 Standard”
- “Why Don’t Schools Teach Debugging?”, Luu 2026
- “Measurement, Benchmarking, and Data Analysis Are Underrated”
- “Dynamicland”, Victor 2026
- “Integer Programming Easily Encloses Horse”, Dynomight 2026
- “‘Bad Apple!!’ but It’s 6,500 Regexes That I Search for in Vim”
- “Programmed Differently? Testing for Gender Differences in Python Programming Style and Quality on GitHub”
- “Gigatoken: Language Model Tokenization at GB⧸s”, marcelroed 2026
- “Libdivide: Optimized Integer Division”, ridiculousfish 2026
- “Differentiable Finite State Machines”
- “Getting the World Record in HATETRIS”
- “LISP With GC in 436 Bytes”
- “Ladybird Adopts Rust, With Help from AI [GPT-5 & Claude-4]”
- “Optimization Lessons from a Minecraft Structure Locator”
- “Heuristics on the High Seas: Mathematical Optimization for Cargo Ships”
- “Programming’s Dirtiest Little Secret”, Yegg 2026
- “Sparse VideoGen—Version Selection”
- “Submission #6347: Chef Stef’s NES Arkanoid
warplessin 11:11.18” - “Fixing the Internet for Real-Time Applications: Part III”
- “Differentiable Programming from Scratch”
- “Technical Dimensions of Programming Systems”
- “How Much of a Genius-Level Move Was Using Binary Space Partitioning in Doom?”
- “VisuAlgo: Visualizing Data Structures and Algorithms through Animation”
- “An Open Letter to Netflix from the Authors of the De-Anonymization Paper”
- “Computer Error Haikus”, WikiWikiWeb 2026
- “A Faster Way to Calculate the Day-Of-The-Week”, Joffe 2026
- “Scaling Our Spreadsheet Engine from Thousands to Billions of Cells”
- “The Art and Mathematics of Genji-Kō”
- “[A Magic: The Gathering Combo That Deals Infinite Damage If the Twin Prime Conjecture Is True]”
- “Great Software Design Looks Underwhelming”, Goedecke 2026
- “TSP Art”
- erowidrecruiter
- “‘It’s Done in Hardware so It’s Cheap’”
- Sort By Magic
- Wikipedia (29)
- Miscellaneous
- Bibliography
See Also
Gwern
“Samon: Zen Sand Garden Puzzles”, Gwern et al 2026
“Cleanup When: Before or After?”, Gwern 2022
“The Scaling Hypothesis”, Gwern 2020
“Computer Optimization: Your Computer Is Faster Than You Think”, Gwern 2021
Computer Optimization: Your Computer Is Faster Than You Think
Links
“Mold: A Massively Parallel Linker”, Ueyama 2026
“SlopCodeBench: Benchmarking How Coding Agents Degrade Over Long-Horizon Iterative Tasks”, Orlanski et al 2026
SlopCodeBench: Benchmarking How Coding Agents Degrade Over Long-Horizon Iterative Tasks
“Flash-KMeans: Fast and Memory-Efficient Exact K-Means”, Yang et al 2026
“The Biggest Trackmania Pathfinding Competition”, Wirtual 2026
“How AI Helps Break the Cost Barrier to COBOL Modernization”, Anthropic 2026
“[Unique-8 That Xor to 216 − 1]”, Pro 2026
“How Michael Abrash Doubled Quake’s Frame-Rate”, Sanglard 2026
“Building a C Compiler With a Team of Parallel Claudes: We Tasked Claude-4.6-Opus Using Agent Teams to Build a C Compiler [In Rust], and Then (Mostly) Walked Away. Here’s What It Taught Us about the Future of Autonomous Software Development”, Carlini 2026
“Differentiable Logic Synthesis: Spectral Coefficient Selection via Sinkhorn-Constrained Composition”, Pavlov 2026
Differentiable Logic Synthesis: Spectral Coefficient Selection via Sinkhorn-Constrained Composition
“Gogipav14/spectral-Llm: Differentiable Logic Synthesis: Spectral Coefficient Selection via Sinkhorn-Constrained Composition”, Pavlov 2026
“Full Unicode Search at 50× ICU Speed With AVX-512”, Vardanian 2025
“I Am Sorry, but Everyone Is Getting Syntax Highlighting Wrong: If Everything Is Highlighted, Nothing Is Highlighted”, Prokopov 2025
“Tensor Logic: The Language of AI”, Domingos 2025
“Tensor Logic Homepage”, Domingos 2025
“Optimizing a MOS 6502 CPU Apple Image Decoder, from 70 Minutes to 1 Minute”, Leroy-Mira 2025
Optimizing a MOS 6502 CPU Apple image decoder, from 70 minutes to 1 minute
“Extending the ‘XOR Trick’ to Billions of Rows: an Introduction to Invertible Bloom Filters [For Set Differences]”, Nochlin 2025
“Papers With Computer-Checked Proofs”, Bernstein 2025
“XXt Can Be Faster”, Rybin et al 2025
“The Fastest Way Yet to Color Graphs”, Nadis 2025
“What If ODF [OpenOffice] Used SQLite?”, Hipp 2025
“Breaking the Sorting Barrier for Directed Single-Source Shortest Paths”, Duan et al 2025
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
“After 20 Years, the Globally Optimal Boggle Board”
“The Impossible Calculator: Google Android’s Calculator Is (Probably) the Most Widely Used Calculator in the World. It’s Also the Most Advanced”, Popovitch 2025
“Graph Neural Networks Extrapolate Out-Of-Distribution for Shortest Paths”, Nerem et al 2025
Graph neural networks extrapolate out-of-distribution for shortest paths
“llama2.c64: Inference Llama-2 on a Commodore 64”, Witkowiak 2025
“korea81998: Provably Shortest-Possible Walking Tour to 81,998 Bars in South Korea [178 Days, 1 Hour, 56 Minutes, 17 Seconds Walk]”, Cook et al 2025
“The Prospero Challenge: Render the Image As Quickly As Possible”, Keeter 2025
The Prospero Challenge: render the image as quickly as possible
“All about XOR”, Tatham 2025
“Developer Philosophy”, Hughes 2025
“Ramanujan Property and Edge Universality of Random Regular Graphs”, Huang et al 2024
Ramanujan Property and Edge Universality of Random Regular Graphs
“Learning Solver Design: Automating Factorio Balancers”, Venturini 2024
“Generalized Dijkstra in Haskell”, flupe 2024
“Float Self-Tagging”, Melançon et al 2024
“Breaking Bad: How Compilers Break Constant-Time”, Schneider et al 2024
“Vizing’s Theorem in Near-Linear Time”, Assadi et al 2024
“It’s Not Easy Being Green: On the Energy Efficiency of Programming Languages”, Kempen et al 2024
It’s Not Easy Being Green: On the Energy Efficiency of Programming Languages
“Glue and Coprocessor Architectures”, Buterin 2024
“The Widening Gap: The Benefits and Harms of Generative AI for Novice Programmers”, Prather et al 2024
The Widening Gap: The Benefits and Harms of Generative AI for Novice Programmers
“Amit’s A✱ Pages”, Patel 2024
“Writing Commit Messages”, Tatham 2024
“Polyamorous Scheduling”, Gąsieniec et al 2024
“Troubleshooting: The Skill That Never Goes Obsolete”, Curiositry 2024
“Beyond A✱: Better Planning With Transformers via Search Dynamics Bootstrapping (Searchformer)”, Lehnert et al 2024
Beyond A✱: Better Planning with Transformers via Search Dynamics Bootstrapping (Searchformer)
“Hamiltonicity of Expanders: Optimal Bounds and Applications”, Draganić et al 2024
“Databases in 2024: A Year in Review”
“Efficient Parallelization of an Ubiquitous Sequential Computation”, Heinsen 2023
Efficient Parallelization of an Ubiquitous Sequential Computation
“Towards Automatic Design of Factorio Blueprints”, Patterson et al 2023
“How Does Naming Affect LLMs on Code Analysis Tasks?”, Wang et al 2023
“U-Net CNN in APL: Exploring Zero-Framework, Zero-Library Machine Learning”, Hsu & Serrão 2023
U-Net CNN in APL: Exploring Zero-Framework, Zero-Library Machine Learning
“The Silent (R)evolution of SAT: Today’s Powerful, Robust SAT Solvers Have Become Primary Tools for Solving Hard Computational Problems”, Fichte et al 2023
“Blockwise Parallel Transformer for Long Context Large Models”, Liu & Abbeel 2023
Blockwise Parallel Transformer for Long Context Large Models
“You And Your Research”, Hamming 2023
“Distinct Elements in Streams: An Algorithm for the (Text) Book”, Chakraborty et al 2023
Distinct Elements in Streams: An Algorithm for the (Text) Book
“How to Optimize a CUDA Matmul Kernel for CuBLAS-Like Performance: a Worklog”, Boehm 2022
How to Optimize a CUDA Matmul Kernel for cuBLAS-like Performance: a Worklog
“Monolith: Real Time Recommendation System With Collisionless Embedding Table”, Liu et al 2022
Monolith: Real Time Recommendation System With Collisionless Embedding Table
“A Library for Representing Python Programs As Graphs for Machine Learning”, Bieber et al 2022
A Library for Representing Python Programs as Graphs for Machine Learning
“TextWorldExpress: Simulating Text Games at One Million Steps Per Second”, Jansen & Côté 2022
TextWorldExpress: Simulating Text Games at One Million Steps Per Second
“Learning With Combinatorial Optimization Layers: a Probabilistic Approach”, Dalle et al 2022
Learning with Combinatorial Optimization Layers: a Probabilistic Approach
“Overwatch: Learning Patterns in Code Edit Sequences”, Zhang et al 2022
“Heisenbugs: The Most Elusive Kind of Bug, and How to Capture Them With Perfect Replayability—Eliminate Heisenbugs and Endless Debugging Sessions!”, Ovadia 2022
View External Link:
“Progress in Mathematical Programming Solvers 2001–2020”, Koch et al 2022
“Searching for Cyclic TV Reference Paradoxes”, Pinheiro 2022
“Fast Text Placement Scheme for ASCII Art Synthesis”, Chung & Kwon 2022
“Monarch: Expressive Structured Matrices for Efficient and Accurate Training”, Dao et al 2022
Monarch: Expressive Structured Matrices for Efficient and Accurate Training
“Maximum Flow and Minimum-Cost Flow in Almost-Linear Time”, Chen et al 2022
“Clock: 解説”
“Bamboo Trimming Revisited: Simple Algorithms Can Do Well Too”, Kuszmaul 2022
Bamboo Trimming Revisited: Simple Algorithms Can Do Well Too
“What Goes into Making an OS to Be Unix Compliant Certified?”, Lambert 2022
“Silent Bugs in Deep Learning Frameworks: An Empirical Study of Keras and TensorFlow”, Tambon et al 2021
Silent Bugs in Deep Learning Frameworks: An Empirical Study of Keras and TensorFlow
“Improving Real-Time Rendering of Dynamic Digital Characters in Cycles”, Dietrich 2021
Improving Real-time Rendering of Dynamic Digital Characters in Cycles
“Real Time Cluster Path Tracing”, Xie et al 2021
“Small-Amp: Test Amplification in a Dynamically Typed Language”, Abdi et al 2021
Small-Amp: Test Amplification in a Dynamically Typed Language
“Introducing Triton: Open-Source GPU Programming for Neural Networks”, Tillet 2021
Introducing Triton: Open-source GPU programming for neural networks
“Learning a Large Neighborhood Search Algorithm for Mixed Integer Programs”, Sonnerat et al 2021
Learning a Large Neighborhood Search Algorithm for Mixed Integer Programs
“Hacker News Folk Wisdom on Visual Programming”, Keer 2021
“Real-Time Neural Radiance Caching for Path Tracing”, Müller et al 2021
“Randomness In Neural Network Training: Characterizing The Impact of Tooling”, Zhuang et al 2021
Randomness In Neural Network Training: Characterizing The Impact of Tooling
“How Developers Choose Names”, Feitelson et al 2021
“Pretrained Transformers As Universal Computation Engines”, Lu et al 2021
“Entropy Trade-Offs in Artistic Design: A Case Study of Tamil kolam”, Tran et al 2021
Entropy trade-offs in artistic design: A case study of Tamil kolam
“Investment versus Reward in a Competitive Knapsack Problem”, Neumann & Gros 2021
“MLGO: a Machine Learning Guided Compiler Optimizations Framework”, Trofin et al 2021
MLGO: a Machine Learning Guided Compiler Optimizations Framework
“NNUE: The Neural Network of the Stockfish Chess Engine”, Goucher 2021
“You Could Have Invented Fenwick Trees”
“Solving Any Sudoku Puzzle [In Python 3]”, Norvig 2021
“I Know What You Bought At Chipotle for $9.81 by Solving A Linear Inverse Problem”, Fleder & Shah 2020
I Know What You Bought At Chipotle for $9.81 by Solving A Linear Inverse Problem
“Presyn: Modeling Black-Box Components With Probabilistic Synthesis”, Collie et al 2020
Presyn: Modeling Black-Box Components with Probabilistic Synthesis
“Why Johnny Won’t Upgrade”, Mattheij 2020
“Optimal Peanut Butter and Banana Sandwiches”, Rosenthal 2020
“A Time Leap Challenge for SAT Solving”, Fichte et al 2020
“Measuring Hardware Overhang”, Hippke 2020
“A Bayesian Approach to the Simulation Argument”, Kipping 2020
“Algorithms With Predictions”, Mitzenmacher & Vassilvitskii 2020
“Towards an API for the Real Numbers”, Boehm 2020
“BanditPAM: Almost Linear Time k-Medoids Clustering via Multi-Armed Bandits”, Tiwari et al 2020
BanditPAM: Almost Linear Time k-Medoids Clustering via Multi-Armed Bandits
“Funnel-Transformer: Filtering out Sequential Redundancy for Efficient Language Processing”, Dai et al 2020
Funnel-Transformer: Filtering out Sequential Redundancy for Efficient Language Processing
“Lessons Learned from Bugs in Models of Human History”, Ragsdale et al 2020
“Measuring the Algorithmic Efficiency of Neural Networks”, Hernandez & Brown 2020
“Tech Notes: The Success and Failure of Ninja”
“Bringing GNU Emacs to Native Code”, Corallo et al 2020
“Learning-Based Memory Allocation for C++ Server Workloads”, Maas et al 2020
“Reinforcement Learning for Combinatorial Optimization: A Survey”, Mazyavkina et al 2020
Reinforcement Learning for Combinatorial Optimization: A Survey
“The History of the URL”, Bloom 2020
“Quantifying Independently Reproducible Machine Learning”, Raff 2020
“Solving Billion-Scale Knapsack Problems”, Zhang et al 2020
“Taxonomy of Real Faults in Deep Learning Systems”, Humbatova et al 2019
“They Might Never Tell You It’s Broken”, Chevalier-Boisvert 2019
“Co-Dfns: A Data Parallel Compiler Hosted on the GPU”, Hsu 2019c
“Hyrum’s Law: An Observation on Software Engineering”, Wright 2019
“Grandmaster Level in StarCraft II Using Multi-Agent Reinforcement Learning”, Vinyals et al 2019
Grandmaster level in StarCraft II using multi-agent reinforcement learning
“Local-First Software: You Own Your Data, in spite of the Cloud [Paper]”, Kleppmann et al 2019
Local-First Software: You Own Your Data, in spite of the Cloud [paper]
“Gated Linear Networks”, Veness et al 2019
“A Step Toward Quantifying Independently Reproducible Machine Learning Research”, Raff 2019
A Step Toward Quantifying Independently Reproducible Machine Learning Research
“Different Languages, Similar Encoding Efficiency: Comparable Information Rates across the Human Communicative Niche”, Coupé et al 2019
“A View on Deep Reinforcement Learning in System Optimization”, Haj-Ali et al 2019
A View on Deep Reinforcement Learning in System Optimization
“Moral Permissibility of Action Plans”, Lindner et al 2019
“ParPaRaw: Massively Parallel Parsing of Delimiter-Separated Raw Data”, Stehle & Jacobsen 2019
ParPaRaw: Massively Parallel Parsing of Delimiter-Separated Raw Data
“Real-World Dynamic Programming: Seam Carving”, Das 2019
“Local-First Software: You Own Your Data, in spite of the Cloud [Web]”, Kleppmann et al 2019
Local-first software: You own your data, in spite of the cloud [web]
“GAP: Generalizable Approximate Graph Partitioning Framework”, Nazi et al 2019
“Parsing Gigabytes of JSON per Second”, Langdale & Lemire 2019
“AutoPhase: Compiler Phase-Ordering for High Level Synthesis With Deep Reinforcement Learning”, Haj-Ali et al 2019
AutoPhase: Compiler Phase-Ordering for High Level Synthesis with Deep Reinforcement Learning
“Reinventing the Wheel: Discovering the Optimal Rolling Shape With PyTorch”, Wiener 2019
Reinventing the Wheel: Discovering the Optimal Rolling Shape with PyTorch
“Algorithms [kufi Cover]”, Erickson 2019
“Meta-Learning Neural Bloom Filters”, Rae 2019
“SageDB: A Learned Database System”, Kraska 2019
“Test Driving ‘Power of Two Random Choices’ Load Balancing”, Tarreau 2019
“Slow Software”, McGranaghan 2018
“Learning to Perform Local Rewriting for Combinatorial Optimization”, Chen & Tian 2018
Learning to Perform Local Rewriting for Combinatorial Optimization
“How to Shuffle a Big Dataset”, Hardin 2018
“Deterministic Implementations for Reproducibility in Deep Reinforcement Learning”, Nagarajan et al 2018
Deterministic Implementations for Reproducibility in Deep Reinforcement Learning
“Learning to Optimize Join Queries With Deep Reinforcement Learning”, Krishnan et al 2018
Learning to Optimize Join Queries With Deep Reinforcement Learning
“Always Measure One Level Deeper: Performance Measurements Often Go Wrong, Reporting Surface-Level Results That Are More Marketing Than Science”, Ousterhout 2018
View External Link:
https://cacm.acm.org/research/always-measure-one-level-deeper/
“Learning to Optimize Tensor Programs”, Chen et al 2018
“Optimizing Query Evaluations Using Reinforcement Learning for Web Search”, Rosset et al 2018
Optimizing Query Evaluations using Reinforcement Learning for Web Search
“Learning Memory Access Patterns”, Hashemi et al 2018
“Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions”, Vasilache et al 2018
Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions
“Innovation and Cumulative Culture through Tweaks and Leaps in Online Programming Contests”, Miu et al 2018
Innovation and cumulative culture through tweaks and leaps in online programming contests
“Collapsing Towers of Interpreters”, Amin & Rompf 2017
“The Case for Learned Index Structures”, Kraska et al 2017
“Naming Things Is Hard”
“Automatic Differentiation in PyTorch”, Paszke et al 2017
“From Punched Cards to Flat Screens: A Technical Autobiography”, Hazel 2017
From Punched Cards to Flat Screens: A Technical Autobiography
“DAG Reduction: Fast Answering Reachability Queries”, Zhou et al 2017
“Stochastic Constraint Programming As Reinforcement Learning”, Prestwich et al 2017
“Learning to Superoptimize Programs”, Bunel et al 2017
“Web Bloat”, Luu 2017
“Exact Instructions Challenge—This Is Why My Kids Hate Me [PB&J Sandwich Programming Challenge]”, Darnit 2017
Exact Instructions Challenge—This is why my kids hate me [PB&J sandwich programming challenge]
“Resource-Efficient Machine Learning in 2 KB RAM for the Internet of Things”, Kumar et al 2017
Resource-Efficient Machine Learning in 2 KB RAM for the Internet of Things
“Machine Learning for Systems and Systems for Machine Learning”, Dean 2017
Machine Learning for Systems and Systems for Machine Learning
“Collapsing-Towers [Codebase for Amin & Rompf 2017]”, Amin & Rompf 2017
“From NAND To Tetris: Building a Modern Computer from First Principles”, Nisan & Schocken 2017
From NAND To Tetris: Building a Modern Computer from First Principles
“P≟NP § AI”, Aaronson 2017 (page 5)
“Neural Combinatorial Optimization With Reinforcement Learning”, Bello et al 2016
Neural Combinatorial Optimization with Reinforcement Learning
“The Doodle Theorem, and Beyond: Colin Wright Juggles Euler, Doodling and Millennium Problems”, Wright 2016
The doodle theorem, and beyond: Colin Wright juggles Euler, doodling and Millennium problems
“Coz: Finding Parallel Code That Counts With Causal Profiling”, Curtsinger & Berger 2016
Coz: Finding Parallel Code that Counts with Causal Profiling
“Stop Designing Languages. Write Libraries Instead”, Li 2016
“A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents”, Aziz & Mackenzie 2016
A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents
“Why WhatsApp Only Needs 50 Engineers for Its 900M Users: One of the (Many) Intriguing Parts of the WhatsApp Story Is That It Has Achieved Such Enormous Scale With Such a Tiny Team”, Metz 2015
“Scalability! But at What COST?”, McSherry et al 2015
“Inferring Algorithmic Patterns With Stack-Augmented Recurrent Nets”, Joulin & Mikolov 2015
Inferring Algorithmic Patterns with Stack-Augmented Recurrent Nets
The Ph.D. Grind: A Ph.D. Student Memoir, Guo 2015
“Tales of the Tail: Hardware, OS, and Application-Level Sources of Tail Latency”, Li et al 2014c
Tales of the Tail: Hardware, OS, and Application-level Sources of Tail Latency
“The Misfortunes of a Trio of Mathematicians Using Computer Algebra Systems—Can We Trust in Them?”, Durán et al 2014
The Misfortunes of a Trio of Mathematicians Using Computer Algebra Systems—Can We Trust in Them?
“Always Bet on Text”, graydon2 2014
“Simple Testing Can Prevent Most Critical Failures: An Analysis of Production Failures in Distributed Data-Intensive Systems”, Yuan et al 2014
“The Mystery Machine: End-To-End Performance Analysis of Large-Scale Internet Services”, Chow et al 2014 (page 2)
The Mystery Machine: End-to-end performance analysis of large-scale Internet services
“Literate Programming: Knuth Is Doing It Wrong”, Agaram 2014
“Core-Guided MaxSAT With Soft Cardinality Constraints”, Morgado et al 2014
“40 Years of Formal Methods: Some Obstacles and Some Possibilities?”, Bjørner & Havelund 2014
40 Years of Formal Methods: Some Obstacles and Some Possibilities?
“Algorithmic Progress in Six Domains”, Grace 2013
“You Could Have Invented Parser Combinators”
“Intelligence Explosion Microeconomics”, Yudkowsky 2013
“Homotopy Groups of Suspended Classifying Spaces: An Experimental Approach”, Romero & Rubio 2013
Homotopy groups of suspended classifying spaces: An experimental approach
“Bounded Kolmogorov Complexity Based on Cognitive Models”, Strannegård et al 2013
“Really Automatic Scalable Object-Oriented Reengineering”, Trudel et al 2013
“How to Speed up a Python Program 114,000×”, Schachter 2012
“Planning As Satisfiability: Heuristics”, Rintanen 2012
“The Algebraic Combinatorial Approach for Low-Rank Matrix Completion”, Király et al 2012
The Algebraic Combinatorial Approach for Low-Rank Matrix Completion
“Evaluating the Design of the R Language: Objects and Functions for Data Analysis”, Morandat et al 2012
Evaluating the Design of the R Language: Objects and Functions for Data Analysis
“The International SAT Solver Competitions”, Järvisalo et al 2012
“You Could Have Invented Fractional Cascading”, ezyang 2012
“Uniform Random Generation of Large Acyclic Digraphs”, Kuipers & Moffa 2012
“National Cryptologic Museum Opens New Exhibit on Dr. John Nash”, NSA 2012
National Cryptologic Museum Opens New Exhibit on Dr. John Nash
“How Trello Is Different”, Spolsky 2012
“A Brief History of NP-Completeness, 1954–2012”, Johnson 2012
“Cutting the Pipe: Achieving Sub-Second Iteration Times”, 5.1.1 2012
“STEPS Toward Expressive Programming Systems: "A Science Experiment"”, Ohshima et al 2012 (page 2)
STEPS Toward Expressive Programming Systems: "A Science Experiment"
“Why Philosophers Should Care About Computational Complexity”, Aaronson 2011
“Zen Puzzle Garden Is NP-Complete”, Houston et al 2011
“Minimal Boolean Formulas”, Cox 2011
“You’re Doing It Wrong: Think You’ve Mastered the Art of Server Performance? Think Again.”, Kamp 2010
You’re Doing It Wrong: Think you’ve mastered the art of server performance? Think again.
“You Could Have Invented Zippers”, ezyang 2010
“Formal Theory of Creativity & Fun & Intrinsic Motivation (1990–2010)”, Schmidhuber 2010
Formal Theory of Creativity & Fun & Intrinsic Motivation (1990–2010)
“Retrospective: An Axiomatic Basis For Computer Programming; C. A. R. Hoare Revisits His past Communications Article on the Axiomatic Approach to Programming and Uses It As a Touchstone for the Future”, Hoare 2009
“Coolex: The Coolest Way to Generate Combinations”, Ruskey & Williams 2009
“The Hidden Mathematics of Bathrooms”, Lugo 2009
“De-Anonymizing Social Networks”, Narayanan & Shmatikov 2009
“The Gödel Letter”, Gödel 2009
“Producing Wrong Data Without Doing Anything Obviously Wrong!”, Mytkowicz et al 2009
Producing Wrong Data Without Doing Anything Obviously Wrong!
“The Tactical Amulet Extraction Bot: Predicting and Controlling NetHack’s Randomness”
The Tactical Amulet Extraction Bot: Predicting and controlling NetHack’s randomness
“Is There A Fourth Futamura Projection?”, Robert 2009
“Dual-Pivot Quicksort Algorithm”, Yaroslavskiy 2009
“Driven by Compression Progress: A Simple Principle Explains Essential Aspects of Subjective Beauty, Novelty, Surprise, Interestingness, Attention, Curiosity, Creativity, Art, Science, Music, Jokes”, Schmidhuber 2008
“Aggregating Inconsistent Information: Ranking and Clustering”, Ailon et al 2008
Aggregating inconsistent information: Ranking and clustering
“Rendering Synthetic Objects into Real Scenes: Bridging Traditional and Image-Based Graphics With Global Illumination and High Dynamic Range Photography”, Debevec 2008
“Bigtable: A Distributed Storage System for Structured Data”, Chang et al 2008
“Interview With Donald Knuth”, Binstock 2008
“Optimal Boarding Method for Airline Passengers”, Steffen 2008
“Harnessing Vision for Computation”, Changizi 2008
“Dijkstra: Quick and Dirty”, Beane 2007
“Time-Reversal in Conway’s Life As SAT”, Bain 2007
“An Example of Statistical Investigation of the Text Eugene Onegin Concerning the Connection of Samples in Chains”, Markov 2006
“Communication in Economic Mechanisms”, Segal 2006b
“How To Break Anonymity of the Netflix Prize Dataset”, Narayanan & Shmatikov 2006
“Global Multiple Objective Line Breaking”, Holkner 2006
“Oral History of Butler Lampson § WWW”, Lampson & Kay 2006 (page 36)
“You Could Have Invented Monads! (And Maybe You Already Have.)”, sigfpe 2006
You Could Have Invented Monads! (And Maybe You Already Have.)
“We Are Sorry to Inform You...”, Santini 2005
“History of Combinatorial Generation (The Art of Computer Programming: Volume 4: Pre-Fascicle 4B: §7.2.1.7) § Pg22”, Knuth 2005 (page 22)
“Modeling Bursts and Heavy Tails in Human Dynamics”, Vazquez et al 2005
“Group Theory in the Bedroom: An Insomniac’s Guide to the Curious Mathematics of Mattress Flipping”, Hayes 2005
Group Theory in the Bedroom: An insomniac’s guide to the curious mathematics of mattress flipping
“NP-Complete Problems and Physical Reality”, Aaronson 2005
“Lower-Stretch Spanning Trees”, Elkin et al 2004
“A Short History of Computational Complexity”, Fortnow et al 2003
“Least Effort and the Origins of Scaling in Human Language”, Cancho & Sole 2003
“Extended Comment on Language Trees and Zipping”, Goodman 2002
“Solving Real-World Linear Programs: A Decade and More of Progress”, Bixby 2002
Solving Real-World Linear Programs: A Decade and More of Progress
“A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances”, Hyyrö 2002
A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances
“Naked Objects: a Technique for Designing More Expressive Systems”, Pawson & Matthews 2001
Naked objects: a technique for designing more expressive systems
“On Proebsting’s Law”, Scott 2001
“Peopleware: Why Measure Performance”, DeMarco & Lister 2001
“The Effects of Moore’s Law and Slacking on Large Computations”, Gottbrath et al 1999
The Effects of Moore’s Law and Slacking on Large Computations
“Bridging the Algorithm Gap: A Linear-Time Functional Program for Paragraph Formatting”, Moor & Gibbons 1999
Bridging the algorithm gap: A linear-time functional program for paragraph formatting
“Growing a Language [Grow-Speech]”, Steele 1998
“Feynman’s War: Modeling Weapons, Modeling Nature”, Galison 1998
“The Concave Least-Weight Subsequence Problem Revisited”, Wilber 1998
“Algorithm 781: Generating Hilbert’s Space-Filling Curve by Recursion”, Breinholt & Schierz 1998
Algorithm 781: generating Hilbert’s space-filling curve by recursion
“Applications of Randomness in System Performance Measurement”, Blackwell 1998
Applications of Randomness in System Performance Measurement
“The PageRank Citation Ranking: Bringing Order to the Web”, Page et al 1998
“Proebsting’s Law: Compiler Advances Double Computing Power Every 18 Years”, Proebsting 1998
Proebsting’s Law: Compiler Advances Double Computing Power Every 18 Years
“The T-Experiments: Errors in Scientific Software”, Hatton 1997
“Duplication and Partial Evaluation: For a Better Understanding of Reflective Languages”, Asai et al 1996
Duplication and partial evaluation: For a better understanding of reflective languages
“George Prices’s Contributions to Evolutionary Genetics”, Frank 1995
“The Nature of Selection”, Price 1995
“Digital Filters, Part II”, Hamming 1995
“A Plea for Lean Software”, Wirth 1995
“Building a Large Annotated Corpus of English: The Penn Treebank”, Marcus et al 1993
Building a Large Annotated Corpus of English: The Penn Treebank
“Partition Testing Does Not Inspire Confidence”, Hamlet & Taylor 1990
“On the Computational Complexity of the Jones and Tutte Polynomials”, Jaeger et al 1990
On the computational complexity of the Jones and Tutte polynomials
“A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming”, Galil & Park 1990
A linear-time algorithm for concave one-dimensional dynamic programming
“Planning and Learning in Permutation Groups”, Mose et al 1989
“Separating Strings With Small Automata”, Robson 1989
“Optimal Nonlinear Approximation”, DeVore et al 1989
“Hypertext and the Oxford English Dictionary”, Raymond & Tompa 1988
Three Scientists and Their Gods: Looking for Meaning in an Age of Information, Wright 1988
Three Scientists and Their Gods: Looking for Meaning in an Age of Information
“Incentive Engineering: for Computational Resource Management”, Drexler & Miller 1988
Incentive Engineering: for Computational Resource Management
“The Least Weight Subsequence Problem”, Hirschberg & Larmore 1987
“Geometric Applications of a Matrix Searching Algorithm”, Aggarwal et al 1986
“The Back of the Envelope Returns”, Bentley 1986
“Average Case Complete Problems”, Levin 1986
“Probabilistic Counting Algorithms for Data Base Applications”, Flajolet & Martin 1985
Probabilistic counting algorithms for data base applications
“Programming As Theory Building”, Naur 1985
“The Back of the Envelope”, Bentley 1984
“The Competitive Allocation Process Is Informationally Efficient Uniquely”, Jordan 1982
The competitive allocation process is informationally efficient uniquely
“Epigrams on Programming”, Perlis 1982
“Procedural Reflection in Programming Languages”, Smith 1982
“On Holy Wars and a Plea for Peace”, Cohen 1981
“Mutation Analysis Of Program Test Data”, Budd 1980
“A Correct Preprocessing Algorithm for Boyer-Moore String-Searching”, Rytter 1980
A Correct Preprocessing Algorithm for Boyer-Moore String-Searching
“Algorithms for Loop Matchings”, Nussinov et al 1978
“Fast Pattern Matching in Strings”, Knuth et al 1977
“Structured Programming With go To Statements”, Knuth 1974
Interstellar Communication: Scientific Perspectives, Ponnamperuma & Cameron 1974
“A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations”, Kogge & Stone 1973
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
“Universal Sequential Search Problems”, Levin 1973
“The Dangers of Computer-Science Theory”, Knuth 1973
“Choosing a Point from the Surface of a Sphere”, Marsaglia 1972
“The Humble Programmer [EWD340]”, Dijkstra 1972
“The Pattern of Streets”, Alexander 1966
“A New Version of the Euclidean Algorithm”, Blankinship 1963
“A Simple Randomization Procedure”, Sandelius 1962
“Generation of Random Permutations of Given Number of Elements Using Random Sampling Numbers”, Rao 1961
Generation of Random Permutations of Given Number of Elements Using Random Sampling Numbers
“Addressing for Random-Access Storage”, Peterson 1957
“Fixing the Internet for Real Time Applications: Part I”
“Fixing the Internet for Real Time Applications: Part II”
“The Codeless Code: Case 96: ‘Stateless’”
“Programmed Differently? Testing for Gender Differences in Python Programming Style and Quality on GitHub”
“Accidentally Quadratic”
“Summing ASCII Encoded Integers on Haswell at Almost the Speed of memcpy”
Summing ASCII encoded integers on Haswell at almost the speed of memcpy
“We Need Visual Programming. No, Not like That.”
“Visualizing Algorithms”
“The Final Cut [Ford-Fulkerson’s Max-Flow Min-Cut As Planning Paradigm]”
The Final Cut [Ford-Fulkerson’s max-flow min-cut as planning paradigm]
“Bug #1815423 ‘X86_64 TCG: Incorrect Floating Point Cast to Int.’”
Bug #1815423 ‘x86_64 TCG: Incorrect floating point cast to int.’
“Personality Value”
“We Ported the Original Doom to SQL”
“The Untold Story of SQLite With Richard Hipp”
“XDL 2.0 Standard”
“Why Don’t Schools Teach Debugging?”, Luu 2026
Why don’t schools teach debugging?
View External Link:
“Measurement, Benchmarking, and Data Analysis Are Underrated”
Measurement, benchmarking, and data analysis are underrated
View External Link:
“Dynamicland”, Victor 2026
“Integer Programming Easily Encloses Horse”, Dynomight 2026
“‘Bad Apple!!’ but It’s 6,500 Regexes That I Search for in Vim”
‘Bad Apple!!’ but it’s 6,500 regexes that I search for in vim
“Programmed Differently? Testing for Gender Differences in Python Programming Style and Quality on GitHub”
“Gigatoken: Language Model Tokenization at GB⧸s”, marcelroed 2026
“Libdivide: Optimized Integer Division”, ridiculousfish 2026
“Differentiable Finite State Machines”
“Getting the World Record in HATETRIS”
“LISP With GC in 436 Bytes”
“Ladybird Adopts Rust, With Help from AI [GPT-5 & Claude-4]”
“Optimization Lessons from a Minecraft Structure Locator”
“Heuristics on the High Seas: Mathematical Optimization for Cargo Ships”
Heuristics on the high seas: Mathematical optimization for cargo ships
“Programming’s Dirtiest Little Secret”, Yegg 2026
“Sparse VideoGen—Version Selection”
“Submission #6347: Chef Stef’s NES Arkanoid warpless in 11:11.18”
Submission #6347: Chef Stef’s NES Arkanoid warpless in 11:11.18
“Fixing the Internet for Real-Time Applications: Part III”
“Differentiable Programming from Scratch”
“Technical Dimensions of Programming Systems”
“How Much of a Genius-Level Move Was Using Binary Space Partitioning in Doom?”
How Much of a Genius-Level Move Was Using Binary Space Partitioning in Doom?
“VisuAlgo: Visualizing Data Structures and Algorithms through Animation”
VisuAlgo: Visualizing data structures and algorithms through animation
“An Open Letter to Netflix from the Authors of the De-Anonymization Paper”
An open letter to Netflix from the authors of the de-anonymization paper
“Computer Error Haikus”, WikiWikiWeb 2026
“A Faster Way to Calculate the Day-Of-The-Week”, Joffe 2026
“Scaling Our Spreadsheet Engine from Thousands to Billions of Cells”
Scaling our Spreadsheet Engine from Thousands to Billions of Cells
“The Art and Mathematics of Genji-Kō”
“[A Magic: The Gathering Combo That Deals Infinite Damage If the Twin Prime Conjecture Is True]”
[A Magic: The Gathering combo that deals infinite damage if the Twin Prime Conjecture is true]
“Great Software Design Looks Underwhelming”, Goedecke 2026
“TSP Art”
erowidrecruiter
“‘It’s Done in Hardware so It’s Cheap’”
Sort By Magic
Annotations sorted by machine learning into inferred 'tags'. This provides an alternative way to browse: instead of by date order, one can browse in topic order. The 'sorted' list has been automatically clustered into multiple sections & auto-labeled for easier browsing.
Beginning with the newest annotation, it uses the embedding of each annotation to attempt to create a list of nearest-neighbor annotations, creating a progression of topics. For more details, see the link.
automatic-differentiation
reinforcement-learning
exhibit-analysis
evolutionary-genetics
partition-testing paradoxes confidence cyclic-tv
de-anonymization optimal-approximation data-ownership local-first software-analysis
algorithmic-research
citation-ranking
expressive-systems
Wikipedia (29)
Miscellaneous
/doc/cs/algorithm/2018-mcgranaghan-inkandswitch-slowsoftware-inputlatencycascade.png/doc/cs/algorithm/2018-miu-figure1-progressofbestperformingprogramovertimeofcontest.jpg/doc/cs/algorithm/2006-jared-wikimediaprovesgreenspunstenthlaw.htmlhttp://www.scholarpedia.org/article/Applications_of_algorithmic_information_theoryhttps://adamdrake.com/command-line-tools-can-be-235x-faster-than-your-hadoop-cluster.htmlhttps://ahrm.github.io/jekyll/update/2022/04/14/using-languge-models-to-read-faster.htmlhttps://andreasjhkarlsson.github.io/jekyll/update/2023/12/27/4-billion-if-statements.htmlhttps://andrewpwheeler.com/2022/07/01/using-linear-programming-to-assess-spatial-access/https://ashvardanian.com/posts/python-c-assembly-comparison/https://benkrause.github.io/blog/human-level-text-prediction/https://bertrandmeyer.com/2020/03/26/getting-program-right-nine-episodes/https://bxt.rs/blog/just-how-much-faster-are-the-gnome-46-terminals/https://cacm.acm.org/magazines/2023/6/273222-the-silent-revolution-of-sat/fulltexthttps://evoniuk.github.io/posts/pitfall.htmlView HTML:
https://fgiesen.wordpress.com/2012/04/08/metaprogramming-for-madmen/View External Link:
https://fgiesen.wordpress.com/2012/04/08/metaprogramming-for-madmen/https://github.com/mgarciaisaia/JavaScript-Is-Weird-as-a-compressorhttps://github.com/tigerbeetle/tigerbeetle/blob/main/docs/DESIGN.md#architecturehttps://github.com/tigerbeetledb/tigerbeetle/blob/main/doc/DESIGN.md#architecturehttps://hedgehogreview.com/issues/markets-and-the-good/articles/language-machineryhttps://jacobbrazeal.wordpress.com/2023/07/09/computationally-optimal-sequences-of-barbell-plates/https://james-iry.blogspot.com/2009/05/brief-incomplete-and-mostly-wrong.htmlhttps://johnnysswlab.com/decreasing-the-number-of-memory-accesses-the-compilers-secret-life-2-2/https://jvns.ca/blog/2023/10/06/new-talk--making-hard-things-easy/https://less.works/less/principles/queueing_theory#queueing-theoryhttps://mark.engineer/2023/11/speed-up-a-program-for-50-years-old-processor-by-180000/https://math.ucr.edu/home/baez/information/information_geometry_8.htmlhttps://norvig.com/spell-correct.htmlView HTML:
https://notes.billmill.org/blog/2024/03/mitzVah_-_the__worst__pangrams_part_2.htmlhttps://priceonomics.com/the-spectrum-auction-how-economists-saved-the-day/https://psyche.co/ideas/as-language-evolves-who-wins-out-speakers-or-listenershttps://queue.acm.org/detail.cfm?id=3570937View External Link:
https://research.google/blog/tensorstore-for-high-performance-scalable-array-storage/https://robertheaton.com/2018/12/17/wavefunction-collapse-algorithm/https://sqlite-users.sqlite.narkive.com/CVRvSKBs/50-faster-than-3-7-17https://trixter.oldskool.org/2015/04/07/8088-mph-we-break-all-your-emulators/View External Link:
https://trixter.oldskool.org/2015/04/07/8088-mph-we-break-all-your-emulators/https://use.expensify.com/blog/scaling-sqlite-to-4m-qps-on-a-single-serverhttps://web.archive.org/web/20191122044527/https://blog.paralleluniverse.co/2014/02/04/littles-law/https://weblog.jamisbuck.org/2011/2/7/maze-generation-algorithm-recap.htmlhttps://www-cs-faculty.stanford.edu/~knuth/papers/claude-cycles.pdfhttps://www.ageofinvention.xyz/p/age-of-invention-the-beacons-arehttps://www.ctrl-alt-test.fr/2024/how-we-made-an-animated-movie-in-8kb/https://www.eveonline.com/news/view/information-is-power-excel-releasehttps://www.honeycomb.io/blog/hard-stuff-nobody-talks-about-llmhttps://www.johndcook.com/blog/2017/02/08/how-efficient-is-morse-code/View External Link:
https://www.johndcook.com/blog/2017/02/08/how-efficient-is-morse-code/https://www.kalzumeus.com/2010/06/17/falsehoods-programmers-believe-about-names/https://www.lesswrong.com/posts/GveDmwzxiYHSWtZbv/shannon-s-surprising-discovery-1https://www.lesswrong.com/posts/aRxDLju75KXD6PCpB/wolf-incident-postmortemView External Link:
https://www.lesswrong.com/posts/aRxDLju75KXD6PCpB/wolf-incident-postmortemhttps://www.lesswrong.com/posts/no5jDTut5Byjqb4j5/six-and-a-half-intuitions-for-kl-divergencehttps://www.nuff.ox.ac.uk/users/klemperer/biggestpaper.pdf#page=2https://www.overcomingbias.com/p/office-by-combo-auctionhtmlhttps://www.quantamagazine.org/amateur-mathematicians-find-fifth-busy-beaver-turing-machine-20240702https://www.quantamagazine.org/computer-scientists-invent-an-efficient-new-way-to-count-20240516/https://www.quantamagazine.org/how-lossless-data-compression-works-20230531https://www.quantamagazine.org/how-mathematical-curves-power-cryptography-20220919/https://www.quantamagazine.org/in-highly-connected-networks-theres-always-a-loop-20240607/https://www.quantamagazine.org/physicists-observe-unobservable-quantum-phase-transition-20230911/https://www.quantamagazine.org/researchers-approach-new-speed-limit-for-seminal-problem-20240129/https://www.quantamagazine.org/scientists-find-optimal-balance-of-data-storage-and-time-20240208/https://xorshammer.com/2008/08/21/compute-definite-integral/https://yetanothermathprogrammingconsultant.blogspot.com/2018/11/chess-and-solution-pool.html
Bibliography
https://github.com/ytmytm/llama2.c64/tree/main#llama2c64: “llama2.c64: Inference Llama-2 on a Commodore 64”,https://arxiv.org/abs/2403.00465: “Polyamorous Scheduling”,https://dl.acm.org/doi/pdf/10.1145/3589246.3595371: “U-Net CNN in APL: Exploring Zero-Framework, Zero-Library Machine Learning”,1986-hamming: “You And Your Research”,https://levelup.gitconnected.com/searching-for-cyclic-tv-reference-paradoxes-d125ff014279: “Searching for Cyclic TV Reference Paradoxes”,https://arxiv.org/abs/2204.00595: “Monarch: Expressive Structured Matrices for Efficient and Accurate Training”,https://arxiv.org/abs/2112.13314: “Silent Bugs in Deep Learning Frameworks: An Empirical Study of Keras and TensorFlow”,https://code.blender.org/2021/12/improving-real-time-rendering-of-dynamic-digital-characters-in-cycles/: “Improving Real-Time Rendering of Dynamic Digital Characters in Cycles”,https://arxiv.org/abs/2106.12372#nvidia: “Real-Time Neural Radiance Caching for Path Tracing”,https://www.ethanrosenthal.com/2020/08/25/optimal-peanut-butter-and-banana-sandwiches/: “Optimal Peanut Butter and Banana Sandwiches”,2020-boehm.pdf: “Towards an API for the Real Numbers”,https://arxiv.org/abs/2006.06856: “BanditPAM: Almost Linear Time k-Medoids Clustering via Multi-Armed Bandits”,https://pointersgonewild.com/2019/11/02/they-might-never-tell-you-its-broken/: “They Might Never Tell You It’s Broken”,2019-hsu-3.pdf: “Co-Dfns: A Data Parallel Compiler Hosted on the GPU”,https://www.hyrumslaw.com/: “Hyrum’s Law: An Observation on Software Engineering”,2019-vinyals.pdf#deepmind: “Grandmaster Level in StarCraft II Using Multi-Agent Reinforcement Learning”,https://arxiv.org/abs/1608.03676: “Coz: Finding Parallel Code That Counts With Causal Profiling”,https://www.wired.com/2015/09/whatsapp-serves-900-million-users-50-engineers/: “Why WhatsApp Only Needs 50 Engineers for Its 900M Users: One of the (Many) Intriguing Parts of the WhatsApp Story Is That It Has Achieved Such Enormous Scale With Such a Tiny Team”,2014-yuan.pdf: “Simple Testing Can Prevent Most Critical Failures: An Analysis of Production Failures in Distributed Data-Intensive Systems”,2013-romero.pdf: “Homotopy Groups of Suspended Classifying Spaces: An Experimental Approach”,https://www.informit.com/articles/article.aspx?p=1193856: “Interview With Donald Knuth”,2006-holkner.pdf: “Global Multiple Objective Line Breaking”,https://archive.computerhistory.org/resources/text/Oral_History/Lampson_Butler/102658024.05.01.pdf#page=36: “Oral History of Butler Lampson § WWW”,https://arxiv.org/abs/physics/0510117: “Modeling Bursts and Heavy Tails in Human Dynamics”,2001-pawson.pdf: “Naked Objects: a Technique for Designing More Expressive Systems”,1998-page.pdf: “The PageRank Citation Ranking: Bringing Order to the Web”,1995-frank.pdf: “George Prices’s Contributions to Evolutionary Genetics”,1989-fiat.pdf: “Planning and Learning in Permutation Groups”,https://papers.agoric.com/papers/incentive-engineering-for-computational-resource-management/full-text/: “Incentive Engineering: for Computational Resource Management”,1985-naur.pdf: “Programming As Theory Building”,1980-budd.pdf: “Mutation Analysis Of Program Test Data”,1966-alexander.pdf: “The Pattern of Streets”,