2016 - T1 - WS3 - Central workshop

Collection 2016 - T1 - WS3 - Central workshop

Organisateur(s) Braverman, Mark ; Nazer, Bobak ; Rao, Anup ; Tchamkerten, Aslan

Date(s) 29/02/2016 - 04/03/2016

URL associée https://web.archive.org/web/20221228152147/http://iss.bu.edu/bobak/csnexus//workshopabout.html

00:00:00 / 00:00:00

2 20

Combinatorial Structures for Distributed Computing Models

De Petr Kuznetsov

The main complication in the analysis of distributed systems is the immense diversity of distributed computing models, combined with the lack of mathematical tools to handle this complexity. In this talk, we discuss how to characterize the computability power of a large class of models via properties of the corresponding simplicial complexes, combinatorial structures capturing representative sets of model executions.

Informations sur la vidéo

Date de captation 03/03/2016
Date de publication 14/03/2016
Institut IHP
Licence CC BY-NC-ND
Format MP4

Domaine(s)

Codes MSC

Dernières questions liées sur MathOverflow

Pour poser une question, votre compte Carmin.tv doit être connecté à mathoverflow

Poser une question sur MathOverflow

Toutes les vidéos de la collection

38:17

publiée le 14 mars 2016

Reliable communication in the presence of limited adversaires

De Sidharth Jaggi

43:52

publiée le 14 mars 2016

Combinatorial Structures for Distributed Computing Models

De Petr Kuznetsov

34:49

publiée le 14 mars 2016

Algorithmic Aspects of Optimal Channel Coding

De Omar Fawzi

34:39

publiée le 14 mars 2016

Zero-error capacity for multiuser channels

De Ofer Shayevitz

36:50

publiée le 14 mars 2016

Information-Theoretic Lower Bounds for Distributed Function Computation

De Maxim Raginsky

38:48

publiée le 14 mars 2016

Sketching as a Tool for Numerical Linear Algebra and Recent Developments

De David Woodruff

35:42

publiée le 14 mars 2016

Communication Lower Bounds for Statistical Estimation Problems via a Distributed Data Processing Inequality

De Ankit Garg

36:54

publiée le 14 mars 2016

Constant-rate coding for multiparty interactive communication is impossible

De Ran Gelles

33:16

publiée le 14 mars 2016

Geometric stability via information theory

De Amir Yehudayoff

37:37

publiée le 14 mars 2016

How can we separate Information and Communication complexity?

De Iordanis Kerenidis

33:13

publiée le 14 mars 2016

Improving on the cutset bound via a measure concentration

De Ayfer Özgür

37:11

publiée le 14 mars 2016

Learning to detect an oddball target

De Rajesh Sundaresan

34:48

publiée le 14 mars 2016

Reliable Deniable Communication : hiding messages in Noise

De Sidharth Jaggi

36:15

publiée le 14 mars 2016

Reduction for Information Theory

De Michelle Effros

47:16

publiée le 14 mars 2016

An Operational Measure of Information Leakage

De Aaron Wagner

38:51

publiée le 14 mars 2016

Information Theory: Old and New - A Personal View

De Shlomo Shamai

24:27

publiée le 14 mars 2016

The information theoretic lower bound for comparison based sorting is (almost) tight, even when there is an arbitrary known distribution on the input array

De Shay Moran

42:28

publiée le 14 mars 2016

Resilient control of dynamic flow networksGiacomo Como (Lund University)

De Giacomo Como

29:06

publiée le 14 mars 2016

Asymmetry of online Kolmogorov complexity

De Bruno Bauwens

34:03

publiée le 14 mars 2016

Streaming Symmetric Norms via Measure Concentration

De Stephen Chestnut

Copyright Carmin.tv 2025

Donner son avis