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.

Randomized algorithms is a technical book category focused on algorithms that use randomness as a fundamental tool to simplify design, improve performance, or provide probabilistic guarantees that are impossible or harder to achieve deterministically. Books in this genre cover core concepts such as Monte Carlo vs. Las Vegas methods, random sampling, hashing, random walks, probabilistic analysis and concentration inequalities, and common techniques for derandomization. They typically include applications like randomized data structures, streaming and sublinear algorithms, primality testing, randomized routing and load balancing, approximation algorithms, and elements of randomized optimization and learning. Intended for advanced undergraduates, graduate students, researchers and practitioners in computer science and applied mathematics, these texts balance theory (proofs of expected time, failure probability bounds) with practical considerations (implementation, parameter choices and empirical behavior). Overall the category emphasizes the power of chance to yield simple, fast, and robust algorithmic solutions where worst-case determinism is too costly.

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.