This report documents the program and the outcomes of Dagstuhl Seminar 22061 "Logic and Random Discrete Structures". The main topic of this seminar has been the analysis of large random discrete structures, such as trees, graphs, or permutations, from the perspective of mathematical logic. It has brought together both experts and junior researchers from a number of different areas where logic and random structures play a role, with the goal to establish new connections between such areas and to encourage interactions between foundational research and different application areas, including probabilistic databases
The following report archives the presentations and activities of the March 2019 Dagstuhl Seminar 19...
Inhalt der Dissertation ist die Untersuchung der Evolutionsprozesse zufälliger diskreter Strukture...
We study several problems in probabilistic and extremal combinatorics. Probabilistic combinatorics i...
We provide a report on the Dagstuhl Seminar 13121: "Bidimensional Structures: Algorithms, Combinator...
Abstract. We provide an introduction to the analysis of random combinatorial structures and some of ...
This report documents the program and the outcomes of Dagstuhl Seminar 21391 "Sparsity in Algorithms...
This report documents the program and the outcomes of Dagstuhl Seminar 17141 "Probabilistic Methods ...
International audienceThe emphasis in this book is placed on general models (Markov chains, random f...
Research on the notions of information and randomness has drawn on methods and ideas from computabil...
The emphasis in this book is placed on general models (Markov chains, random fields, random graphs),...
Results of research on classical combinatorial structures such as random graphs, permutations, and s...
These lecture notes are intended to be used for master courses, where the students have a limited pr...
Szele and others, that deterministic statements can be proved by probabilistic reasoning, led alread...
For many combinatorial objects we can associate a natural probability distribution on the members of...
This report documents the program and activities of Dagstuhl Seminar 21121 "Computational Complexity...
The following report archives the presentations and activities of the March 2019 Dagstuhl Seminar 19...
Inhalt der Dissertation ist die Untersuchung der Evolutionsprozesse zufälliger diskreter Strukture...
We study several problems in probabilistic and extremal combinatorics. Probabilistic combinatorics i...
We provide a report on the Dagstuhl Seminar 13121: "Bidimensional Structures: Algorithms, Combinator...
Abstract. We provide an introduction to the analysis of random combinatorial structures and some of ...
This report documents the program and the outcomes of Dagstuhl Seminar 21391 "Sparsity in Algorithms...
This report documents the program and the outcomes of Dagstuhl Seminar 17141 "Probabilistic Methods ...
International audienceThe emphasis in this book is placed on general models (Markov chains, random f...
Research on the notions of information and randomness has drawn on methods and ideas from computabil...
The emphasis in this book is placed on general models (Markov chains, random fields, random graphs),...
Results of research on classical combinatorial structures such as random graphs, permutations, and s...
These lecture notes are intended to be used for master courses, where the students have a limited pr...
Szele and others, that deterministic statements can be proved by probabilistic reasoning, led alread...
For many combinatorial objects we can associate a natural probability distribution on the members of...
This report documents the program and activities of Dagstuhl Seminar 21121 "Computational Complexity...
The following report archives the presentations and activities of the March 2019 Dagstuhl Seminar 19...
Inhalt der Dissertation ist die Untersuchung der Evolutionsprozesse zufälliger diskreter Strukture...
We study several problems in probabilistic and extremal combinatorics. Probabilistic combinatorics i...