@inproceedings{58046,
  author       = {{Weiß-Lucas, Carolin and Dechange, Luisa and Jost, Johanna and Jonas, Kristina and Wiewrodt, Dorothee and Goldbrunner, Roland}},
  booktitle    = {{73. Jahrestagung der Deutschen Gesellschaft für Neurochirurgie (DGNC), Joint Meeting mit der Griechischen Gesellschaft für Neurochirurgie}},
  keywords     = {{Medicine and health}},
  title        = {{{Readiness of patients with malignant brain tumours for video-based online visits and medical assessments: German Medical Science GMS Publishing House}}},
  doi          = {{10.3205/22DGNC531}},
  year         = {{2022}},
}

@book{60795,
  author       = {{Büttner-Kunert, J and Jonas, Kristina and  Rosenkranz, A and  Thöne-Otto, A}},
  publisher    = {{Schulz-Kirchner}},
  title        = {{{Kognitive  Kommunikationsstörungen: Wenn die Zusammenarbeit von Sprache und geistigen Fähigkeiten  durch eine neurologische Erkrankung beeinträchtigt ist (2022. Aufl.)}}},
  year         = {{2022}},
}

@inbook{37538,
  author       = {{Freitag, Christine}},
  booktitle    = {{Empirische Studien zum Praxissemester: Untersuchungen zum Bielefelder Modell}},
  editor       = {{Klewin, Gabriele and te Poel, Kathrin and Heinrich, Martin}},
  isbn         = {{978-3830945307}},
  pages        = {{171--176}},
  publisher    = {{Waxmann}},
  title        = {{{Vergleichende Perspektive aus dem gleichen Bundesland - ein Kommentar aus Paderborn}}},
  year         = {{2022}},
}

@article{63508,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Tailored nanoscale quantum light sources, matching the specific needs of use cases, are crucial building blocks for photonic quantum technologies. Several different approaches to realize solid-state quantum emitters with high performance have been pursued and different concepts for energy tuning have been established. However, the properties of the emitted photons are always defined by the individual quantum emitter and can therefore not be controlled with full flexibility. Here we introduce an all-optical nonlinear method to tailor and control the single photon emission. We demonstrate a laser-controlled down-conversion process from an excited state of a semiconductor quantum three-level system. Based on this concept, we realize energy tuning and polarization control of the single photon emission with a control-laser field. Our results mark an important step towards tailored single photon emission from a photonic quantum system based on quantum optical principles.</jats:p>}},
  author       = {{Jonas, B. and Heinze, D. and Schöll, E. and Kallert, P. and Langer, T. and Krehs, S. and Widhalm, A. and Jöns, K. D. and Reuter, D. and Schumacher, S. and Zrenner, A.}},
  issn         = {{2041-1723}},
  journal      = {{Nature Communications}},
  number       = {{1}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Nonlinear down-conversion in a single quantum dot}}},
  doi          = {{10.1038/s41467-022-28993-3}},
  volume       = {{13}},
  year         = {{2022}},
}

@techreport{44633,
  author       = {{Seland, I. and Aldrich, R. and Ayllón, S. and Barbovschi, M. and Bărbuță, A. and Brugarolas, P. and Casamassima, Gianna and Drossel, Kerstin and Eickelmann, Birgit and Gosme, E. and Gudmundsdottir, G. B. and Holmarsdottir, H. B. and Hyggen, C. and Lado, S. and Tove, T. and Kapella, O. and Karatzogianni, A. and Kazani, A. and Labusch, Amelie and Mifsud, L. and Olabode, S. and Parsanoglou, D. and Roth, M. and Schmidt, E.-M. and Shorey, H. and Sisask, M. and Symeonaki, M. and Teidla-Kunitsõn, G. and Zinoveva, L.}},
  title        = {{{Understanding children and young people as digital citizens. (DigiGen- working paper series No.12)}}},
  year         = {{2022}},
}

@inproceedings{65532,
  author       = {{Jancar, Jan and Fourné, Marcel and Braga, Daniel De Almeida and Sabt, Mohamed and Schwabe, Peter and Barthe, Gilles and Fouque, Pierre-Alain and Acar, Yasemin}},
  booktitle    = {{2022 IEEE Symposium on Security and Privacy (SP)}},
  publisher    = {{IEEE}},
  title        = {{{“They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks}}},
  doi          = {{10.1109/sp46214.2022.9833713}},
  year         = {{2022}},
}

@inproceedings{27160,
  abstract     = {{We study the complexity of problems solvable in deterministic polynomial time
with access to an NP or Quantum Merlin-Arthur (QMA)-oracle, such as $P^{NP}$
and $P^{QMA}$, respectively. The former allows one to classify problems more
finely than the Polynomial-Time Hierarchy (PH), whereas the latter
characterizes physically motivated problems such as Approximate Simulation
(APX-SIM) [Ambainis, CCC 2014]. In this area, a central role has been played by
the classes $P^{NP[\log]}$ and $P^{QMA[\log]}$, defined identically to $P^{NP}$
and $P^{QMA}$, except that only logarithmically many oracle queries are
allowed. Here, [Gottlob, FOCS 1993] showed that if the adaptive queries made by
a $P^{NP}$ machine have a "query graph" which is a tree, then this computation
can be simulated in $P^{NP[\log]}$.
  In this work, we first show that for any verification class
$C\in\{NP,MA,QCMA,QMA,QMA(2),NEXP,QMA_{\exp}\}$, any $P^C$ machine with a query
graph of "separator number" $s$ can be simulated using deterministic time
$\exp(s\log n)$ and $s\log n$ queries to a $C$-oracle. When $s\in O(1)$ (which
includes the case of $O(1)$-treewidth, and thus also of trees), this gives an
upper bound of $P^{C[\log]}$, and when $s\in O(\log^k(n))$, this yields bound
$QP^{C[\log^{k+1}]}$ (QP meaning quasi-polynomial time). We next show how to
combine Gottlob's "admissible-weighting function" framework with the
"flag-qubit" framework of [Watson, Bausch, Gharibian, 2020], obtaining a
unified approach for embedding $P^C$ computations directly into APX-SIM
instances in a black-box fashion. Finally, we formalize a simple no-go
statement about polynomials (c.f. [Krentel, STOC 1986]): Given a multi-linear
polynomial $p$ specified via an arithmetic circuit, if one can "weakly
compress" $p$ so that its optimal value requires $m$ bits to represent, then
$P^{NP}$ can be decided with only $m$ queries to an NP-oracle.}},
  author       = {{Gharibian, Sevag and Rudolph, Dorian}},
  booktitle    = {{13th Innovations in Theoretical Computer Science (ITCS 2022)}},
  number       = {{75}},
  pages        = {{1--27}},
  title        = {{{On polynomially many queries to NP or QMA oracles}}},
  doi          = {{10.4230/LIPIcs.ITCS.2022.75}},
  volume       = {{215}},
  year         = {{2022}},
}