computer-science

This article explains the Aho-Corasick algorithm for simultaneous substring matching, detailing its construction using tries and suffix links.

This article explains the rounding errors in decimal calculations with floating-point numbers in programming, using Python examples to illustrate the patterns that emerge from IEEE double-precision floats.

The author emphasizes that university undergraduates should buy coding plans for tools like Claude Code or Codex, build minimal coding agents, and explore advanced features to excel in computer science.

This 1996 paper introduces Lifestreams, a storage model for organizing personal digital data into a continuous, searchable stream.

This blog post provides a playful and beginner-friendly introduction to coding theory, using simple examples like flashlight communication to explain basic concepts.

This blog post provides an in-depth analysis of adversarial examples targeting fast hash functions, comparing their speed and collision resistance, and detailing vulnerabilities across multiple implementations.

Patrick McKenzie questions the skepticism around unauthorized knowledge production by computers, discussing philosophical implications for AI and knowledge management.

The article derives mathematical formulas for error distribution in consistent hashing systems, aiding in workload optimization across servers. It is a technical derivation that includes web assembly demos and references a Cloudflare blog post.

A rumor suggests that P = NP, with a claimed approach to solve 3-SAT in O(n^{extremely large number}) time, which appears implausible or humorous.

MIT professor Peter Shor gives advice to aspiring computer scientists in a throwback video shared by MIT_CSAIL.

This article provides a scan of Peter Henderson's 1982 paper on purely functional operating systems, which was previously hard to access online.

AI may be negatively impacting computer science graduates' job prospects in the UK, with data showing a significant decline in coding roles and employer demand, potentially driven by AI automation.

This paper explores the future possibilities of mechanized proofs, questioning whether truth can be futureproof in the context of automated theorem proving.

Google's Gemini AI has allegedly solved the P=NP problem, a major unsolved challenge in computational complexity theory.

Snap! is a broadly inviting programming language designed for both kids and adults, serving as a platform for serious computer science study.

An analysis of the 2048 game played on a 3x3 board, exploring algorithms and strategies for the smaller grid.

A preregistered study of 100 tertiary students shows that writing proficiency and computer-science achievement both predict performance in vibe-coding, with implications for curriculum design in AI-assisted programming.

The article argues that function arguments are not equivalent to function colors by introducing a change dependency graph criterion, distinguishing how changes propagate in async functions versus normal parameters.

The article explains that Python's dict and set data structures, often assumed to be O(1), can exhibit quadratic-time performance in scenarios involving hash collisions and memory hierarchy effects.

This article provides an educational exposition of the bitap string matching algorithm, deriving it from the naive method and explaining its elegance and efficiency for short patterns using bit operations.