Posts Tagged “CS Theory”

Arvind, RIP June 19, 2024
Ceasing Print Publication of ACM Journals and Transactions November 1, 2023
Jacob Ziv, RIP April 7, 2023
Abraham Lempel, RIP April 7, 2023
What Is ChatGPT Doing and Why Does It Work? February 24, 2023
It’s Often Memory That’s Killing Your Performance December 29, 2022
The Verse Programming Language December 13, 2022
ChatGPT (6)December 5, 2022
Compiling Swift Generics October 17, 2022
ACM Makes Research Articles Freely Available June 14, 2022
Applying Computer Science April 21, 2022
Christopher Alexander, RIP March 24, 2022
Swift Type Checking Is Undecidable (1)February 28, 2022
SectorLISP: Lisp With GC in 436 Bytes (1)December 21, 2021
William Cook, RIP (5)December 2, 2021
Aho and Ullman Win Turing Award (1)April 2, 2021
LAMBDA: The Ultimate Excel Worksheet Function (5)February 3, 2021
Jacob Ziv Honored January 18, 2021
S3 Strong Consistency December 21, 2020
A Primer on Memory Consistency and Cache Coherence August 24, 2020
Pooled SARS-CoV-2 Testing (1)August 24, 2020
CS Unplugged April 23, 2020
Crafting Interpreters (1)April 15, 2020
John Conway, RIP April 14, 2020
Temporarily Free Content April 13, 2020
Jim des Rivieres, RIP May 6, 2019
Computer Pioneers Advent Calendar December 27, 2018
Category Theory for Programmers November 19, 2018
Fibonacci Hashing June 26, 2018
Paradigms of Artificial Intelligence Programming February 27, 2018
The Case for Learned Index Structures December 11, 2017
Data Locality and STL vs. Swift September 6, 2017
CS Papers I Like August 16, 2017
Radix Sort Revisited August 9, 2017
Why Do So Few People Major in Computer Science? (3)June 2, 2017
The Myth of RAM (1)August 31, 2016
mov Is Turing-complete August 29, 2016
The Dissertation Behind rsync June 24, 2016
On Flexible Systems May 6, 2016
Claude Shannon Turns 1100100 May 5, 2016
Fast Ordered Collections for Swift Using In-memory B-trees (1)March 1, 2016
The End of Dynamic Languages (8)December 3, 2015
Covariance and Contravariance November 29, 2015
George Boole: a 200-Year View November 10, 2015
What the Heck Is a Monad (9)October 5, 2015
Computer Science Courses that Don’t Exist, But Should September 13, 2015
Why Dependent Types Matter (2)September 3, 2015
Bloom Filters August 23, 2015
Sorting Algorithm Animations August 2, 2015
Higher Order Functions in Swift 2 July 22, 2015
Quoted Domain Specific Languages April 9, 2015
The Imitation Game (1)January 24, 2015
Creating the Natural Numbers From First Principles January 24, 2015
The Design Philosophy of the DARPA Internet Protocols January 23, 2015
100 Years of Computer Science January 17, 2015
Mergeable Persistent Data Structures January 17, 2015
Proof in Functions January 13, 2015
The Morning Paper January 13, 2015
Functor and Monad in Swift (1)January 13, 2015
The Dawn of Trustworthy Computing (1)December 15, 2014
Zero Knowledge Proofs: an Illustrated Primer November 29, 2014
Twenty Questions for Donald Knuth May 25, 2014
Visualizing Regular Expressions April 10, 2014
Leslie Lamport Wins Turing Award (3)March 18, 2014
How to Succeed at Recursion Without Really Recursing February 27, 2014
Principles of Programming Languages 2014 January 24, 2014
The Little Book of Semaphores October 19, 2013
Postmodern Programming September 29, 2013
A Simple Problem Whose Decidability Is Not Known September 9, 2013
Principles of Reactive Programming (2)August 28, 2013
The Pumping Lemma, The Pigeonhole Principle, and Differentiating Languages August 21, 2013
TCP ex Machina: Computer-Generated Congestion Control July 25, 2013
Mutability, Aliasing, and the Caches You Didn’t Know You Had July 9, 2013
The CAP FAQ May 11, 2013
Regular Expression to Match Multiples of 3 March 28, 2013
The Power of Abstraction March 14, 2013
What CS Papers Should Everyone Read? (2)March 14, 2013
Studying Finite Automata December 26, 2012
Tetris is Hard, Even to Approximate October 25, 2002

Note: Most posts from before September 2012 are not yet tagged.