Club utilise des cookies et des technologies similaires pour faire fonctionner correctement le site web et vous fournir une meilleure expérience de navigation.
Ci-dessous vous pouvez choisir quels cookies vous souhaitez modifier :
Club utilise des cookies et des technologies similaires pour faire fonctionner correctement le site web et vous fournir une meilleure expérience de navigation.
Nous utilisons des cookies dans le but suivant :
Assurer le bon fonctionnement du site web, améliorer la sécurité et prévenir la fraude
Avoir un aperçu de l'utilisation du site web, afin d'améliorer son contenu et ses fonctionnalités
Pouvoir vous montrer les publicités les plus pertinentes sur des plateformes externes
Gestion des cookies
Club utilise des cookies et des technologies similaires pour faire fonctionner correctement le site web et vous fournir une meilleure expérience de navigation.
Ci-dessous vous pouvez choisir quels cookies vous souhaitez modifier :
Cookies techniques et fonctionnels
Ces cookies sont indispensables au bon fonctionnement du site internet et vous permettent par exemple de vous connecter. Vous ne pouvez pas désactiver ces cookies.
Cookies analytiques
Ces cookies collectent des informations anonymes sur l'utilisation de notre site web. De cette façon, nous pouvons mieux adapter le site web aux besoins des utilisateurs.
Cookies marketing
Ces cookies partagent votre comportement sur notre site web avec des parties externes, afin que vous puissiez voir des publicités plus pertinentes de Club sur des plateformes externes.
Une erreur est survenue, veuillez réessayer plus tard.
Il y a trop d’articles dans votre panier
Vous pouvez encoder maximum 250 articles dans votre panier en une fois. Supprimez certains articles de votre panier ou divisez votre commande en plusieurs commandes.
Coding for interactive communication augments coding theory to the interactive setting: instead of communicating a message from a sender to a receiver...Savoir plus
Polynomials are perhaps the most important family of functions in mathematics. They feature in celebrated results from both antiquity and modern times...Savoir plus
Sketching as a Tool for Numerical Linear Algebra highlights the recent advances in algorithms for numerical linear algebra that have come from the tec...Savoir plus
This self-contained tutorial presents a unified treatment of single- and multi-user problems in Shannon's information theory considering in particular...Savoir plus
Spectral methods refer to the use of eigenvalues, eigenvectors, singular values and singular vectors. They are widely used in Engineering, Applied Mat...Savoir plus
Communication Complexity (for Algorithm Designers) collects the lecture notes from the author's eponymous course taught at Stanford in the winter quar...Savoir plus
While rapid progress has been made on upper bounds (algorithms), progress on lower bounds on the complexity of explicit problems has remained slow des...Savoir plus
An interactive proof system is called doubly-efficient if the prescribed prover strategy can be implemented in polynomial-time and the verifier's stra...Savoir plus
A large class of problems in symbolic computation can be expressed as the task of computing some polynomials; and arithmetic circuits form the most st...Savoir plus
In the age of Big Data, efficient algorithms are in higher demand more than ever before. While Big Data takes us into the asymptotic world envisioned ...Savoir plus
The Design of Competitive Online Algorithms via a Primal-Dual Approach extends the primal-dual method to the setting of online algorithms, and shows i...Savoir plus
In the thirty years since its inception, communication complexity has become a vital area of theoretical computer science. The applicability of commun...Savoir plus
The problem of privacy-preserving data analysis has a long history spanning multiple disciplines. As electronic data about individuals becomes increas...Savoir plus
Algorithmic Results in List Decoding introduces and motivates the problem of list decoding, and discusses the central algorithmic results of the subje...Savoir plus
Various types of probabilistic proof systems have played a central role in the development of computer science in the last couple of decades. These pr...Savoir plus
Systems wherein strategic agents compete for limited resources are ubiquitous. For example, the economy, computer networks, social networks, congestio...Savoir plus
This monograph comprises a series of ten lectures divided into two parts. Part 1, referred to as the Solar Lectures, focuses on the communication and ...Savoir plus
Provides an introduction to the analytical aspects of the theory of finite Markov chain mixing times and explains its developments. This book looks at...Savoir plus
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communicatio...Savoir plus
Incidence theorems describe the way lines, points and other geometric objects intersect each other. Theorems of this sort have found a large number of...Savoir plus
Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn as the foundation for secure cryptographic systems. Attract...Savoir plus
The ability to solve a system of linear equations lies at the heart of areas like optimization, scientific computing, and computer science and has tra...Savoir plus
Faster Algorithms via Approximation Theory illustrates how classical and modern techniques from approximation theory play a crucial role in obtaining ...Savoir plus
Higher-order Fourier Analysis and Applications provides an introduction to the field of higher-order Fourier analysis with an emphasis on its applicat...Savoir plus