November 27 – December 2 , 2022, Dagstuhl Seminar 22482

Counting and Sampling: Algorithms and Complexity


Holger Dell (Goethe-Universität – Frankfurt am Main, DE)
Mark R. Jerrum (Queen Mary University of London, GB)
Haiko Müller (University of Leeds, GB)

For support, please contact

Dagstuhl Service Team

Dagstuhl Seminar Series


  • Computational Complexity
  • Data Structures And Algorithms
  • Discrete Mathematics


  • Approximation algorithms
  • Computational complexity of counting problems
  • Markov chain Monte Carlo
  • Statistical physics
  • Structural Graph Theory


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).


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

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.