Sparsity order estimation from a single compressed observation vector. - In: IEEE transactions on signal processing, ISSN 1941-0476, Bd. 66 (2018), 15, S. 3958-3971
https://doi.org/10.1109/TSP.2018.2841867
The k-server problem with parallel requests and the corresponding generalized paging problem. - In: Operations research proceedings 2017, (2018), S. 205-211
In the present paper we give a frst summary of "competitive" algorithms for solving the "k-server problems with parallel requests" or the generalized paging problem.
Spectrum of J-frame operators. - In: Opuscula mathematica, ISSN 2300-6919, Bd. 38 (2018), 5, S. 623-649
https://doi.org/10.7494/OpMath.2018.38.5.623
A note on the Thue chromatic number of lexicographic products of graphs. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 38 (2018), 3, S. 635-643
https://doi.org/10.7151/dmgt.2032
Finite rank perturbations of linear relations and singular matrix pencils. - Ilmenau : Technische Universität Ilmenau, Institut für Mathematik, 2018. - 1 Online-Ressource (25 Seiten). - (Preprint ; M18,08)
We elaborate on the deviation of the Jordan structures of two linear relations that are finite-dimensional perturbations of each other. We compare the number of Jordan chains of length at least n corresponding to some eigenvalue to each other. In the operator case, it was recently proved that the difference of these numbers is independent of n and is at most the defect between the operators. One of the main results of this paper shows that in the case of linear relations this number has to be multiplied by n+1 and that this bound is sharp. The reason for this behaviour is the existence of singular chains. We apply our results to one-dimensional perturbations of singular and regular matrix pencils. This is done by representing matrix pencils via linear relations. This technique allows for both proving known results for regular pencils as well as new results for singular ones.
https://www.db-thueringen.de/receive/dbt_mods_00034936
Locally finite extensions and Gesztesy-Šeba realizations for the Dirac operator on a metric graph. - Ilmenau : Technische Universität Ilmenau, Institut für Mathematik, 2018. - 1 Online-Ressource (27 Seiten). - (Preprint ; M18,07)
We study extensions of direct sums of symmetric operators S=\oplus S_n where n run through the natural numbers. In general there is no natural boundary triplet associated even if there is one for every S_n^*. We consider a subclass of extensions of S which can be described in terms of the boundary triplets of S_n^* and investigate the self-adjointness, the semi-boundedness from below and the discreteness of the spectrum. Sufficient conditions for these properties are obtained from recent results on weighted discrete Laplacians. The results are applied to Dirac operators on metric graphs with point interactions at the vertices. In particular, we allow graphs with arbitrarily small edge length.
http://nbn-resolving.de/urn:nbn:de:gbv:ilm1-2018200090
Differential communication with distributed MPC based on occupancy grid. - In: Information sciences, ISSN 0020-0255, Bd. 453 (2018), S. 426-441
https://doi.org/10.1016/j.ins.2018.04.034
An optimal control problem for stereotactic neurosurgery. - In: MATHMOD 2018 extended abstract volume, (2018), S. 67-68
https://doi.org/10.11128/arep.55.a55246
Das bürgerliche Stadthaus im Rokoko. - Tübingen : Wasmuth, 2018. - 255 Seiten ISBN 3-8030-0833-6
Literaturverzeichnis Seite 233-246
Computing 2-walks in polynomial time. - In: ACM transactions on algorithms, ISSN 1549-6333, Bd. 14 (2018), 2, Article No. 22, insges. 18 S.
An extended abstract of this article was published in STACS 2015
https://doi.org/10.1145/3183368