Tag
Promotes a free book titled 'Data Structures & Algorithms using Python' covering all types of data structures from arrays to graphs.
Explores parallel algorithms for matching parentheses, a fundamental problem in compilers and text processing.
This paper presents RRB-Trees, a data structure for efficient immutable vectors, enabling logarithmic time concatenation and slicing.
Salvatore Sanfilippo reflects on his earlier prediction that RAG would fade while raw vector search remains valuable, now that the RAG hype has subsided.
A detailed historical and mathematical explanation of hash functions, from their invention by Arnold Dumey in 1956 as a memory indexing technique to modern cryptographic hashes, including Python implementations.
MIT's Advanced Data Structures course (6.851) by Prof. Erik Demaine is available fully online with video lectures and collaborative problem solving.
A blog post exploring the optimization of a ring buffer data structure for storing ping timestamps, discussing tagged unions, bitfields, and struct padding to reduce memory footprint.
This paper presents PivCo-Huffman, a new approach to Huffman coding using pivot coding from wavelet trees, enabling high-performance SIMD-friendly encoding and decoding. It consistently outperforms state-of-the-art Huffman codecs and shows how ANS coding can be selectively applied to skewed nodes to approach ANS compression ratios while preserving high decompression speeds.
Explains how Zig's comptime and type reflection enable creating struct-of-arrays (SoA) data structures like MultiArrayList, which improve cache performance in high-performance applications.
A popular GitHub project providing a comprehensive multi-month study plan for software engineering interviews, covering CS fundamentals, algorithms, system design, and resume tips.
Redis 8.8 is now available with a new array data structure, window counter rate limiter, subkey notifications for hash fields, multiple aggregators in time series queries, and significant performance improvements across various operations.
A technical blog post explaining the benefits of using stacks and queues over recursion for tree traversal, with code examples in Rust.
An exploration of the components and design decisions behind agent memory libraries, clarifying the gap between cognitive science terminology and engineering implementation.
An engineer created an interactive 680-page book on data structures and algorithms, available online.
The author describes replacing a 3 GB SQLite database with a 10 MB Finite State Transducer (FST) binary to optimize a Finnish-English dictionary tool, achieving a 300x reduction in memory usage while maintaining performance.
Hello Algorithm is an open-source tutorial on algorithms and data structures, featuring animated illustrations and implementations in multiple programming languages, suitable for self-study by beginners.