Dagstuhl Reports, Volume 11, Issue 2, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@Article{DagRep.11.2,
title = {{Dagstuhl Reports, Volume 11, Issue 2, March 2021, Complete Issue}},
pages = {1--18},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2021},
volume = {11},
number = {2},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.2},
URN = {urn:nbn:de:0030-drops-146818},
doi = {10.4230/DagRep.11.2},
annote = {Keywords: Dagstuhl Reports, Volume 11, Issue 2, February 2021, Complete Issue}
}
Dagstuhl Reports, Volume 11, Issue 2, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@Article{DagRep.11.2.i,
title = {{Dagstuhl Reports, Table of Contents, Volume 11, Issue 2, 2021}},
pages = {i--ii},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2021},
volume = {11},
number = {2},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.2.i},
URN = {urn:nbn:de:0030-drops-146827},
doi = {10.4230/DagRep.11.2.i},
annote = {Keywords: Table of Contents, Frontmatter}
}
Anna Gál, Meena Mahajan, Rahul Santhanam, and Till Tantau. Computational Complexity of Discrete Problems (Dagstuhl Seminar 21121). In Dagstuhl Reports, Volume 11, Issue 2, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@Article{gal_et_al:DagRep.11.2.1,
author = {G\'{a}l, Anna and Mahajan, Meena and Santhanam, Rahul and Tantau, Till},
title = {{Computational Complexity of Discrete Problems (Dagstuhl Seminar 21121)}},
pages = {1--16},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2021},
volume = {11},
number = {2},
editor = {G\'{a}l, Anna and Mahajan, Meena and Santhanam, Rahul and Tantau, Till},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.2.1},
URN = {urn:nbn:de:0030-drops-146836},
doi = {10.4230/DagRep.11.2.1},
annote = {Keywords: circuit complexity, communication complexity, computational complexity, lower bounds, randomness}
}