“‘Algorithms’ Tag”,2019-09-07 ():
![]()
Bibliography for tag
cs/algorithm, most recent first: 3 related tags, 231 annotations, & 139 links (parent).
- See Also
- Gwern
- Links
- “Float Self-Tagging”, et al 2024
- “Breaking Bad: How Compilers Break Constant-Time”, et al 2024
- “It’s Not Easy Being Green: On the Energy Efficiency of Programming Languages”, et al 2024
- “Glue and Coprocessor Architectures”, 2024
- “Amit’s A✱ Pages”, 2024
- “Writing Commit Messages”, 2024
- “Polyamorous Scheduling”, et al 2024
- “Beyond A✱: Better Planning With Transformers via Search Dynamics Bootstrapping (Searchformer)”, et al 2024
- “Hamiltonicity of Expanders: Optimal Bounds and Applications”, et al 2024
- “Efficient Parallelization of an Ubiquitous Sequential Computation”, 2023
- “Towards Automatic Design of Factorio Blueprints”, et al 2023
- “U-Net CNN in APL: Exploring Zero-Framework, Zero-Library Machine Learning”, Hsu & 2023
- “Blockwise Parallel Transformer for Long Context Large Models”, 2023
- “You And Your Research”, 2023
- “Distinct Elements in Streams: An Algorithm for the (Text) Book”, 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
- “Heisenbugs: The Most Elusive Kind of Bug, and How to Capture Them With Perfect Replayability—Eliminate Heisenbugs and Endless Debugging Sessions!”, 2022
- “Progress in Mathematical Programming Solvers 2001–192020”, 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
- “Clock: 解説”
- “Bamboo Trimming Revisited: Simple Algorithms Can Do Well Too”, 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
- “Small-Amp: Test Amplification in a Dynamically Typed Language”, et al 2021
- “Learning a Large Neighborhood Search Algorithm for Mixed Integer Programs”, et al 2021
- “Hacker News Folk Wisdom on Visual Programming”, 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
- “A Time Leap Challenge for SAT Solving”, et al 2020
- “Measuring Hardware Overhang”, hippke 2020
- “A Bayesian Approach to the Simulation Argument”, 2020
- “Algorithms With Predictions”, 2020
- “BanditPAM: Almost Linear Time k-Medoids Clustering via Multi-Armed Bandits”, et al 2020
- “Funnel-Transformer: Filtering out Sequential Redundancy for Efficient Language Processing”, et al 2020
- “Lessons Learned from Bugs in Models of Human History”, et al 2020
- “Measuring the Algorithmic Efficiency of Neural Networks”, 2020
- “Tech Notes: The Success and Failure of Ninja”
- “Bringing GNU Emacs to Native Code”, et al 2020
- “Learning-Based Memory Allocation for C++ Server Workloads”, et al 2020
- “Reinforcement Learning for Combinatorial Optimization: A Survey”, et al 2020
- “The History of the URL”, 2020
- “Quantifying Independently Reproducible Machine Learning”, 2020
- “Solving Billion-Scale Knapsack Problems”, et al 2020
- “Taxonomy of Real Faults in Deep Learning Systems”, et al 2019
- “They Might Never Tell You It’s Broken”, Chevalier-2019
- “Co-Dfns: A Data Parallel Compiler Hosted on the GPU”, 2019c
- “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
- “Gated Linear Networks”, et al 2019
- “A Step Toward Quantifying Independently Reproducible Machine Learning Research”, 2019
- “Different Languages, Similar Encoding Efficiency: Comparable Information Rates across the Human Communicative Niche”, et al 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
- “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
- “Reinventing the Wheel: Discovering the Optimal Rolling Shape With PyTorch”, 2019
- “Meta-Learning Neural Bloom Filters”, 2019
- “SageDB: A Learned Database System”, 2019
- “Test Driving ‘Power of Two Random Choices’ Load Balancing”, 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
- “Always Measure One Level Deeper: Performance Measurements Often Go Wrong, Reporting Surface-Level Results That Are More Marketing Than Science”, 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
- “Innovation and Cumulative Culture through Tweaks and Leaps in Online Programming Contests”, 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
- “Resource-Efficient Machine Learning in 2 KB RAM for the Internet of Things”, et al 2017
- “Machine Learning for Systems and Systems for Machine Learning”, 2017
- “P≟NP § AI”, 2017 (page 5)
- “Neural Combinatorial Optimization With Reinforcement Learning”, et al 2016
- “The Doodle Theorem, and Beyond: Colin Wright Juggles Euler, Doodling and Millennium Problems”, 2016
- “Coz: Finding Parallel Code That Counts With Causal Profiling”, 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 Misfortunes of a Trio of Mathematicians Using Computer Algebra Systems—Can We Trust in Them?”, et al 2014
- “Always Bet on Text”, graydon2 2014
- “The Mystery Machine: End-To-End Performance Analysis of Large-Scale Internet Services”, et al 2014 (page 2)
- “Core-Guided MaxSAT With Soft Cardinality Constraints”, et al 2014
- “Algorithmic Progress in Six Domains”, 2013
- “Intelligence Explosion Microeconomics”, 2013
- “Homotopy Groups of Suspended Classifying Spaces: An Experimental Approach”, 2013
- “Bounded Kolmogorov Complexity Based on Cognitive Models”, et al 2013
- “Really Automatic Scalable Object-Oriented Reengineering”, et al 2013
- “Planning As Satisfiability: Heuristics”, 2012
- “The Algebraic Combinatorial Approach for Low-Rank Matrix Completion”, et al 2012
- “Evaluating the Design of the R Language: Objects and Functions for Data Analysis”, et al 2012
- “The International SAT Solver Competitions”, et al 2012
- “Uniform Random Generation of Large Acyclic Digraphs”, 2012
- “National Cryptologic Museum Opens New Exhibit on Dr. John Nash”, NSA 2012
- “How Trello Is Different”, 2012
- “A Brief History of NP-Completeness, 1954–58201212ya”, 2012
- “Cutting the Pipe: Achieving Sub-Second Iteration Times”, 5.1.1 2012
- “STEPS Toward Expressive Programming Systems: “A Science Experiment””, et al 2012 (page 2)
- “Why Philosophers Should Care About Computational Complexity”, 2011
- “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–20201014ya)”, 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
- “The Tactical Amulet Extraction Bot: Predicting and Controlling NetHack’s Randomness”
- “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
- “Bigtable: A Distributed Storage System for Structured Data”, et al 2008
- “Interview With Donald Knuth”, 2008
- “Optimal Boarding Method for Airline Passengers”, 2008
- “Harnessing Vision for Computation”, 2008
- “Communication in Economic Mechanisms”, 2006b
- “How To Break Anonymity of the Netflix Prize Dataset”, 2006
- “Global Multiple Objective Line Breaking”, 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) § Pg22”, 2005 (page 22)
- “Modeling Bursts and Heavy Tails in Human Dynamics”, et al 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
- “Extended Comment on Language Trees and Zipping”, 2002
- “Solving Real-World Linear Programs: A Decade and More of Progress”, 2002
- “A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances”, 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
- “Bridging the Algorithm Gap: A Linear-Time Functional Program for Paragraph Formatting”, 1999
- “Feynman’s War: Modeling Weapons, Modeling Nature”, 1998
- “The Concave Least-Weight Subsequence Problem Revisited”, 1998
- “Applications of Randomness in System Performance Measurement”, 1998
- “The PageRank Citation Ranking: Bringing Order to the Web”, et al 1998
- “Proebsting’s Law: Compiler Advances Double Computing Power Every 18 Years”, 1998
- “The T-Experiments: Errors in Scientific Software”, 1997
- “George Prices’s Contributions to Evolutionary Genetics”, 1995
- “The Nature of Selection”, 1995
- “A Plea for Lean Software”, 1995
- “Building a Large Annotated Corpus of English: The Penn Treebank”, et al 1993
- “On the Computational Complexity of the Jones and Tutte Polynomials”, et al 1990
- “A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming”, 1990
- “Planning and Learning in Permutation Groups”, et al 1989
- “Separating Strings With Small Automata”, 1989
- “Optimal Nonlinear Approximation”, et al 1989
- “Hypertext and the Oxford English Dictionary”, 1988
- Three Scientists and Their Gods: Looking for Meaning in an Age of Information, 1988
- “Incentive Engineering: for Computational Resource Management”, 1988
- “The Least Weight Subsequence Problem”, 1987
- “Geometric Applications of a Matrix Searching Algorithm”, et al 1986
- “The Back of the Envelope Returns”, 1986
- “Average Case Complete Problems”, 1986
- “Probabilistic Counting Algorithms for Data Base Applications”, 1985
- “Programming As Theory Building”, 1985
- “The Back of the Envelope”, 1984
- “The Competitive Allocation Process Is Informationally Efficient Uniquely”, 1982
- “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
- “Algorithms for Loop Matchings”, et al 1978
- “Fast Pattern Matching in Strings”, et al 1977
- “Structured Programming With
go ToStatements”, 1974- Interstellar Communication: Scientific Perspectives, 1974
- “A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations”, 1973
- “Universal Sequential Search Problems”, 1973
- “The Dangers of Computer-Science Theory”, 1973
- “The Humble Programmer [EWD340]”, 1972
- “The Pattern of Streets”, 1966
- “A Simple Randomization Procedure”, 1962
- “Generation of Random Permutations of Given Number of Elements Using Random Sampling Numbers”, 1961
- “Addressing for Random-Access Storage”, 1957
- “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”
- “Personality Value”
- “Measurement, Benchmarking, and Data Analysis Are Underrated”
- “Dynamicland”, 2024
- “Programmed Differently? Testing for Gender Differences in Python Programming Style and Quality on GitHub”
- “Differentiable Finite State Machines”
- “Getting the World Record in HATETRIS”
- “LISP With GC in 436 Bytes”
- “Heuristics on the High Seas: Mathematical Optimization for Cargo Ships”
- “Programming’s Dirtiest Little Secret”, 2024
- “Submission #6347: Chef Stef’s NES Arkanoid
warplessin 11:11.18”- “Differentiable Programming from Scratch”
- “Technical Dimensions of Programming Systems”
- “How Much of a Genius-Level Move Was Using Binary Space Partitioning in Doom?”
- “An Open Letter to Netflix from the Authors of the De-Anonymization Paper”
- “Scaling Our Spreadsheet Engine from Thousands to Billions of Cells”
- “The Art and Mathematics of Genji-Kō”
- “TSP Art”
- Wikipedia
- Miscellaneous
- Bibliography