Get personalized book recommendations based on your reading history and preferences. Our algorithm analyzes your favorite books and reading patterns to suggest your next great read.

"Persistent data structures" as a book category covers the theory, design, and implementation of data structures that preserve previous versions after updates—ranging from partially persistent (read old versions) to fully persistent (branching updates) and ephemeral-to-persistent transformations. Titles in this category explain core techniques (path copying, fat nodes, node sharing), complexity trade-offs in time and space, and formal foundations from functional programming and algorithmic theory, while also presenting practical implementations, performance engineering, and real-world applications such as version control, undo/redo, temporal databases, and concurrent systems. Books may be aimed at students and researchers seeking proofs and models, or at software engineers looking for patterns, code examples, and case studies for applying persistence in modern languages and systems.

Filter books by their publication year. Enter the earliest year (Start) and latest year (End) to find books published within that period. Leave either field empty to search from the beginning of time or up to the present day.