@inbook{45875,
  author       = {{Götte, Thorsten and Knollmann, Till and Meyer auf der Heide, Friedhelm and Scheideler, Christian and Werthmann, Julian}},
  booktitle    = {{On-The-Fly Computing -- Individualized IT-services in dynamic markets}},
  editor       = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}},
  pages        = {{1----20}},
  publisher    = {{Heinz Nixdorf Institut, Universität Paderborn}},
  title        = {{{Capabilities and Limitations of Local Strategies in Dynamic Networks}}},
  doi          = {{10.5281/zenodo.8060372}},
  volume       = {{412}},
  year         = {{2023}},
}

@inbook{45895,
  author       = {{Karl, Holger and Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon and Redder, Adrian}},
  booktitle    = {{On-The-Fly Computing -- Individualized IT-services in dynamic markets}},
  editor       = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}},
  pages        = {{183--202}},
  publisher    = {{Heinz Nixdorf Institut, Universität Paderborn}},
  title        = {{{On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers}}},
  doi          = {{10.5281/zenodo.8068664}},
  volume       = {{412}},
  year         = {{2023}},
}

@inbook{45901,
  author       = {{Blömer, Johannes and Bobolz, Jan and Eidens, Fabian and Jager, Tibor and Kramer, Paul}},
  booktitle    = {{On-The-Fly Computing -- Individualized IT-services in dynamic markets}},
  editor       = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}},
  pages        = {{237--246}},
  publisher    = {{Heinz Nixdorf Institut, Universität Paderborn}},
  title        = {{{Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems}}},
  doi          = {{10.5281/zenodo.8068755}},
  volume       = {{412}},
  year         = {{2023}},
}

@inbook{45897,
  author       = {{Gottschalk, Sebastian and Vorbohle, Christian and Kundisch, Dennis and Engels, Gregor and Wünderlich, Nacy V.}},
  booktitle    = {{On-The-Fly Computing -- Individualized IT-services in dynamic markets}},
  editor       = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}},
  pages        = {{203--224}},
  publisher    = {{Heinz Nixdorf Institut, Universität Paderborn}},
  title        = {{{Architectural Management of OTF Computing Markets}}},
  doi          = {{10.5281/zenodo.8068691}},
  volume       = {{412}},
  year         = {{2023}},
}

@inbook{45891,
  author       = {{Blömer, Johannes and Eidens, Fabian and Jager, Tibor and Niehues, David and Scheideler, Christian}},
  booktitle    = {{On-The-Fly Computing -- Individualized IT-services in dynamic markets}},
  editor       = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}},
  pages        = {{145--164}},
  publisher    = {{Heinz Nixdorf Institut, Universität Paderborn}},
  title        = {{{Robustness and Security}}},
  doi          = {{10.5281/zenodo.8068629}},
  volume       = {{412}},
  year         = {{2023}},
}

@inbook{45882,
  author       = {{Bäumer, Frederik Simon and Chen, Wei-Fan and Geierhos, Michaela and Kersting, Joschka and Wachsmuth, Henning}},
  booktitle    = {{On-The-Fly Computing -- Individualized IT-services in dynamic markets}},
  editor       = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}},
  pages        = {{65--84}},
  publisher    = {{Heinz Nixdorf Institut, Universität Paderborn}},
  title        = {{{Dialogue-based Requirement Compensation and Style-adjusted Data-to-text Generation}}},
  doi          = {{10.5281/zenodo.8068456}},
  volume       = {{412}},
  year         = {{2023}},
}

@inbook{45884,
  author       = {{Hanselle, Jonas Manuel and Hüllermeier, Eyke and Mohr, Felix and Ngonga Ngomo, Axel-Cyrille and Sherif, Mohamed and Tornede, Alexander and Wever, Marcel Dominik}},
  booktitle    = {{On-The-Fly Computing -- Individualized IT-services in dynamic markets}},
  editor       = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}},
  pages        = {{85--104}},
  publisher    = {{Heinz Nixdorf Institut, Universität Paderborn}},
  title        = {{{Configuration and Evaluation}}},
  doi          = {{10.5281/zenodo.8068466}},
  volume       = {{412}},
  year         = {{2023}},
}

@inbook{45878,
  author       = {{Haake, Claus-Jochen and Hehenkamp, Burkhard and Polevoy, Gleb}},
  booktitle    = {{On-The-Fly Computing -- Individualized IT-services in dynamic markets}},
  editor       = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}},
  pages        = {{21--44}},
  publisher    = {{Heinz Nixdorf Institut, Universität Paderborn}},
  title        = {{{The Market for Services: Incentives, Algorithms, Implementation}}},
  doi          = {{10.5281/zenodo.8068414}},
  volume       = {{412}},
  year         = {{2023}},
}

@inbook{45886,
  author       = {{Wehrheim, Heike and Hüllermeier, Eyke and Becker, Steffen and Becker, Matthias and Richter, Cedric and Sharma, Arnab}},
  booktitle    = {{On-The-Fly Computing -- Individualized IT-services in dynamic markets}},
  editor       = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}},
  pages        = {{105--123}},
  publisher    = {{Heinz Nixdorf Institut, Universität Paderborn}},
  title        = {{{Composition Analysis in Unknown Contexts}}},
  doi          = {{10.5281/zenodo.8068510}},
  volume       = {{412}},
  year         = {{2023}},
}

@misc{45917,
  author       = {{Raeisi Nafchi, Masood}},
  publisher    = {{Paderborn University}},
  title        = {{{Reconfigurable Random Forest Implementation on FPGA}}},
  year         = {{2023}},
}

@misc{45916,
  author       = {{Yadalam Murali Kumar, Nihal}},
  publisher    = {{Paderborn University}},
  title        = {{{Data Analytics for Predictive Maintenance of Time Series Data}}},
  year         = {{2023}},
}

@inproceedings{34138,
  abstract     = {{Variational Quantum Algorithms (VQAs), such as the Quantum Approximate
Optimization Algorithm (QAOA) of [Farhi, Goldstone, Gutmann, 2014], have seen
intense study towards near-term applications on quantum hardware. A crucial
parameter for VQAs is the depth of the variational ansatz used - the smaller
the depth, the more amenable the ansatz is to near-term quantum hardware in
that it gives the circuit a chance to be fully executed before the system
decoheres. This potential for depth reduction has made VQAs a staple of Noisy
Intermediate-Scale Quantum (NISQ)-era research.
  In this work, we show that approximating the optimal depth for a given VQA
ansatz is intractable. Formally, we show that for any constant $\epsilon>0$, it
is QCMA-hard to approximate the optimal depth of a VQA ansatz within
multiplicative factor $N^{1-\epsilon}$, for $N$ denoting the encoding size of
the VQA instance. (Here, Quantum Classical Merlin-Arthur (QCMA) is a quantum
generalization of NP.) We then show that this hardness persists even in the
"simpler" setting of QAOAs. To our knowledge, this yields the first natural
QCMA-hard-to-approximate problems. To achieve these results, we bypass the need
for a PCP theorem for QCMA by appealing to the disperser-based NP-hardness of
approximation construction of [Umans, FOCS 1999].}},
  author       = {{Bittel, Lennart and Gharibian, Sevag and Kliesch, Martin}},
  booktitle    = {{Proceedings of the 38th Computational Complexity Conference (CCC)}},
  number       = {{34}},
  pages        = {{34:1--34:24}},
  title        = {{{The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate}}},
  doi          = {{10.4230/LIPIcs.CCC.2023.34}},
  volume       = {{264}},
  year         = {{2023}},
}

@phdthesis{45781,
  author       = {{Pukrop, Simon}},
  title        = {{{On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling}}},
  doi          = {{10.17619/UNIPB/1-1768 }},
  year         = {{2023}},
}

@misc{46053,
  author       = {{Schneider, Fabian}},
  title        = {{{Utilizing Redundancy in Distributed Heterogeneous Storage}}},
  year         = {{2023}},
}

@misc{46087,
  author       = {{Ranade, Amruta}},
  title        = {{{Graph Neural Network-based Anomaly Detection in  Smart Grid Energy Consumption}}},
  year         = {{2023}},
}

@misc{46086,
  author       = {{Ali, Osama}},
  title        = {{{Highly accurate deep compressed facial recognition}}},
  year         = {{2023}},
}

@misc{46110,
  author       = {{Ashri, Nivedita}},
  title        = {{{Virtual On-Demand Volunteer System Based on Delaunay Triangulation}}},
  year         = {{2023}},
}

@unpublished{46117,
  abstract     = {{Let $X=X_1\times X_2$ be a product of two rank one symmetric spaces of
non-compact type and $\Gamma$ a torsion-free discrete subgroup in $G_1\times
G_2$. We show that the spectrum of $\Gamma \backslash X$ is related to the
asymptotic growth of $\Gamma$ in the two direction defined by the two factors.
We obtain that $L^2(\Gamma \backslash G)$ is tempered for large class of
$\Gamma$.}},
  author       = {{Weich, Tobias and Wolf, Lasse L.}},
  booktitle    = {{arXiv:2304.09573}},
  title        = {{{Temperedness of locally symmetric spaces: The product case}}},
  year         = {{2023}},
}

@article{46147,
  author       = {{Brosch, Anian and Tinazzi, Fabio and Wallscheid, Oliver and Zigliotto, Mauro and Böcker, Joachim}},
  issn         = {{0885-8993}},
  journal      = {{IEEE Transactions on Power Electronics}},
  keywords     = {{Electrical and Electronic Engineering}},
  publisher    = {{Institute of Electrical and Electronics Engineers (IEEE)}},
  title        = {{{Finite Set Sensorless Control With Minimum a Priori Knowledge and Tuning Effort for Interior Permanent Magnet Synchronous Motors}}},
  doi          = {{10.1109/tpel.2023.3294557}},
  year         = {{2023}},
}

@article{38041,
  abstract     = {{<jats:p>While FPGA accelerator boards and their respective high-level design tools are maturing, there is still a lack of multi-FPGA applications, libraries, and not least, benchmarks and reference implementations towards sustained HPC usage of these devices. As in the early days of GPUs in HPC, for workloads that can reasonably be decoupled into loosely coupled working sets, multi-accelerator support can be achieved by using standard communication interfaces like MPI on the host side. However, for performance and productivity, some applications can profit from a tighter coupling of the accelerators. FPGAs offer unique opportunities here when extending the dataflow characteristics to their communication interfaces.</jats:p>
          <jats:p>In this work, we extend the HPCC FPGA benchmark suite by multi-FPGA support and three missing benchmarks that particularly characterize or stress inter-device communication: b_eff, PTRANS, and LINPACK. With all benchmarks implemented for current boards with Intel and Xilinx FPGAs, we established a baseline for multi-FPGA performance. Additionally, for the communication-centric benchmarks, we explored the potential of direct FPGA-to-FPGA communication with a circuit-switched inter-FPGA network that is currently only available for one of the boards. The evaluation with parallel execution on up to 26 FPGA boards makes use of one of the largest academic FPGA installations.</jats:p>}},
  author       = {{Meyer, Marius and Kenter, Tobias and Plessl, Christian}},
  issn         = {{1936-7406}},
  journal      = {{ACM Transactions on Reconfigurable Technology and Systems}},
  keywords     = {{General Computer Science}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks}}},
  doi          = {{10.1145/3576200}},
  year         = {{2023}},
}