July 24 – 29 , 2022, Dagstuhl Seminar 22301

Algorithmic Aspects of Information Theory


Phokion G. Kolaitis (University of California – Santa Cruz, US & IBM Research, US)
Andrei Romashchenko (University of Montpellier – LIRMM, FR & CNRS, FR)
Milan Studený (The Czech Academy of Sciences – Prague, CZ)
Dan Suciu (University of Washington – Seattle, US)

For support, please contact

Susanne Bach-Bernhard for administrative matters

Michael Gerke for scientific matters


List of Participants
Shared Documents
Dagstuhl Seminar Schedule [pdf]


Constraints on entropies constitute the “laws of information theory”. These constraints go well beyond Shannon’s basic information inequalities, as they include not only information inequalities that cannot be derived from Shannon’s basic inequalities, but also conditional inequalities and disjunctive inequalities that are valid for all entropic functions. By now, there is an extensive body of research on constraints on entropies and their applications to different areas of mathematics and computer science. So far, however, little progress has been made on the algorithmic aspects of information theory. In fact, even fundamental questions about the decidability of information inequalities and their variants remain open to date.

Recently, research in different applications has demonstrated a clear need for algorithmic solutions to questions in information theory. These applications include: finding tight upper bounds on the answer to a query on a relational database, the homomorphism domination problem and its uses in query optimization, the conditional independence implication problem, soft constraints in databases, group-theoretic inequalities, and lower bounds on the information ratio in secret sharing. Thus far, the information-theory community has had little interaction with the communities where these applications have been studied or with the computational complexity community. The main goal of this Dagstuhl Seminar is to bring together researchers from the aforementioned communities and to develop an agenda for studying algorithmic aspects of information theory, motivated from a rich set of diverse applications. By using the algorithmic lens to examine the common problems and by transferring techniques from one community to the other, we expect that bridges will be created and some tangible progress on open questions may be made.

In addition to tutorials and talks, there will be ample time for discussions, informal interactions, and open problem sessions aiming to produce a comprehensive list of problems in algorithmic aspects of information theory.

Motivation text license
  Creative Commons BY 4.0
  Phokion G. Kolaitis, Andrej E. Romashchenko, Milan Studeny, and Dan Suciu


  • Computational Complexity
  • Databases
  • Information Theory


  • Information theory
  • Information inequalities
  • Conditional independence structures
  • Database query evaluation and containment
  • Decision problems


In the series Dagstuhl Reports each Dagstuhl Seminar and Dagstuhl Perspectives Workshop is documented. The seminar organizers, in cooperation with the collector, prepare a report that includes contributions from the participants' talks together with a summary of the seminar.


Download overview leaflet (PDF).

Dagstuhl's Impact

Please inform us when a publication was published as a result from your seminar. These publications are listed in the category Dagstuhl's Impact and are presented on a special shelf on the ground floor of the library.


Furthermore, a comprehensive peer-reviewed collection of research papers can be published in the series Dagstuhl Follow-Ups.