- See Also
-
Links
- “DIRAC: Neural Image Compression With a Diffusion-Based Decoder”, Et Al 2023
- “Monolith: Real Time Recommendation System With Collisionless Embedding Table”, Et Al 2022
- “A Library for Representing Python Programs As Graphs for Machine Learning”, Et Al 2022
- “TextWorldExpress: Simulating Text Games at One Million Steps Per Second”, Jansen & 2022
- “Learning With Combinatorial Optimization Layers: a Probabilistic Approach”, Et Al 2022
- “Overwatch: Learning Patterns in Code Edit Sequences”, Et Al 2022
- “Progress in Mathematical Programming 2001–2020”, Et Al 2022
- “DiffC: Lossy Compression With Gaussian Diffusion”, Et Al 2022
- “Searching for Cyclic TV Reference Paradoxes”, 2022
- “Fast Text Placement Scheme for ASCII Art Synthesis”, 2022
- “Monarch: Expressive Structured Matrices for Efficient and Accurate Training”, Et Al 2022
- “Maximum Flow and Minimum-Cost Flow in Almost-Linear Time”, Et Al 2022
- “What Goes into Making an OS to Be Unix Compliant Certified?”, 2022
- “Silent Bugs in Deep Learning Frameworks: An Empirical Study of Keras and TensorFlow”, Et Al 2021
- “Improving Real-time Rendering of Dynamic Digital Characters in Cycles”, 2021
- “Real Time Cluster Path Tracing”, Et Al 2021
- “Learning a Large Neighborhood Search Algorithm for Mixed Integer Programs”, Et Al 2021
- “Real-time Neural Radiance Caching for Path Tracing”, Et Al 2021
- “Randomness In Neural Network Training: Characterizing The Impact of Tooling”, Et Al 2021
- “How Developers Choose Names”, Et Al 2021
- “Pretrained Transformers As Universal Computation Engines”, Et Al 2021
- “Entropy Trade-offs in Artistic Design: A Case Study of Tamil Kolam”, Et Al 2021
- “Investment vs. Reward in a Competitive Knapsack Problem”, 2021
- “MLGO: a Machine Learning Guided Compiler Optimizations Framework”, Et Al 2021
- “NNUE: The Neural Network of the Stockfish Chess Engine”, 2021
- “I Know What You Bought At Chipotle for $9.81 by Solving A Linear Inverse Problem”, 2020
- “Presyn: Modeling Black-Box Components With Probabilistic Synthesis”, Et Al 2020
- “Why Johnny Won’t Upgrade”, 2020
- “Optimal Peanut Butter and Banana Sandwiches”, 2020
- “Measuring Hardware Overhang”, Hippke 2020
- “A Time Leap Challenge for SAT Solving”, Et Al 2020
- “A Bayesian Approach to the Simulation Argument”, 2020
- “Lessons Learned from Bugs in Models of Human History”, Et Al 2020
- “Funnel-Transformer: Filtering out Sequential Redundancy for Efficient Language Processing”, Et Al 2020
- “The Scaling Hypothesis”, 2020
- “Measuring the Algorithmic Efficiency of Neural Networks”, 2020
- “Computation in the Human Cerebral Cortex Uses Less Than 0.2 Watts yet This Great Expense Is Optimal When considering Communication Costs”, 2020
- “Bringing GNU Emacs to Native Code”, Et Al 2020
- “Learning-based Memory Allocation for C++ Server Workloads”, Et Al 2020
- “The History of the URL”, 2020
- “Zip Files: History, Explanation and Implementation”, 2020
- “Quantifying Independently Reproducible Machine Learning”, 2020
- “Taxonomy of Real Faults in Deep Learning Systems”, Et Al 2019
- “They Might Never Tell You It’s Broken”, Chevalier-2019
- “Hyrum’s Law: An Observation on Software Engineering”, 2019
- “Grandmaster Level in StarCraft II Using Multi-agent Reinforcement Learning”, Et Al 2019
- “Local-First Software: You Own Your Data, in spite of the Cloud [paper]”, Et Al 2019
- “Neural Networks Are a Priori Biased towards Boolean Functions With Low Entropy”, Et Al 2019
- “A Step Toward Quantifying Independently Reproducible Machine Learning Research”, 2019
- “A View on Deep Reinforcement Learning in System Optimization”, Haj-Et Al 2019
- “Moral Permissibility of Action Plans”, Et Al 2019
- “ParPaRaw: Massively Parallel Parsing of Delimiter-Separated Raw Data”, 2019
- “Real-world Dynamic Programming: Seam Carving”, 2019
- “Unraveling the JPEG: JPEG Images Are Everywhere in Our Digital Lives, but behind the Veil of Familiarity Lie Algorithms That Remove Details That Are Imperceptible to the Human Eye. This Produces the Highest Visual Quality With the Smallest File Size—but What Does That Look Like? Let’s See What Our Eyes Can’t See!”, 2019
- “Local-first Software: You Own Your Data, in spite of the Cloud [web]”, Et Al 2019
- “GAP: Generalizable Approximate Graph Partitioning Framework”, Et Al 2019
- “Parsing Gigabytes of JSON per Second”, 2019
- “AutoPhase: Compiler Phase-Ordering for High Level Synthesis With Deep Reinforcement Learning”, Haj-Et Al 2019
- “Test Driving ‘Power of Two Random Choices’ Load Balancing”, 2019
- “Meta-Learning Neural Bloom Filters”, Rae & Al 2019
- “Reinventing the Wheel: Discovering the Optimal Rolling Shape With PyTorch”, 2019
- “Slow Software”, 2018
- “Learning to Perform Local Rewriting for Combinatorial Optimization”, 2018
- “How to Shuffle a Big Dataset”, 2018
- “Deterministic Implementations for Reproducibility in Deep Reinforcement Learning”, Et Al 2018
- “Learning to Optimize Join Queries With Deep Reinforcement Learning”, Et Al 2018
- “Umineko: The Opium Of The Magics”, 2018
- “Learning to Optimize Tensor Programs”, Et Al 2018
- “Optimizing Query Evaluations Using Reinforcement Learning for Web Search”, Et Al 2018
- “Learning Memory Access Patterns”, Et Al 2018
- “Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions”, Et Al 2018
- “The Case for Learned Index Structures”, Et Al 2017
- “Automatic Differentiation in PyTorch”, Et Al 2017
- “From Punched Cards to Flat Screens: A Technical Autobiography”, 2017
- “DAG Reduction: Fast Answering Reachability Queries”, Et Al 2017
- “Stochastic Constraint Programming As Reinforcement Learning”, Et Al 2017
- “Learning to Superoptimize Programs”, Et Al 2017
- “Web Bloat”, 2017
- “P≟NP § AI”, 2017 (page 5)
- “Machine Learning for Systems and Systems for Machine Learning”, 2017
- “Full Resolution Image Compression With Recurrent Neural Networks”, Et Al 2016
- “Energy-Efficient Algorithms”, Et Al 2016
- “A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents”, 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”, 2015
- “Scalability! But at What COST?”, Et Al 2015
- “Inferring Algorithmic Patterns With Stack-Augmented Recurrent Nets”, Et Al 2015
- “The Ph.D. Grind: A Ph.D. Student Memoir”, 2015
- “The Mystery Machine: End-to-end Performance Analysis of Large-scale Internet Services”, Et Al 2014
- “How Inefficient Can a Sort Algorithm Be?”, 2014
- “Core-Guided MaxSAT With Soft Cardinality Constraints”, Et Al 2014
- “Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines”, Soler-Et Al 2014
- “Algorithmic Progress in Six Domains”, 2013
- “Intelligence Explosion Microeconomics”, 2013
- “Bounded Kolmogorov Complexity Based on Cognitive Models”, Et Al 2013
- “Evaluating the Design of the R Language: Objects and Functions for Data Analysis”, Et Al 2012
- “The International SAT Solver Competitions”, Et Al 2012
- “National Cryptologic Museum Opens New Exhibit on Dr. John Nash”, NSA 2012
- “A Brief History of NP-Completeness, 1954–2012”, 2012
- “STEPS Toward Expressive Programming Systems:”A Science Experiment”“, Et Al 2012 (page 2)
- “A Cross-Language Perspective On Speech Information Rate”, Et Al 2011
- “Why Philosophers Should Care About Computational Complexity”, 2011
- “Notes on a New Philosophy of Empirical Science”, 2011
- “New Strategy of Lossy Text Compression”, Al-2010
- “You’re Doing It Wrong: Think You’ve Mastered the Art of Server Performance? Think Again.”, 2010
- “Formal Theory of Creativity & Fun & Intrinsic Motivation (1990–2010)”, 2010
- “Coolex: The Coolest Way to Generate Combinations”, 2009
- “De-anonymizing Social Networks”, 2009
- “The Gödel Letter”, 2009
- “Producing Wrong Data Without Doing Anything Obviously Wrong!”, Et Al 2009
- “Is There A Fourth Futamura Projection?”, 2009
- “Dual-Pivot Quicksort Algorithm”, 2009
- “Driven by Compression Progress: A Simple Principle Explains Essential Aspects of Subjective Beauty, Novelty, Surprise, Interestingness, Attention, Curiosity, Creativity, Art, Science, Music, Jokes”, 2008
- “Aggregating Inconsistent Information: Ranking and Clustering”, Et Al 2008
- “Interview With Donald Knuth”, 2008
- “Optimal Boarding Method for Airline Passengers”, 2008
- “Harnessing Vision for Computation”, 2008
- “How To Break Anonymity of the Netflix Prize Dataset”, 2006
- “Oral History of Butler Lampson § WWW”, 2006 (page 36)
- “History of Combinatorial Generation (The Art of Computer Programming: Volume 4: Pre-Fascicle 4B: §7.2.1.7)”, 2005
- “NP-complete Problems and Physical Reality”, 2005
- “Lower-Stretch Spanning Trees”, Et Al 2004
- “A Short History of Computational Complexity”, Et Al 2003
- “Least Effort and the Origins of Scaling in Human Language”, 2003
- “Solving Real-World Linear Programs: A Decade and More of Progress”, 2002
- “A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances”, 2002
- “Estimating and Comparing Entropy across Written Natural Languages Using PPM Compression”, Et Al 2002
- “Naked Objects: a Technique for Designing More Expressive Systems”, 2001
- “On Proebsting’s Law”, 2001
- “Peopleware: Why Measure Performance”, 2001
- “The Effects of Moore’s Law and Slacking on Large Computations”, Et Al 1999
- “The Physical Limits of Communication”, Et Al 1999
- “Quantum Effects in Algorithms”, 1998
- “Applications of Randomness in System Performance Measurement”, 1998
- “Proebsting’s Law: Compiler Advances Double Computing Power Every 18 Years”, 1998
- “THE ENTROPY OF ENGLISH USING PPM-BASED MODELS—Data Compression Conference, 1996. DCC ’96. Proceedings”
- “Entropy of Natural Languages: Theory and Experiment”, 1994
- “Building a Large Annotated Corpus of English: The Penn Treebank”, Et Al 1993
- “Separating Strings With Small Automata”, 1989
- “Optimal Nonlinear Approximation”, Et Al 1989
- “Hypertext and the Oxford English Dictionary”, 1988
- “Average Case Complete Problems”, 1986
- “Probabilistic Counting Algorithms for Data Base Applications”, 1985
- “Randomness Conservation Inequalities; Information and Independence in Mathematical Theories”, 1984
- “Epigrams on Programming”, 1982
- “Procedural Reflection in Programming Languages”, 1982
- “On Holy Wars and a Plea for Peace”, 1981
- “Mutation Analysis Of Program Test Data”, 1980
- “A Correct Preprocessing Algorithm for Boyer-Moore String-Searching”, 1980
- “A Convergent Gambling Estimate Of The Entropy Of English”, 1978
- “Algorithms for Loop Matchings”, Et Al 1978
- “Fast Pattern Matching in Strings”, Et Al 1977
-
“Structured Programming With
go To
Statements”, 1974 - “A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations”, 1973
- “The Dangers of Computer-Science Theory”, 1973
- “Universal Sequential Search Problems”, 1973
- “The Humble Programmer [EWD340]”, 1972
- “A Simple Randomization Procedure”, 1962
- “Generation of Random Permutations of Given Number of Elements Using Random Sampling Numbers”, 1961
- “Possible Principles Underlying the Transformations of Sensory Messages”, 1961
- “Coding Theorems for a Discrete Source With a Fidelity Criterion”, 1959
- “The Codeless Code: Case 96:”Stateless” ”
- “Submission #6347: Chef Stef’s NES Arkanoid ‘Warpless’ In 11:11.18”
- “TSP Art”
- Wikipedia
- Miscellaneous
- Link Bibliography
See Also
Links
“DIRAC: Neural Image Compression With a Diffusion-Based Decoder”, Et Al 2023
“DIRAC: Neural Image Compression with a Diffusion-Based Decoder”, 2023-01-13 ( ; similar)
“Monolith: Real Time Recommendation System With Collisionless Embedding Table”, Et Al 2022
“Monolith: Real Time Recommendation System With Collisionless Embedding Table”, 2022-09-16 ( ; similar)
“A Library for Representing Python Programs As Graphs for Machine Learning”, Et Al 2022
“A Library for Representing Python Programs as Graphs for Machine Learning”, 2022-08-15 ( ; similar)
“TextWorldExpress: Simulating Text Games at One Million Steps Per Second”, Jansen & 2022
“TextWorldExpress: Simulating Text Games at One Million Steps Per Second”, 2022-08-01 ( ; backlinks; similar)
“Learning With Combinatorial Optimization Layers: a Probabilistic Approach”, Et Al 2022
“Learning with Combinatorial Optimization Layers: a Probabilistic Approach”, 2022-07-27 ( ; similar)
“Overwatch: Learning Patterns in Code Edit Sequences”, Et Al 2022
“Overwatch: Learning Patterns in Code Edit Sequences”, 2022-07-25 (similar)
“Progress in Mathematical Programming 2001–2020”, Et Al 2022
“Progress in Mathematical Programming Solvers 2001–2020”, 2022-06-20 ( ; similar)
“DiffC: Lossy Compression With Gaussian Diffusion”, Et Al 2022
“DiffC: Lossy Compression with Gaussian Diffusion”, 2022-06-17 ( ; similar)
“Searching for Cyclic TV Reference Paradoxes”, 2022
“Searching for Cyclic TV Reference Paradoxes”, 2022-06-05 ( ; similar; bibliography)
“Fast Text Placement Scheme for ASCII Art Synthesis”, 2022
“Fast Text Placement Scheme for ASCII Art Synthesis”, 2022-04-14 ( ; similar)
“Monarch: Expressive Structured Matrices for Efficient and Accurate Training”, Et Al 2022
“Monarch: Expressive Structured Matrices for Efficient and Accurate Training”, 2022-04-01 ( ; similar; bibliography)
“Maximum Flow and Minimum-Cost Flow in Almost-Linear Time”, Et Al 2022
“Maximum Flow and Minimum-Cost Flow in Almost-Linear Time”, 2022-03-01 (similar)
“What Goes into Making an OS to Be Unix Compliant Certified?”, 2022
“What goes into making an OS to be Unix compliant certified?”, 2022-01-14 (backlinks; similar)
“Silent Bugs in Deep Learning Frameworks: An Empirical Study of Keras and TensorFlow”, Et Al 2021
“Silent Bugs in Deep Learning Frameworks: An Empirical Study of Keras and TensorFlow”, 2021-12-26 ( ; similar; bibliography)
“Improving Real-time Rendering of Dynamic Digital Characters in Cycles”, 2021
“Improving Real-time Rendering of Dynamic Digital Characters in Cycles”, 2021-12-10 ( ; backlinks; similar; bibliography)
“Real Time Cluster Path Tracing”, Et Al 2021
“Real Time Cluster Path Tracing”, 2021-10-17 (similar)
“Learning a Large Neighborhood Search Algorithm for Mixed Integer Programs”, Et Al 2021
“Learning a Large Neighborhood Search Algorithm for Mixed Integer Programs”, 2021-07-21 ( ; similar)
“Real-time Neural Radiance Caching for Path Tracing”, Et Al 2021
“Real-time Neural Radiance Caching for Path Tracing”, 2021-06-23 ( ; similar; bibliography)
“Randomness In Neural Network Training: Characterizing The Impact of Tooling”, Et Al 2021
“Randomness In Neural Network Training: Characterizing The Impact of Tooling”, 2021-06-22 ( ; similar)
“How Developers Choose Names”, Et Al 2021
“How Developers Choose Names”, 2021-03-12 ( ; similar)
“Pretrained Transformers As Universal Computation Engines”, Et Al 2021
“Pretrained Transformers as Universal Computation Engines”, 2021-03-09 ( ; backlinks; similar)
“Entropy Trade-offs in Artistic Design: A Case Study of Tamil Kolam”, Et Al 2021
“Entropy trade-offs in artistic design: A case study of Tamil kolam”, 2021-03-01 ( ; similar)
“Investment vs. Reward in a Competitive Knapsack Problem”, 2021
“Investment vs. reward in a competitive knapsack problem”, 2021-01-26 ( ; similar)
“MLGO: a Machine Learning Guided Compiler Optimizations Framework”, Et Al 2021
“MLGO: a Machine Learning Guided Compiler Optimizations Framework”, 2021-01-13 ( ; similar)
“NNUE: The Neural Network of the Stockfish Chess Engine”, 2021
“NNUE: The neural network of the Stockfish chess engine”, 2021-01-08 ( ; similar)
“I Know What You Bought At Chipotle for $9.81 by Solving A Linear Inverse Problem”, 2020
“I Know What You Bought At Chipotle for $9.81 by Solving A Linear Inverse Problem”, 2020-12-01 (similar)
“Presyn: Modeling Black-Box Components With Probabilistic Synthesis”, Et Al 2020
“Presyn: Modeling Black-Box Components with Probabilistic Synthesis”, 2020-10-09 (backlinks; similar)
“Why Johnny Won’t Upgrade”, 2020
“Why Johnny Won’t Upgrade”, 2020-08-26 ( ; backlinks; similar)
“Optimal Peanut Butter and Banana Sandwiches”, 2020
“Optimal Peanut Butter and Banana Sandwiches”, 2020-08-25 ( ; similar; bibliography)
“Measuring Hardware Overhang”, Hippke 2020
“Measuring hardware overhang”, 2020-08-05 ( ; backlinks; similar)
“A Time Leap Challenge for SAT Solving”, Et Al 2020
“A Time Leap Challenge for SAT Solving”, 2020-08-05 ( ; backlinks)
“A Bayesian Approach to the Simulation Argument”, 2020
“A Bayesian Approach to the Simulation Argument”, 2020-08-03 ( ; backlinks; similar)
“Lessons Learned from Bugs in Models of Human History”, Et Al 2020
“Lessons learned from bugs in models of human history”, 2020-06-05 ( ; backlinks; similar)
“Funnel-Transformer: Filtering out Sequential Redundancy for Efficient Language Processing”, Et Al 2020
“Funnel-Transformer: Filtering out Sequential Redundancy for Efficient Language Processing”, 2020-06-05 ( ; backlinks; similar)
“The Scaling Hypothesis”, 2020
“The Scaling Hypothesis”, 2020-05-28 ( ; backlinks; similar; bibliography)
“Measuring the Algorithmic Efficiency of Neural Networks”, 2020
“Measuring the Algorithmic Efficiency of Neural Networks”, 2020-05-08 ( ; similar)
“Computation in the Human Cerebral Cortex Uses Less Than 0.2 Watts yet This Great Expense Is Optimal When considering Communication Costs”, 2020
“Computation in the human cerebral cortex uses less than 0.2 watts yet this great expense is optimal when considering communication costs”, 2020-04-25 ( ; similar)
“Bringing GNU Emacs to Native Code”, Et Al 2020
“Bringing GNU Emacs to Native Code”, 2020-04-06 ( ; similar)
“Learning-based Memory Allocation for C++ Server Workloads”, Et Al 2020
“Learning-based Memory Allocation for C++ Server Workloads”, 2020-03-16 ( ; similar)
“The History of the URL”, 2020
“The History of the URL”, 2020-03-05 ( ; similar)
“Zip Files: History, Explanation and Implementation”, 2020
“Zip Files: History, Explanation and Implementation”, 2020-02-26 (similar)
“Quantifying Independently Reproducible Machine Learning”, 2020
“Quantifying Independently Reproducible Machine Learning”, 2020-02-06 ( ; similar)
“Taxonomy of Real Faults in Deep Learning Systems”, Et Al 2019
“Taxonomy of Real Faults in Deep Learning Systems”, 2019-11-07 ( ; backlinks; similar)
“They Might Never Tell You It’s Broken”, Chevalier-2019
“They Might Never Tell You It’s Broken”, 2019-11-02 ( ; backlinks; similar; bibliography)
“Hyrum’s Law: An Observation on Software Engineering”, 2019
“Hyrum’s Law: An observation on Software Engineering”, 2019-11 (backlinks; similar; bibliography)
“Grandmaster Level in StarCraft II Using Multi-agent Reinforcement Learning”, Et Al 2019
“Grandmaster level in StarCraft II using multi-agent reinforcement learning”, 2019-10-30 ( ; similar; bibliography)
“Local-First Software: You Own Your Data, in spite of the Cloud [paper]”, Et Al 2019
“Local-First Software: You Own Your Data, in spite of the Cloud [paper]”, 2019-10-23 (backlinks; similar)
“Neural Networks Are a Priori Biased towards Boolean Functions With Low Entropy”, Et Al 2019
“Neural networks are a priori biased towards Boolean functions with low entropy”, 2019-09-25 ( ; similar)
“A Step Toward Quantifying Independently Reproducible Machine Learning Research”, 2019
“A Step Toward Quantifying Independently Reproducible Machine Learning Research”, 2019-09-14 ( ; backlinks; similar)
“A View on Deep Reinforcement Learning in System Optimization”, Haj-Et Al 2019
“A View on Deep Reinforcement Learning in System Optimization”, 2019-08-04 ( ; backlinks; similar)
“Moral Permissibility of Action Plans”, Et Al 2019
“Moral Permissibility of Action Plans”, 2019-07-17 ( ; similar)
“ParPaRaw: Massively Parallel Parsing of Delimiter-Separated Raw Data”, 2019
“ParPaRaw: Massively Parallel Parsing of Delimiter-Separated Raw Data”, 2019-05-31 (backlinks; similar)
“Real-world Dynamic Programming: Seam Carving”, 2019
“Real-world dynamic programming: seam carving”, 2019-05-14 (similar)
“Unraveling the JPEG: JPEG Images Are Everywhere in Our Digital Lives, but behind the Veil of Familiarity Lie Algorithms That Remove Details That Are Imperceptible to the Human Eye. This Produces the Highest Visual Quality With the Smallest File Size—but What Does That Look Like? Let’s See What Our Eyes Can’t See!”, 2019
“Unraveling the JPEG: JPEG images are everywhere in our digital lives, but behind the veil of familiarity lie algorithms that remove details that are imperceptible to the human eye. This produces the highest visual quality with the smallest file size—but what does that look like? Let’s see what our eyes can’t see!”, 2019-05-01 ( ; similar)
“Local-first Software: You Own Your Data, in spite of the Cloud [web]”, Et Al 2019
“Local-first software: You own your data, in spite of the cloud [web]”, 2019-04 ( ; backlinks; similar)
“GAP: Generalizable Approximate Graph Partitioning Framework”, Et Al 2019
“GAP: Generalizable Approximate Graph Partitioning Framework”, 2019-03-02 ( ; similar)
“Parsing Gigabytes of JSON per Second”, 2019
“Parsing Gigabytes of JSON per Second”, 2019-02-22 (backlinks; similar)
“AutoPhase: Compiler Phase-Ordering for High Level Synthesis With Deep Reinforcement Learning”, Haj-Et Al 2019
“AutoPhase: Compiler Phase-Ordering for High Level Synthesis with Deep Reinforcement Learning”, 2019-01-15 ( ; backlinks; similar)
“Test Driving ‘Power of Two Random Choices’ Load Balancing”, 2019
“Meta-Learning Neural Bloom Filters”, Rae & Al 2019
“Meta-Learning Neural Bloom Filters”, 2019 ( ; backlinks)
“Reinventing the Wheel: Discovering the Optimal Rolling Shape With PyTorch”, 2019
“Slow Software”, 2018
“Slow Software”, 2018-11 (similar)
“Learning to Perform Local Rewriting for Combinatorial Optimization”, 2018
“Learning to Perform Local Rewriting for Combinatorial Optimization”, 2018-09-30 ( ; backlinks; similar)
“How to Shuffle a Big Dataset”, 2018
“How to shuffle a big dataset”, 2018-09-26 ( ; similar)
“Deterministic Implementations for Reproducibility in Deep Reinforcement Learning”, Et Al 2018
“Deterministic Implementations for Reproducibility in Deep Reinforcement Learning”, 2018-09-15 ( ; backlinks; similar)
“Learning to Optimize Join Queries With Deep Reinforcement Learning”, Et Al 2018
“Learning to Optimize Join Queries With Deep Reinforcement Learning”, 2018-08-09 ( ; backlinks; similar)
“Umineko: The Opium Of The Magics”, 2018
“Umineko: The Opium Of The Magics”, 2018-07-04 ( ; backlinks; similar; bibliography)
“Learning to Optimize Tensor Programs”, Et Al 2018
“Learning to Optimize Tensor Programs”, 2018-05-21 ( ; backlinks; similar)
“Optimizing Query Evaluations Using Reinforcement Learning for Web Search”, Et Al 2018
“Optimizing Query Evaluations using Reinforcement Learning for Web Search”, 2018-04-12 ( ; backlinks; similar)
“Learning Memory Access Patterns”, Et Al 2018
“Learning Memory Access Patterns”, 2018-03-06 ( ; backlinks; similar)
“Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions”, Et Al 2018
“Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions”, 2018-02-13 ( ; backlinks; similar)
“The Case for Learned Index Structures”, Et Al 2017
“The Case for Learned Index Structures”, 2017-12-04 ( ; backlinks; similar)
“Automatic Differentiation in PyTorch”, Et Al 2017
“Automatic differentiation in PyTorch”, 2017-10-28 ( ; backlinks; similar)
“From Punched Cards to Flat Screens: A Technical Autobiography”, 2017
“DAG Reduction: Fast Answering Reachability Queries”, Et Al 2017
“DAG Reduction: Fast Answering Reachability Queries”, 2017-05-01 (similar)
“Stochastic Constraint Programming As Reinforcement Learning”, Et Al 2017
“Stochastic Constraint Programming as Reinforcement Learning”, 2017-04-24 ( ; backlinks; similar)
“Learning to Superoptimize Programs”, Et Al 2017
“Learning to superoptimize programs”, 2017-02-23 ( ; similar)
“Web Bloat”, 2017
“Web Bloat”, 2017-02-08 ( ; backlinks; similar)
“P≟NP § AI”, 2017 (page 5)
“P≟NP § AI”, 2017 (similar)
“Machine Learning for Systems and Systems for Machine Learning”, 2017
“Machine Learning for Systems and Systems for Machine Learning”, 2017 ( ; backlinks)
“Full Resolution Image Compression With Recurrent Neural Networks”, Et Al 2016
“Full Resolution Image Compression with Recurrent Neural Networks”, 2016-08-18 ( ; similar)
“Energy-Efficient Algorithms”, Et Al 2016
“Energy-Efficient Algorithms”, 2016-05-26 (similar)
“A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents”, 2016
“A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents”, 2016-04-13 (similar)
“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”, 2015
“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”, 2015-09-15 ( ; backlinks; similar; bibliography)
“Scalability! But at What COST?”, Et Al 2015
“Scalability! But at what COST?”, 2015-05 (backlinks; similar)
“Inferring Algorithmic Patterns With Stack-Augmented Recurrent Nets”, Et Al 2015
“Inferring Algorithmic Patterns with Stack-Augmented Recurrent Nets”, 2015-03-03 ( ; similar)
“The Ph.D. Grind: A Ph.D. Student Memoir”, 2015
“The Ph.D. Grind: A Ph.D. Student Memoir”, 2015 ( ; backlinks; similar)
“The Mystery Machine: End-to-end Performance Analysis of Large-scale Internet Services”, Et Al 2014
“The Mystery Machine: End-to-end performance analysis of large-scale Internet services”, 2014-10-06 ( ; backlinks; similar)
“How Inefficient Can a Sort Algorithm Be?”, 2014
“How inefficient can a sort algorithm be?”, 2014-06-03
“Core-Guided MaxSAT With Soft Cardinality Constraints”, Et Al 2014
“Core-Guided MaxSAT with Soft Cardinality Constraints”, 2014 (backlinks; similar)
“Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines”, Soler-Et Al 2014
“Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines”, 2014 (similar; bibliography)
“Algorithmic Progress in Six Domains”, 2013
“Algorithmic Progress in Six Domains”, 2013-12-09 ( ; similar)
“Intelligence Explosion Microeconomics”, 2013
“Intelligence Explosion Microeconomics”, 2013-09-13 ( ; similar)
“Bounded Kolmogorov Complexity Based on Cognitive Models”, Et Al 2013
“Bounded Kolmogorov Complexity Based on Cognitive Models”, 2013-01 ( ; similar)
“Evaluating the Design of the R Language: Objects and Functions for Data Analysis”, Et Al 2012
“Evaluating the Design of the R Language: Objects and Functions for Data Analysis”, 2012-06-11 ( ; similar)
“The International SAT Solver Competitions”, Et Al 2012
“The International SAT Solver Competitions”, 2012-03-15 ( ; backlinks; similar)
“National Cryptologic Museum Opens New Exhibit on Dr. John Nash”, NSA 2012
“National Cryptologic Museum Opens New Exhibit on Dr. John Nash”, 2012-01-27 ( ; backlinks; similar)
“A Brief History of NP-Completeness, 1954–2012”, 2012
“A Brief History of NP-Completeness, 1954–2012”, 2012 (backlinks; similar)
“STEPS Toward Expressive Programming Systems:”A Science Experiment”“, Et Al 2012 (page 2)
“STEPS Toward Expressive Programming Systems: "A Science Experiment"”, 2012 ( ; similar)
“A Cross-Language Perspective On Speech Information Rate”, Et Al 2011
“A Cross-Language Perspective On Speech Information Rate”, 2011-09 ( ; backlinks)
“Why Philosophers Should Care About Computational Complexity”, 2011
“Why Philosophers Should Care About Computational Complexity”, 2011-08-08 ( ; backlinks; similar)
“Notes on a New Philosophy of Empirical Science”, 2011
“Notes on a New Philosophy of Empirical Science”, 2011-04-28 ( ; backlinks; similar)
“New Strategy of Lossy Text Compression”, Al-2010
“New Strategy of Lossy Text Compression”, 2010-08-05 (similar)
“You’re Doing It Wrong: Think You’ve Mastered the Art of Server Performance? Think Again.”, 2010
“You’re Doing It Wrong: Think you’ve mastered the art of server performance? Think again.”, 2010-06-11 (backlinks; similar)
“Formal Theory of Creativity & Fun & Intrinsic Motivation (1990–2010)”, 2010
“Coolex: The Coolest Way to Generate Combinations”, 2009
“Coolex: The coolest way to generate combinations”, 2009-09-06 ( ; similar)
“De-anonymizing Social Networks”, 2009
“De-anonymizing Social Networks”, 2009-05-17 (backlinks; similar)
“The Gödel Letter”, 2009
“The Gödel Letter”, 2009-04-02 ( ; backlinks; similar)
“Producing Wrong Data Without Doing Anything Obviously Wrong!”, Et Al 2009
“Producing Wrong Data Without Doing Anything Obviously Wrong!”, 2009-03-07 ( ; backlinks; similar)
“Is There A Fourth Futamura Projection?”, 2009
“Is There A Fourth Futamura Projection?”, 2009-01-10
“Dual-Pivot Quicksort Algorithm”, 2009
“Driven by Compression Progress: A Simple Principle Explains Essential Aspects of Subjective Beauty, Novelty, Surprise, Interestingness, Attention, Curiosity, Creativity, Art, Science, Music, Jokes”, 2008
“Driven by Compression Progress: A Simple Principle Explains Essential Aspects of Subjective Beauty, Novelty, Surprise, Interestingness, Attention, Curiosity, Creativity, Art, Science, Music, Jokes”, 2008-12-23 ( ; similar)
“Aggregating Inconsistent Information: Ranking and Clustering”, Et Al 2008
“Aggregating inconsistent information: Ranking and clustering”, 2008-11 ( ; backlinks; similar)
“Interview With Donald Knuth”, 2008
“Interview with Donald Knuth”, 2008-04-25 (similar; bibliography)
“Optimal Boarding Method for Airline Passengers”, 2008
“Optimal boarding method for airline passengers”, 2008-02-06 (similar)
“Harnessing Vision for Computation”, 2008
“Harnessing Vision for Computation”, 2008 ( ; backlinks)
“How To Break Anonymity of the Netflix Prize Dataset”, 2006
“How To Break Anonymity of the Netflix Prize Dataset”, 2006-10-18 ( ; backlinks; similar)
“Oral History of Butler Lampson § WWW”, 2006 (page 36)
“Oral History of Butler Lampson § WWW”, 2006-08-22 ( ; similar; bibliography)
“History of Combinatorial Generation (The Art of Computer Programming: Volume 4: Pre-Fascicle 4B: §7.2.1.7)”, 2005
“NP-complete Problems and Physical Reality”, 2005
“NP-complete Problems and Physical Reality”, 2005-02-12 ( ; similar)
“Lower-Stretch Spanning Trees”, Et Al 2004
“Lower-Stretch Spanning Trees”, 2004-11-17 (backlinks)
“A Short History of Computational Complexity”, Et Al 2003
“A Short History of Computational Complexity”, 2003-10-02 (backlinks)
“Least Effort and the Origins of Scaling in Human Language”, 2003
“Least effort and the origins of scaling in human language”, 2003 ( ; backlinks; similar)
“Solving Real-World Linear Programs: A Decade and More of Progress”, 2002
“Solving Real-World Linear Programs: A Decade and More of Progress”, 2002-02-01 ( ; similar)
“A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances”, 2002
“A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances”, 2002-01 (similar)
“Estimating and Comparing Entropy across Written Natural Languages Using PPM Compression”, Et Al 2002
“Estimating and Comparing Entropy across Written Natural Languages Using PPM Compression”, 2002 ( ; backlinks; similar)
“Naked Objects: a Technique for Designing More Expressive Systems”, 2001
“Naked objects: a technique for designing more expressive systems”, 2001-12-01 ( ; similar)
“On Proebsting’s Law”, 2001
“On Proebsting's Law”, 2001-03-01 ( ; backlinks; similar)
“Peopleware: Why Measure Performance”, 2001
“The Effects of Moore’s Law and Slacking on Large Computations”, Et Al 1999
“The Effects of Moore’s Law and Slacking on Large Computations”, 1999-12-09 ( ; backlinks)
“The Physical Limits of Communication”, Et Al 1999
“The physical limits of communication”, 1999-07-30 (similar)
“Quantum Effects in Algorithms”, 1998
“Quantum Effects in Algorithms”, 1998-05-29 ( ; backlinks; similar)
“Applications of Randomness in System Performance Measurement”, 1998
“Applications of Randomness in System Performance Measurement”, 1998-05 ( ; backlinks; similar)
“Proebsting’s Law: Compiler Advances Double Computing Power Every 18 Years”, 1998
“Proebsting’s Law: Compiler Advances Double Computing Power Every 18 Years”, 1998 ( ; backlinks; similar)
“THE ENTROPY OF ENGLISH USING PPM-BASED MODELS—Data Compression Conference, 1996. DCC ’96. Proceedings”
“Entropy of Natural Languages: Theory and Experiment”, 1994
“Entropy of natural languages: Theory and experiment”, 1994-05-01 (similar)
“Building a Large Annotated Corpus of English: The Penn Treebank”, Et Al 1993
“Building a Large Annotated Corpus of English: The Penn Treebank”, 1993-10-01 ( ; backlinks)
“Separating Strings With Small Automata”, 1989
“Separating strings with small automata”, 1989-02-27
“Optimal Nonlinear Approximation”, Et Al 1989
“Hypertext and the Oxford English Dictionary”, 1988
“Hypertext and the Oxford English dictionary”, 1988-07-01 ( )
“Average Case Complete Problems”, 1986
“Average Case Complete Problems”, 1986-02-01 (backlinks; similar)
“Probabilistic Counting Algorithms for Data Base Applications”, 1985
“Probabilistic counting algorithms for data base applications”, 1985-10 (backlinks; similar)
“Randomness Conservation Inequalities; Information and Independence in Mathematical Theories”, 1984
“Randomness conservation inequalities; information and independence in mathematical theories”, 1984-04 ( ; backlinks; similar)
“Epigrams on Programming”, 1982
“Epigrams on Programming”, 1982-09 ( ; backlinks; similar)
“Procedural Reflection in Programming Languages”, 1982
“Procedural Reflection in Programming Languages”, 1982-02 ( ; similar)
“On Holy Wars and a Plea for Peace”, 1981
“On Holy Wars and a Plea for Peace”, 1981-10-01 (backlinks; similar)
“Mutation Analysis Of Program Test Data”, 1980
“Mutation Analysis Of Program Test Data”, 1980-05 ( ; similar; bibliography)
“A Correct Preprocessing Algorithm for Boyer-Moore String-Searching”, 1980
“A Correct Preprocessing Algorithm for Boyer-Moore String-Searching”, 1980
“A Convergent Gambling Estimate Of The Entropy Of English”, 1978
“A Convergent Gambling Estimate Of The Entropy Of English”, 1978-07-01 ( ; backlinks; similar)
“Algorithms for Loop Matchings”, Et Al 1978
“Algorithms for Loop Matchings”, 1978-01 (similar)
“Fast Pattern Matching in Strings”, Et Al 1977
“Fast Pattern Matching in Strings”, 1977-06-01 (backlinks; similar)
“Structured Programming With go To
Statements”, 1974
“Structured Programming with go to
Statements”, 1974-12 (similar)
“A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations”, 1973
“A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations”, 1973-08 (similar)
“The Dangers of Computer-Science Theory”, 1973
“The Dangers of Computer-Science Theory”, 1973 ( ; backlinks; similar)
“Universal Sequential Search Problems”, 1973
“Universal Sequential Search Problems”, 1973 ( ; backlinks)
“The Humble Programmer [EWD340]”, 1972
“The Humble Programmer [EWD340]”, 1972 ( ; backlinks; similar)
“A Simple Randomization Procedure”, 1962
“A Simple Randomization Procedure”, 1962-07-01 ( ; backlinks; similar)
“Generation of Random Permutations of Given Number of Elements Using Random Sampling Numbers”, 1961
“Generation of Random Permutations of Given Number of Elements Using Random Sampling Numbers”, 1961-08-01 ( ; backlinks; similar)
“Possible Principles Underlying the Transformations of Sensory Messages”, 1961
“Possible Principles Underlying the Transformations of Sensory Messages”, 1961 ( ; similar; bibliography)
“Coding Theorems for a Discrete Source With a Fidelity Criterion”, 1959
“Coding Theorems for a Discrete Source With a Fidelity Criterion”, 1959 ( ; backlinks; similar)
“The Codeless Code: Case 96:”Stateless” ”
“Submission #6347: Chef Stef’s NES Arkanoid ‘Warpless’ In 11:11.18”
“TSP Art”
Wikipedia
Miscellaneous
-
1956-shannon.pdf
1956 ( ) -
http://www.scholarpedia.org/article/Applications_of_algorithmic_information_theory
-
https://psyche.co/ideas/as-language-evolves-who-wins-out-speakers-or-listeners
-
https://robertheaton.com/2018/12/17/wavefunction-collapse-algorithm/
-
https://www.lesswrong.com/posts/aRxDLju75KXD6PCpB/wolf-incident-postmortem
-
https://xorshammer.com/2008/08/21/compute-definite-integral/
Link Bibliography
-
https://levelup.gitconnected.com/searching-for-cyclic-tv-reference-paradoxes-d125ff014279
: “Searching for Cyclic TV Reference Paradoxes”, Jamie Pinheiro: -
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”, Florian Tambon, Amin Nikanjam, Le An, Foutse Khomh, Giuliano Antoniol: -
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”, Kévin Dietrich: -
https://arxiv.org/abs/2106.12372#nvidia
: “Real-time Neural Radiance Caching for Path Tracing”, Thomas Müller, Fabrice Rousselle, Jan Novák, Alexander Keller: -
https://www.ethanrosenthal.com/2020/08/25/optimal-peanut-butter-and-banana-sandwiches/
: “Optimal Peanut Butter and Banana Sandwiches”, Ethan Rosenthal: -
scaling-hypothesis
: “The Scaling Hypothesis”, Gwern Branwen: -
https://pointersgonewild.com/2019/11/02/they-might-never-tell-you-its-broken/
: “They Might Never Tell You It’s Broken”, Maxime Chevalier-Boisvert: -
https://www.hyrumslaw.com/
: “Hyrum’s Law: An Observation on Software Engineering”, Hyrum Wright: -
2019-vinyals.pdf#deepmind
: “Grandmaster Level in StarCraft II Using Multi-agent Reinforcement Learning”, : -
umineko
: “Umineko: The Opium Of The Magics”, Gwern Branwen: -
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”, Cade Metz: -
https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4014489/
: “Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines”, Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit: -
https://www.informit.com/articles/article.aspx?p=1193856
: “Interview With Donald Knuth”, Andrew Binstock: -
http://archive.computerhistory.org/resources/text/Oral_History/Lampson_Butler/102658024.05.01.pdf#page=36
: “Oral History of Butler Lampson § WWW”, Butler Lampson, Alan Kay: -
1980-budd.pdf
: “Mutation Analysis Of Program Test Data”, Timothy Alan Budd: -
1961-barlow.pdf
: “Possible Principles Underlying the Transformations of Sensory Messages”, H. B. Barlow: