Seminar on Algorithmic Aspects of Information Theory

Computer science Mathematics

Audience:	Researchers in the discipline
Seminar series time:	Every other Wednesday 16:00-17:15 in your time zone, UTC
Organizer:	Andrei Romashchenko*
	*contact for this listing

This online seminar is a follow up of the Dagstuhl Seminar 22301, www.dagstuhl.de/en/program/calendar/semhp/?semnr=22301.

Upcoming talks

Past talks

Your time			Speaker	Title
Wed	Mar 05	16:00	Tobias BOEGE	On the Intersection and Composition properties for discrete random variables.

Embed this schedule

Your time			Speaker	Title
Wed	Feb 19	14:00	Qi CHEN	Matroidal entropy functions (Part 2)
Wed	Feb 12	14:00	Qi CHEN	Matroidal entropy functions (Part 1)
Wed	Jan 29	16:00	Alexander SHEN	Revisiting combinatorial applications of information inequalities.
Wed	Jan 15	16:00	Bryon ARAGAM	Learning compositional structure from data
Wed	Dec 11	16:00	Chandra NAIR and Chin Wa (Ken) LAU	Additive Combinatorics, Abelian Groups, and Entropic Inequalities.
Wed	Nov 20	15:00	Satyajit Thakor	The Constrained Entropy Vectors Characterization Problem.
Wed	Oct 23	15:00	Andrei Romashchenko	Information inequalities on graphs with a strong mixing property and their applications.
Wed	Jun 19	15:00	Milan Studený	Self-adhesivity in lattices of abstract conditional independence models.
Wed	Jun 05	15:00	Dan Suciu	Tight upper bounds on the number of homomorphic images of a hypergraph in another.
Wed	May 29	15:00	Tiago Pimentel	Revisiting the optimality of word lengths.
Wed	May 15	15:00	Lasse Harboe Wolff	TBA
Wed	Apr 24	14:00	Esther Galbrun	The minimum description length principle for pattern mining (MDL4PM).
Wed	Apr 10	15:00	Alexander Kozachinskiy	Information-theoretic methods in communication complexity.
Wed	Mar 13	16:00	Chao Tian	Computer-Aided Investigation of Information-Theoretic Limits: An Overview. (2nd part)
Wed	Feb 28	16:00	Chao Tian	Computer-Aided Investigation of Information-Theoretic Limits: An Overview.
Wed	Jan 31	10:00	Amin Gohari	Secret Key Generation from Dependent Source, part 2
Wed	Jan 24	10:00	Amin Gohari	Secret Key Generation from Dependent Source, part 1
Wed	Dec 06	16:00	Marius Zimand	Lossless expanders and Information Reconciliation with no shared randomness.
Wed	Nov 22	16:00	Mokshay Madiman	Analogies between entropy, volume, and cardinality inequalities for projections.
Wed	Nov 08	16:00	Batya Kenig	Approximate Implication for Probabilistic Graphical Models.
Wed	Oct 25	15:00	Alexander Shen	Information theoretic proofs (a survey).
Wed	Oct 11	15:00	LI Cheuk Ting	Functional Representation Lemma and Minimum Entropy Coupling
Wed	Sep 27	15:00	Andrei Romashchenko	On the common information and the Ahlswede-Körner lemma in one-shot settings.
Wed	Sep 13	15:00	Laszlo Csirmaz	The power of non-Shannon inequalities: a short proof of the Gács-Körner theorem.
Wed	Jun 21	15:00	Alexander V. Smal	Information theoretic approach to Boolean formula complexity.
Wed	Jun 07	15:00	Mahmoud Abo Khamis	The Polymatroid Bound: Extensions and Applications in Database Query Evaluation (part 2).
Wed	May 24	15:00	Mahmoud Abo Khamis	The Polymatroid Bound: Extensions and Applications in Database Query Evaluation.
Wed	May 10	14:00	Raymond W. Yeung	Entropy Inequalities: My Personal Journey.
Wed	Apr 26	15:00	Hung Q. Ngo	An Information Theoretic Approach to Estimating Query Size Bounds.
Wed	Apr 12	15:00	Tianren Liu	Barriers for Secret Sharing.
Wed	Mar 29	15:00	Carles Padro	Lower Bounds in Secret Sharing from Information Theory.
Wed	Mar 22	16:00	Oriol Farràs	Introduction to Secret Sharing Schemes: Constructions
Wed	Mar 15	16:00	Vlad Demartsev	Economy of vocal repertoires: Zipf's laws in animal communication
Wed	Mar 01	16:00	Milan Studeny	On conditional Ingleton inequalities
Wed	Feb 15	16:00	Andrei Romashchenko	Quasi-uniform distributions and the method of random covers.
Wed	Feb 01	16:00	Alexander Kozachinskiy	On the recent progress on Frankl's conjecture.
Wed	Jan 18	16:00	Cheuk Ting LI	Existential information inequalities, non-Shannon inequalities, and automated theorem proving.
Wed	Jan 04	16:00	Frederique Oggier	An overview of Ingleton's inequality from a group theory point of view.
Wed	Dec 07	16:00	Alexander Shen	Information inequalities: combinatorial interpretation
Wed	Nov 23	16:00	Laszlo Csirmaz	The entropy region is not polyhedra.
Wed	Nov 09	16:00	Andrei Romashchenko	The Zhang-Yeung inequality: an attempt to explain.
Wed	Oct 26	15:00	Andrei Romashchenko	Basic proof techniques for entropic inequalities.
Wed	Oct 12	15:00	Laszlo Csirmaz	Around entropy inequalities.

Embed this schedule

Export series to