Collection Nexus Trimester - 2016 - Central Workshop
Appears in collection : 2016 - T1 - Nexus of Information and Computation Theory
Mathematics
and Interactions
-
All the collection videos (20)
![Reliable communication in the presence of limited adversaires]()
38:17published on March 14, 2016Reliable communication in the presence of limited adversaires
By Sidharth Jaggi
![Combinatorial Structures for Distributed Computing Models]()
43:52published on March 14, 2016Combinatorial Structures for Distributed Computing Models
By Petr Kuznetsov
![Information-Theoretic Lower Bounds for Distributed Function Computation]()
36:50published on March 14, 2016Information-Theoretic Lower Bounds for Distributed Function Computation
By Maxim Raginsky
![Sketching as a Tool for Numerical Linear Algebra and Recent Developments]()
38:48published on March 14, 2016Sketching as a Tool for Numerical Linear Algebra and Recent Developments
By David Woodruff
![Communication Lower Bounds for Statistical Estimation Problems via a Distributed Data Processing Inequality]()
35:42published on March 14, 2016Communication Lower Bounds for Statistical Estimation Problems via a Distributed Data Processing Inequality
By Ankit Garg
![Constant-rate coding for multiparty interactive communication is impossible]()
36:54published on March 14, 2016Constant-rate coding for multiparty interactive communication is impossible
By Ran Gelles
![How can we separate Information and Communication complexity?]()
37:37published on March 14, 2016How can we separate Information and Communication complexity?
By Iordanis Kerenidis
![Improving on the cutset bound via a measure concentration]()
33:13published on March 14, 2016Improving on the cutset bound via a measure concentration
By Ayfer Özgür
![Reliable Deniable Communication : hiding messages in Noise]()
34:48published on March 14, 2016Reliable Deniable Communication : hiding messages in Noise
By Sidharth Jaggi
![The information theoretic lower bound for comparison based sorting is (almost) tight, even when there is an arbitrary known distribution on the input array]()
24:27published on March 14, 2016The information theoretic lower bound for comparison based sorting is (almost) tight, even when there is an arbitrary known distribution on the input array
By Shay Moran
![Resilient control of dynamic flow networksGiacomo Como (Lund University)]()
42:28published on March 14, 2016Resilient control of dynamic flow networksGiacomo Como (Lund University)
By Giacomo Como
-
Suggestions
![Topological Symmetry and Duality in Quantum Lattice Models (¼)]()
01:50:25published on April 17, 2024Topological Symmetry and Duality in Quantum Lattice Models (¼)
By Clément Delcamp
![SageMath: research and experimentation in Combinatorics - Lecture 1]()
01:18:01published on April 8, 2024SageMath: research and experimentation in Combinatorics - Lecture 1
By Viviane Pons
![SageMath: research and experimentation in Combinatorics - Lecture 2]()
01:16:14published on March 29, 2024SageMath: research and experimentation in Combinatorics - Lecture 2
By Viviane Pons
![Compacted binary trees, stretched exponential and asymptotic behavior of recurrences]()
01:08:15published on March 29, 2024Compacted binary trees, stretched exponential and asymptotic behavior of recurrences
By Wenjie Fang
-
Most seen
![Beauty of Life seen through Keyhole of Mathematics (4/4)]()
02:09:55published on April 16, 2024Beauty of Life seen through Keyhole of Mathematics (4/4)
By Misha Gromov
![Lipschitz-Killing curvatures of excursion sets for two dimensional random fields]()
published on April 18, 2024Lipschitz-Killing curvatures of excursion sets for two dimensional random fields
By Céline Duval
![Cohomology of real algebraic varieties and sums of squares]()
published on April 15, 2024Cohomology of real algebraic varieties and sums of squares
By Olivier Benoist
![Imaginary Liouville conformal field theory]()
