Dennis Shasha Book order

This book deals with the problem of computing the editing distance between trees, which is a measure of their structural similarity. It covers the theoretical foundations of tree editing, algorithms for tree comparison, and applications of tree distance to pattern recognition, computational biology, and other areas of computer science.

Shasha and Lanin's groundbreaking research on concurrent B-tree algorithms remains the gold standard in the field. This book presents their revolutionary approach in a clear and accessible manner, making it an essential reference for computer scientists and software engineers.

Iraq's Last Jews is a collection of first-person accounts by Jews about their lives in Iraq's once-vibrant, 2500 year-old Jewish community and about the disappearance of that community in the middle of the 20th century. číst celé

Dr. Ecco, a brilliant mathematical detective, employs logic and programming to tackle fascinating cases such as "The Virus from the Spy" and "The Secrets of Space." This collection features thirty-six illustrated mysteries centered around eight mathematical themes, including Combinatorial Geometry and Ciphers. Designed for those with only basic arithmetic and algebra skills, the book invites readers to engage their curiosity and intelligence, using both their minds and computers to solve intriguing puzzles and expand their knowledge.

Time-series data, which arrives in a sequential order, is prevalent in various fields such as physics, finance, music, networking, and medical instrumentation. Developing fast, scalable algorithms for analyzing single or multiple time series can facilitate scientific discoveries, medical diagnoses, and potential profits. This work introduces rapid-discovery techniques for identifying segments of time series with numerous events, as well as for detecting closely related time series. Unlike typical methods that focus on predicting future points through regression analysis, the emphasis here is on efficient discovery within time series, showcasing novel algorithmic contributions alongside practical algorithms and case studies. It requires only a basic understanding of calculus and some linear algebra. Key features include algorithms for uncovering unusual activity bursts in large databases, exploring correlation relationships among extensive time series, and adapting techniques for individual needs. Additionally, it covers algorithms for query by humming, gamma-ray burst detection, pairs trading, and density detection, along with self-contained descriptions of wavelets and fast Fourier transforms. This monograph serves as a comprehensive resource for computer scientists, physicists, medical researchers, financial mathematicians, musicologists, and graduate students in data-rich fields.