You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This collection of high-quality articles in the field of combinatorics, geometry, algebraic topology and theoretical computer science is a tribute to Jiří Matoušek, who passed away prematurely in March 2015. It is a collaborative effort by his colleagues and friends, who have paid particular attention to clarity of exposition – something Jirka would have approved of. The original research articles, surveys and expository articles, written by leading experts in their respective fields, map Jiří Matoušek’s numerous areas of mathematical interest.
Annotation This book constitutes the refereed proceedings of the 32nd International Colloquium on Automata, Languages and Programming, ICALP 2005, held in Lisbon, Portugal in July 2005. The 113 revised full papers presented together with abstracts of 5 invited talks were carefully reviewed and selected from 407 submissions. The papers address all current issues in theoretical computer science and are organized in topical sections on data structures, cryptography and complexity, cryptography and distributed systems, graph algorithms, security mechanisms, automata and formal languages, signature and message authentication, algorithmic game theory, automata and logic, computational algebra, cache-oblivious algorithms and algorithmic engineering, on-line algorithms, security protocols logic, random graphs, concurrency, encryption and related primitives, approximation algorithms, games, lower bounds, probability, algebraic computation and communication complexity, string matching and computational biology, quantum complexity, analysis and verification, geometry and load balancing, concrete complexity and codes, and model theory and model checking.
Understanding the behavior of basic sampling techniques and intrinsic geometric attributes of data is an invaluable skill that is in high demand for both graduate students and researchers in mathematics, machine learning, and theoretical computer science. The last ten years have seen significant progress in this area, with many open problems having been resolved during this time. These include optimal lower bounds for epsilon-nets for many geometric set systems, the use of shallow-cell complexity to unify proofs, simpler and more efficient algorithms, and the use of epsilon-approximations for construction of coresets, to name a few. This book presents a thorough treatment of these probabilistic, combinatorial, and geometric methods, as well as their combinatorial and algorithmic applications. It also revisits classical results, but with new and more elegant proofs. While mathematical maturity will certainly help in appreciating the ideas presented here, only a basic familiarity with discrete mathematics, probability, and combinatorics is required to understand the material.
A fundamental question in the theory of discrete and continuous-time population models concerns the conditions for the extinction or persistence of populations – a question that is addressed mathematically by persistence theory. For some time, it has been recognized that if the dynamics of a structured population are mathematically captured by continuous or discrete semiflows and if these semiflows have first-order approximations, the spectral radii of certain bounded linear positive operators (better known as basic reproduction numbers) act as thresholds between population extinction and persistence. This book combines the theory of discrete-time dynamical systems with applications to pop...
Given points in the plane, connect them using minimum ink. Though the task seems simple, it turns out to be very time consuming. In fact, scientists believe that computers cannot efficiently solve it. So, do we have to resign? This book examines such NP-hard network-design problems, from connectivity problems in graphs to polygonal drawing problems on the plane. First, we observe why it is so hard to optimally solve these problems. Then, we go over to attack them anyway. We develop fast algorithms that find approximate solutions that are very close to the optimal ones. Hence, connecting points with slightly more ink is not hard.
A unified framework for developing planning and control algorithms for active sensing, with examples of applications for specific sensor technologies. Active sensor systems, increasingly deployed in such applications as unmanned vehicles, mobile robots, and environmental monitoring, are characterized by a high degree of autonomy, reconfigurability, and redundancy. This book is the first to offer a unified framework for the development of planning and control algorithms for active sensing, with examples of applications for a range of specific sensor technologies. The methods presented can be characterized as information-driven because their goal is to optimize the value of information, rather than to optimize traditional guidance and navigation objectives.
This book constitutes the refereed proceedings of the 9th Scandinavian Workshop on Algorithm Theory, SWAT 2004, held in Humlebaek, Denmark in July 2004. The 40 revised full papers presented together with an invited paper and the abstract of an invited talk were carefully reviewed and selected from 121 submissions. The papers span the entire range of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, bioinformatics, combinatorics, sorting, searching, online algorithms, optimization, etc.
One of the earliest dreams of the fledgling field of artificial intelligence (AI) was to build computer programs that could play games as well as or better than the best human players. Despite early optimism in the field, the challenge proved to be surprisingly difficult. However, the 1990s saw amazing progress. Computers are now better than humans in checkers, Othello and Scrabble; are at least as good as the best humans in backgammon and chess; and are rapidly improving at hex, go, poker, and shogi. This book documents the progress made in computers playing games and puzzles. The book is the definitive source for material of high-performance game-playing programs.
This book is the third of a three-volume set of books on the theory of algebras, a study that provides a consistent framework for understanding algebraic systems, including groups, rings, modules, semigroups and lattices. Volume I, first published in the 1980s, built the foundations of the theory and is considered to be a classic in this field. The long-awaited volumes II and III are now available. Taken together, the three volumes provide a comprehensive picture of the state of art in general algebra today, and serve as a valuable resource for anyone working in the general theory of algebraic systems or in related fields. The two new volumes are arranged around six themes first introduced in Volume I. Volume II covers the Classification of Varieties, Equational Logic, and Rudiments of Model Theory, and Volume III covers Finite Algebras and their Clones, Abstract Clone Theory, and the Commutator. These topics are presented in six chapters with independent expositions, but are linked by themes and motifs that run through all three volumes.
It is well known that if two independent identically distributed random variables are Gaussian, then their sum and difference are also independent. It turns out that only Gaussian random variables have such property. This statement, known as the famous Kac-Bernstein theorem, is a typical example of a so-called characterization theorem. Characterization theorems in mathematical statistics are statements in which the description of possible distributions of random variables follows from properties of some functions of these random variables. The first results in this area are associated with famous 20th century mathematicians such as G. Pólya, M. Kac, S. N. Bernstein, and Yu. V. Linnik. By no...