This book constitutes the refereed proceedings of the 11th International Workshop on Arithmetic of Finite Fields, WAIFI 2026, held in Santander, Spain, during June 3–5, 2026.
This clearly structured textbook/reference presents a detailed and comprehensive review of the fundamental principles of sequential graph algorithms, approaches for NP-hard graph problems, approximation algorithms and heuristics for such problems and implementation of advanced graph structures in machine learning.
This clearly structured textbook/reference presents a detailed and comprehensive review of the fundamental principles of sequential graph algorithms, approaches for NP-hard graph problems, approximation algorithms and heuristics for such problems and implementation of advanced graph structures in machine learning.
Build data-grounded AI applications with LlamaIndex through hands-on examples covering RAG pipelines, agentic workflows, multi-agent systems, prompt engineering, evaluation, and deployment with Python and Streamlit.
Build data-grounded AI applications with LlamaIndex through hands-on examples covering RAG pipelines, agentic workflows, multi-agent systems, prompt engineering, evaluation, and deployment with Python and Streamlit.
This book constitutes the refereed proceedings of the 14th International Conference on Health Information Science, HIS 2025, held in Bandung, Indonesia, during December 2–4, 2025.
This book constitutes the refereed proceedings of the 14th International Conference on Health Information Science, HIS 2025, held in Bandung, Indonesia, during December 2–4, 2025.
This book constitutes the proceedings of the 4th International Workshop on Explainable Artificial Intelligence in Healthcare, XAI-Healthcare 2025, and the Second International Workshop on Process Mining Applications for Healthcare, PM4H 2025, held in Pavia, Italy, during June 26, 2025.
This book constitutes the proceedings of the 4th International Workshop on Explainable Artificial Intelligence in Healthcare, XAI-Healthcare 2025, and the Second International Workshop on Process Mining Applications for Healthcare, PM4H 2025, held in Pavia, Italy, during June 26, 2025.
First developed in the early 1980s by Lenstra, Lenstra, and Lovasz, the LLL algorithm was originally used to provide a polynomial-time algorithm for factoring polynomials with rational coefficients.
Through examples and analogies, Computational Thinking for the Modern Problem Solver introduces computational thinking as part of an introductory computing course and shows how computer science concepts are applicable to other fields.
Illustrating the effect of concurrency on programs written in familiar languages, this text focuses on novel language abstractions that truly bring concurrency into the language and aid analysis and compilation tools in generating efficient, correct programs.
Based on the author's introductory course at the University of Oregon, Explorations in Computing: An Introduction to Computer Science focuses on the fundamental idea of computation and offers insight into how computation is used to solve a variety of interesting and important real-world problems.
This book explores the profound transformations brought about by the datafication of society, and reflects on the implications this has for activism, social movements, and contentious politics.
Grid computing, a computing infrastructure that combines computer resources spread over different geographical locations to achieve a common goal, is seen as an efficient solution to solve complex real-world computer problems in a shorter time.
Grid computing, a computing infrastructure that combines computer resources spread over different geographical locations to achieve a common goal, is seen as an efficient solution to solve complex real-world computer problems in a shorter time.
This combinatorics text provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries.
This book explores the profound transformations brought about by the datafication of society, and reflects on the implications this has for activism, social movements, and contentious politics.
With their ability to solve problems in massive information distribution and processing, while keeping scaling costs low, overlay systems represent a rapidly growing area of R&D with important implications for the evolution of Internet architecture.
Dedicated to Arto Salomaa, a towering figure of theoretical computer science, on the occasion of his 65th birthday, this book is a tribute to him on behalf of the theoretical computer science community.
Research into Fully Integrated Data Environments (FIDE) has the goal of substantially improving the quality of application systems while reducing the cost of building and maintaining them.
Die Sicherheit einer IT-Komponente hängt meist direkt von einer oder mehreren anderen Komponenten ab, wobei diese Abhängigkeiten komplex und schwer erfassbar sind.
In the setting of multiparty computation, sets of two or more parties with p- vate inputs wish to jointly compute some (predetermined) function of their inputs.
Locally decodable codes (LDCs) are codes that simultaneously provide efficient random access retrieval and high noise resilience by allowing reliable reconstruction of an arbitrary bit of a message by looking at only a small number of randomly chosen codeword bits.
As the most comprehensive reference work dealing with knowledge management (KM), this work is essential for the library of every KM practitioner, researcher, and educator.
From the author of The Music of the Primes and Finding Moonshine comes a short, lively book on five mathematical problems that just refuse be solved - and on how many everyday problems can be solved by maths.
This monograph is driven by the ambition to thoroughly investigate and advance the field of discrete-time sliding mode design based on difference equations with minima for dynamical systems.
This monograph is driven by the ambition to thoroughly investigate and advance the field of discrete-time sliding mode design based on difference equations with minima for dynamical systems.
