Collection Nexus Trimester - 2016 - Distributed Computation and Communication Theme
Apparaît dans la collection : 2016 - T1 - Nexus of Information and Computation Theory
Mathématiques
et Interactions
-
Toutes les vidéos de la collection (42)
![High Probability Guarantees in Repeated Games: Theory and Applications in Information Theory]()
48:45publiée le 25 février 2016High Probability Guarantees in Repeated Games: Theory and Applications in Information Theory
De Amin Aminzadeh Gohari
![Relation between monotonic complexity and algorithmic probability (2)]()
51:31publiée le 25 février 2016Relation between monotonic complexity and algorithmic probability (2)
De Péter Gács
![On the Ultimate Limit of Two-Terminal Interactive Computing]()
58:20publiée le 25 février 2016On the Ultimate Limit of Two-Terminal Interactive Computing
De Prakash Ishwar
![Worst-Case Optimal Algorithms for Parallel Query Processing]()
53:23publiée le 25 février 2016Worst-Case Optimal Algorithms for Parallel Query Processing
De Paris Koutris
![Lower bounds for coding for multiparty interactive communication (2)]()
49:29publiée le 25 février 2016Lower bounds for coding for multiparty interactive communication (2)
De Klim Efremenko
![Lower bounds for coding for multiparty interactive communication (1)]()
52:43publiée le 25 février 2016Lower bounds for coding for multiparty interactive communication (1)
De Klim Efremenko
![Strong Data Processing and the Entropy Power Inequality]()
53:30publiée le 25 février 2016Strong Data Processing and the Entropy Power Inequality
De Thomas Courtade
![Exponential separation of information and communication, and how to prove lower bounds on disjointness, and the non-negative rank of matrices (2)]()
54:02publiée le 25 février 2016Exponential separation of information and communication, and how to prove lower bounds on disjointness, and the non-negative rank of matrices (2)
De Anup Rao
![Exponential separation of information and communication, and how to prove lower bounds on disjointness, and the non-negative rank of matrices (1)]()
56:46publiée le 25 février 2016Exponential separation of information and communication, and how to prove lower bounds on disjointness, and the non-negative rank of matrices (1)
De Anup Rao
![Confidence sharing: an economic strategy for efficient information flows in animal groups]()
42:00publiée le 25 février 2016Confidence sharing: an economic strategy for efficient information flows in animal groups
De Amos Korman
![Interactive Information Complexity and Applications : Interactive Compression - Part II]()
56:45publiée le 25 février 2016Interactive Information Complexity and Applications : Interactive Compression - Part II
De Omri Weinstein
![Secure and Reliable Codes for Cooperative Data Exchange]()
43:33publiée le 25 février 2016Secure and Reliable Codes for Cooperative Data Exchange
De Alex Sprintson
![Interactive Information Complexity and Applications : Interactive Compression - Part I/2]()
01:12:42publiée le 25 février 2016Interactive Information Complexity and Applications : Interactive Compression - Part I/2
De Omri Weinstein
![Interactive Information Complexity and Applications : Interactive Compression - Part I/1]()
49:36publiée le 25 février 2016Interactive Information Complexity and Applications : Interactive Compression - Part I/1
De Omri Weinstein
![Lower Bounds for Distributed Graph Problems via Information Theory]()
50:40publiée le 25 février 2016Lower Bounds for Distributed Graph Problems via Information Theory
De Stephan Sebastian Holzer
![Tensorization of information functionals (Part II): Applications in establishing optimality of Gaussian distributions and in a Boolean function Conjecture]()
51:22publiée le 25 février 2016Tensorization of information functionals (Part II): Applications in establishing optimality of Gaussian distributions and in a Boolean function Conjecture
De Chandra Nair
![Exponential separation of information and communication, and how to prove lower bounds on disjointness, and the non-negative rank of matrices (3)]()
55:16publiée le 25 février 2016Exponential separation of information and communication, and how to prove lower bounds on disjointness, and the non-negative rank of matrices (3)
De Anup Rao
![Some Some Information-Theoretic Problems in Theoretical Computer Science - Part II]()
55:41publiée le 25 février 2016Some Some Information-Theoretic Problems in Theoretical Computer Science - Part II
De Omri Weinstein
![Tensorization of information functionals (Part I): Forward and Reverse hypercontractivity using information measures]()
46:30publiée le 25 février 2016Tensorization of information functionals (Part I): Forward and Reverse hypercontractivity using information measures
De Chandra Nair
![Relation between monotonic complexity and algorithmic probability (1)]()
50:40publiée le 3 février 2016Relation between monotonic complexity and algorithmic probability (1)
De Péter Gács
![Distributed compression- the algorithmic-information-theoretical view]()
01:01:54publiée le 3 février 2016Distributed compression- the algorithmic-information-theoretical view
De Marius Zimand
![On Parallels Between Shannon’s and Kolmogorov’s Information Theories (where the parallelism fails and why)]()
56:14publiée le 2 février 2016On Parallels Between Shannon’s and Kolmogorov’s Information Theories (where the parallelism fails and why)
De Andrei Romashchenko
![Different versions of Kolmogorov complexity and a priori probability: a gentle introduction (2)]()
51:36publiée le 1 février 2016Different versions of Kolmogorov complexity and a priori probability: a gentle introduction (2)
De Alexander Shen
![Different versions of Kolmogorov complexity and a priori probability: a gentle introduction (1)]()
01:02:20publiée le 1 février 2016Different versions of Kolmogorov complexity and a priori probability: a gentle introduction (1)
De Alexander Shen
-
Suggestions
![Approximating entropy/pressure for multidimensional shifts of finite type]()
01:06:21publiée le 29 avril 2024Approximating entropy/pressure for multidimensional shifts of finite type
De Ronnie Pavlov
![SageMath: research and experimentation in Combinatorics - Lecture 1]()
01:18:01publiée le 8 avril 2024SageMath: research and experimentation in Combinatorics - Lecture 1
De Viviane Pons
-
Les plus vues
![Statistical estimation of optimal transport potentials]()
50:58publiée le 6 mai 2024Statistical estimation of optimal transport potentials
De François-Xavier Vialard
![An Algorithmic Solution to the Blotto Game using Multi-marginal Couplings]()
36:10publiée le 6 mai 2024An Algorithmic Solution to the Blotto Game using Multi-marginal Couplings
De Thibaut Le Gouic
![Barycenters for probability distributions based on optimal weak mass transport]()
46:05publiée le 6 mai 2024Barycenters for probability distributions based on optimal weak mass transport
De Elsa Cazelles
![Structured prediction with sparse Wasserstein barycenters]()
48:32publiée le 6 mai 2024Structured prediction with sparse Wasserstein barycenters
De Olga Mula Hernandez
