Paper Lists

This page collects papers that I have come across and considered to be “worth a read”, grouped by topic. It is primarily a link list that I use for myself, but I hope you find something useful here too.

Table of Contents

Artificial Intelligence (LLMs)

Date Paper Authors
DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligence DOI: 10.48550/arXiv.2606.19348 DeepSeek-AI et al.
Absolute Zero: Reinforced Self-play Reasoning with Zero Data DOI: 10.48550/arXiv.2505.03335 Zhao et al.
Muon is Scalable for LLM Training DOI: 10.48550/arXiv.2502.16982 Liu et al.
s1: Simple test-time scaling DOI: 10.48550/arXiv.2501.19393 Muennighoff et al.
DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning DOI: 10.48550/arXiv.2501.12948 DeepSeek-AI et al.
Kimi k1.5: Scaling Reinforcement Learning with LLMs DOI: 10.48550/arXiv.2501.12599 Kimi Team et al.
DeepSeek-V3 Technical Report DOI: 10.48550/arXiv.2412.19437 DeepSeek-AI et al.
DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model DOI: 10.48550/arXiv.2405.04434 DeepSeek-AI et al.
DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models DOI: 10.48550/arXiv.2402.03300 Shao et al.
Mamba: Linear-Time Sequence Modeling with Selective State Spaces DOI: 10.48550/arXiv.2312.00752 Gu & Dao
Direct Preference Optimization: Your Language Model is Secretly a Reward Model DOI: 10.48550/arXiv.2305.18290 Rafailov et al.
QLoRA: Efficient Finetuning of Quantized LLMs DOI: 10.48550/arXiv.2305.14314 Dettmers et al.
GPT-4 Technical Report DOI: 10.48550/arXiv.2303.08774 OpenAI et al.
LLaMA: Open and Efficient Foundation Language Models DOI: 10.48550/arXiv.2302.13971 Touvron et al.
Constitutional AI: Harmlessness from AI Feedback DOI: 10.48550/arXiv.2212.08073 Bai et al.
ReAct: Synergizing Reasoning and Acting in Language Models DOI: 10.48550/arXiv.2210.03629 Yao et al.
FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness DOI: 10.48550/arXiv.2205.14135 Dao et al.
Training Compute-Optimal Large Language Models DOI: 10.48550/arXiv.2203.15556 Hoffmann et al.
Training language models to follow instructions with human feedback DOI: 10.48550/arXiv.2203.02155 Ouyang et al.
Chain-of-Thought Prompting Elicits Reasoning in Large Language Models DOI: 10.48550/arXiv.2201.11903 Wei et al.
High-Resolution Image Synthesis with Latent Diffusion Models DOI: 10.48550/arXiv.2112.10752 Rombach et al.
LoRA: Low-Rank Adaptation of Large Language Models DOI: 10.48550/arXiv.2106.09685 Hu et al.
Learning Transferable Visual Models From Natural Language Supervision DOI: 10.48550/arXiv.2103.00020 Radford et al.
Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity DOI: 10.48550/arXiv.2101.03961 Fedus et al.
An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale DOI: 10.48550/arXiv.2010.11929 Dosovitskiy et al.
Denoising Diffusion Probabilistic Models DOI: 10.48550/arXiv.2006.11239 Ho et al.
Language Models are Few-Shot Learners DOI: 10.48550/arXiv.2005.14165 Brown et al.
Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks DOI: 10.48550/arXiv.2005.11401 Lewis et al.
Scaling Laws for Neural Language Models DOI: 10.48550/arXiv.2001.08361 Kaplan et al.
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding DOI: 10.48550/arXiv.1810.04805 Devlin et al.
Attention Is All You Need DOI: 10.48550/arXiv.1706.03762 Vaswani et al.
Deep Residual Learning for Image Recognition DOI: 10.48550/arXiv.1512.03385 He et al.
Adam: A Method for Stochastic Optimization DOI: 10.48550/arXiv.1412.6980 Kingma & Ba
Generative Adversarial Networks DOI: 10.48550/arXiv.1406.2661 Goodfellow et al.

Distributed Systems

Date Paper Authors
HotStuff: BFT Consensus in the Lens of Blockchain DOI: 10.48550/arXiv.1803.05069 Yin et al.
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol DOI: 10.1007/978-3-319-63688-7_12 Kiayias et al.
Bitcoin-NG: A Scalable Blockchain Protocol DOI: 10.48550/arXiv.1510.02037 Eyal et al.
Large-scale Cluster Management at Google with Borg DOI: 10.1145/2741948.2741964 Verma et al.
In Search of an Understandable Consensus Algorithm Ongaro & Ousterhout
Spanner: Google's Globally-Distributed Database DOI: 10.1145/2491245 Corbett et al.
Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing Zaharia et al.
Conflict-Free Replicated Data Types DOI: 10.1007/978-3-642-24550-3_29 Shapiro et al.
Kafka: A Distributed Messaging System for Log Processing Kreps, Narkhede & Rao
Dremel: Interactive Analysis of Web-Scale Datasets DOI: 10.14778/1920841.1920886 Melnik et al.
ZooKeeper: Wait-free Coordination for Internet-scale Systems Hunt et al.
Cassandra: A Decentralized Structured Storage System DOI: 10.1145/1773912.1773922 Lakshman & Malik
Dapper, a Large-Scale Distributed Systems Tracing Infrastructure Sigelman et al.
Bitcoin: A Peer-to-Peer Electronic Cash System Nakamoto
Dynamo: Amazon's Highly Available Key-value Store DOI: 10.1145/1294261.1294281 DeCandia et al.
Bigtable: A Distributed Storage System for Structured Data Chang et al.
Ceph: A Scalable, High-Performance Distributed File System Weil et al.
The Chubby Lock Service for Loosely-Coupled Distributed Systems Burrows
MapReduce: Simplified Data Processing on Large Clusters Dean & Ghemawat
The Google File System DOI: 10.1145/945445.945450 Ghemawat, Gobioff & Leung
Brewer's Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services DOI: 10.1145/564585.564601 Gilbert & Lynch
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric DOI: 10.1007/3-540-45748-8_5 Maymounkov & Mazières
Paxos Made Simple DOI: 10.1145/568425.568433 Lamport
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications DOI: 10.1145/383059.383071 Stoica et al.
Practical Byzantine Fault Tolerance Castro & Liskov
The Part-Time Parliament DOI: 10.1145/279227.279229 Lamport
Unreliable Failure Detectors for Reliable Distributed Systems DOI: 10.1145/226643.226647 Chandra & Toueg
Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial DOI: 10.1145/98163.98167 Schneider
Linearizability: A Correctness Condition for Concurrent Objects DOI: 10.1145/78969.78972 Herlihy & Wing
Consensus in the Presence of Partial Synchrony DOI: 10.1145/42282.42283 Dwork, Lynch & Stockmeyer
Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems DOI: 10.1145/62546.62549 Oki & Liskov
Epidemic Algorithms for Replicated Database Maintenance DOI: 10.1145/41840.41841 Demers et al.
Impossibility of Distributed Consensus with One Faulty Process DOI: 10.1145/3149.214121 Fischer, Lynch & Paterson
Distributed Snapshots: Determining Global States of Distributed Systems DOI: 10.1145/214451.214456 Chandy & Lamport
The Byzantine Generals Problem DOI: 10.1145/357172.357176 Lamport, Shostak & Pease
Time, Clocks, and the Ordering of Events in a Distributed System DOI: 10.1145/359545.359563 Lamport
Self-stabilizing Systems in Spite of Distributed Control DOI: 10.1145/361179.361202 Dijkstra

Uncategorized (random)

Date Paper Authors
Meltdown: Reading Kernel Memory from User Space DOI: 10.48550/arXiv.1801.01207 Lipp et al.
Spectre Attacks: Exploiting Speculative Execution DOI: 10.48550/arXiv.1801.01203 Kocher et al.
The Tail at Scale DOI: 10.1145/2408776.2408794 Dean & Barroso
Architecture of a Database System DOI: 10.1561/1900000002 Hellerstein et al.
Tor: The Second-Generation Onion Router Dingledine et al.
The Anatomy of a Large-Scale Hypertextual Web Search Engine DOI: 10.1016/S0169-7552(98)00110-X Brin & Page
The Early History of Smalltalk DOI: 10.1145/155360.155364 Kay
The Computer for the 21st Century DOI: 10.1038/scientificamerican0991-94 Weiser
Why Functional Programming Matters DOI: 10.1093/comjnl/32.2.98 Hughes
No Silver Bullet: Essence and Accidents of Software Engineering DOI: 10.1109/MC.1987.1663532 Brooks
End-to-End Arguments in System Design DOI: 10.1145/357401.357402 Saltzer et al.
Reflections on Trusting Trust DOI: 10.1145/358198.358210 Thompson
Hints for Computer System Design DOI: 10.1145/773379.806614 Lampson
Direct Manipulation: A Step Beyond Programming Languages DOI: 10.1109/MC.1983.1654471 Shneiderman
How to Share a Secret DOI: 10.1145/359168.359176 Shamir
Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs DOI: 10.1145/359576.359579 Backus
Communicating Sequential Processes DOI: 10.1145/359576.359585 Hoare
Secure Communications Over Insecure Channels DOI: 10.1145/359460.359473 Merkle
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems DOI: 10.1145/359340.359342 Rivest, Shamir & Adleman
Personal Dynamic Media DOI: 10.1109/C-M.1977.217672 Kay & Goldberg
A Universal Algorithm for Sequential Data Compression DOI: 10.1109/TIT.1977.1055714 Ziv & Lempel
New Directions in Cryptography DOI: 10.1109/TIT.1976.1055638 Diffie & Hellman
Ethernet: Distributed Packet Switching for Local Computer Networks DOI: 10.1145/360248.360253 Metcalfe & Boggs
The UNIX Time-Sharing System DOI: 10.1145/361011.361061 Ritchie & Thompson
A Protocol for Packet Network Intercommunication DOI: 10.1109/TCOM.1974.1092259 Cerf & Kahn
Reducibility Among Combinatorial Problems DOI: 10.1007/978-1-4684-2001-2_9 Karp
The Complexity of Theorem-Proving Procedures DOI: 10.1145/800157.805047 Cook
A Relational Model of Data for Large Shared Data Banks DOI: 10.1145/362384.362685 Codd
An Axiomatic Basis for Computer Programming DOI: 10.1145/363235.363259 Hoare
A Research Center for Augmenting Human Intellect DOI: 10.1145/1476589.1476645 Engelbart & English
The Computer as a Communication Device Licklider & Taylor
Go To Statement Considered Harmful DOI: 10.1145/362929.362947 Dijkstra
Quicksort DOI: 10.1093/comjnl/5.1.10 Hoare
Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I DOI: 10.1145/367177.367199 McCarthy
Man-Computer Symbiosis DOI: 10.1109/THFE2.1960.4503259 Licklider
A Note on Two Problems in Connexion with Graphs DOI: 10.1007/BF01386390 Dijkstra
A Method for the Construction of Minimum-Redundancy Codes DOI: 10.1109/JRPROC.1952.273898 Huffman
A Mathematical Theory of Communication DOI: 10.1002/j.1538-7305.1948.tb01338.x Shannon
As We May Think Bush
On Computable Numbers, with an Application to the Entscheidungsproblem DOI: 10.1112/plms/s2-42.1.230 Turing