@article{Gaigall2020,
  author    = {Gaigall, Daniel},
  title     = {Testing marginal homogeneity of a continuous bivariate distribution with possibly incomplete paired data},
  series = {Metrika},
  volume    = {2020},
  journal   = {Metrika},
  number    = {83},
  publisher = {Springer},
  issn      = {1435-926X},
  doi       = {10.1007/s00184-019-00742-5},
  pages     = {437 -- 465},
  year      = {2020},
  abstract  = {We discuss the testing problem of homogeneity of the marginal distributions of a continuous bivariate distribution based on a paired sample with possibly missing components (missing completely at random). Applying the well-known two-sample Cr{\´a}mer-von-Mises distance to the remaining data, we determine the limiting null distribution of our test statistic in this situation. It is seen that a new resampling approach is appropriate for the approximation of the unknown null distribution. We prove that the resulting test asymptotically reaches the significance level and is consistent. Properties of the test under local alternatives are pointed out as well. Simulations investigate the quality of the approximation and the power of the new approach in the finite sample case. As an illustration we apply the test to real data sets.},
  language  = {en}
}
@article{Gaigall2020,
  author    = {Gaigall, Daniel},
  title     = {Hoeffding-Blum-Kiefer-Rosenblatt independence test statistic on partly not identically distributed data},
  series = {Communications in Statistics - Theory and Methods},
  volume    = {51},
  journal   = {Communications in Statistics - Theory and Methods},
  number    = {12},
  publisher = {Taylor \& Francis},
  address   = {London},
  issn      = {1532-415X},
  doi       = {10.1080/03610926.2020.1805767},
  pages     = {4006 -- 4028},
  year      = {2020},
  abstract  = {The established Hoeffding-Blum-Kiefer-Rosenblatt independence test statistic is investigated for partly not identically distributed data. Surprisingly, it turns out that the statistic has the well-known distribution-free limiting null distribution of the classical criterion under standard regularity conditions. An application is testing goodness-of-fit for the regression function in a non parametric random effects meta-regression model, where the consistency is obtained as well. Simulations investigate size and power of the approach for small and moderate sample sizes. A real data example based on clinical trials illustrates how the test can be used in applications.},
  language  = {en}
}
@article{GazdaMaurischat2020,
  author    = {Gazda, Quentin and Maurischat, Andreas},
  title     = {Special functions and Gauss-Thakur sums in higher rank and dimension},
  publisher = {De Gruyter},
  address   = {Berlin},
  pages     = {26 Seiten},
  year      = {2020},
  language  = {en}
}
@article{GerhardsSanderZivkovicetal.2020,
  author    = {Gerhards, Michael and Sander, Volker and Zivkovic, Miroslav and Belloum, Adam and Bubak, Marian},
  title     = {New approach to allocation planning of many-task workflows on clouds},
  series = {Concurrency and Computation: Practice and Experience},
  volume    = {32},
  journal   = {Concurrency and Computation: Practice and Experience},
  number    = {2 Article e5404},
  publisher = {Wiley},
  address   = {Chichester},
  issn      = {1532-0634},
  doi       = {10.1002/cpe.5404},
  pages     = {1 -- 16},
  year      = {2020},
  abstract  = {Experience has shown that a priori created static resource allocation plans are vulnerable to runtime deviations and hence often become uneconomic or highly exceed a predefined soft deadline. The assumption of constant task execution times during allocation planning is even more unlikely in a cloud environment where virtualized resources vary in performance. Revising the initially created resource allocation plan at runtime allows the scheduler to react on deviations between planning and execution. Such an adaptive rescheduling of a many-task application workflow is only feasible, when the planning time can be handled efficiently at runtime. In this paper, we present the static low-complexity resource allocation planning algorithm (LCP) applicable to efficiently schedule many-task scientific application workflows on cloud resources of different capabilities. The benefits of the presented algorithm are benchmarked against alternative approaches. The benchmark results show that LCP is not only able to compete against higher complexity algorithms in terms of planned costs and planned makespan but also outperforms them significantly by magnitudes of 2 to 160 in terms of required planning time. Hence, LCP is superior in terms of practical usability where low planning time is essential such as in our targeted online rescheduling scenario.},
  language  = {en}
}
@article{Golland2020,
  author    = {Golland, Alexander},
  title     = {Datenschutzrechtliche Anforderungen an internationale Datentransfers},
  series = {NJW - Neue Juristische Wochenschrift},
  volume    = {2020},
  journal   = {NJW - Neue Juristische Wochenschrift},
  number    = {36},
  publisher = {Beck},
  address   = {M{\"u}nchen},
  issn      = {0341-1915},
  pages     = {2593 -- 2596},
  year      = {2020},
  language  = {de}
}
@article{Golland2020,
  author    = {Golland, Alexander},
  title     = {EDPB: Europ{\"a}ische Aufsichtsbeh{\"o}rden mit neuen Guidelines zur datenschutzkonformen Einwilligung},
  series = {DSB Datenschutz-Berater},
  volume    = {44},
  journal   = {DSB Datenschutz-Berater},
  number    = {6},
  publisher = {DFV Mediengruppe},
  address   = {Frankfurt a.M.},
  isbn      = {0170-7256},
  pages     = {151 -- 153},
  year      = {2020},
  language  = {de}
}
@article{Golland2020,
  author    = {Golland, Alexander},
  title     = {Verantwortlichkeit, Data Breach, das Ende von Fax \& E-Mail: Aufsichtsbeh{\"o}rden mit streitbaren Thesen},
  series = {DSB Datenschutz-Berater},
  volume    = {44},
  journal   = {DSB Datenschutz-Berater},
  number    = {4},
  publisher = {DFV Mediengruppe},
  address   = {Frankfurt a.M.},
  isbn      = {0170-7256},
  pages     = {98 -- 100},
  year      = {2020},
  language  = {de}
}
@article{Golland2020,
  author    = {Golland, Alexander},
  title     = {Datenschutzrechtliche Fragen personalisierter Preise — Herausforderungen von Algorithmen im Schnittbereich von Ethik, {\"O}konomie und Datenschutz},
  series = {CR Computer und Recht},
  volume    = {36},
  journal   = {CR Computer und Recht},
  number    = {3},
  publisher = {Verlag Dr. Otto Schmidt},
  address   = {K{\"o}ln},
  isbn      = {2194-4172},
  doi       = {10.9785/cr-2020-360313},
  pages     = {186 -- 194},
  year      = {2020},
  language  = {de}
}
@article{Golland2020,
  author    = {Golland, Alexander},
  title     = {Die „private" Datenverarbeitung im Internet. Verantwortlichkeiten und Rechtm{\"a}ßigkeit bei Nutzung von Plattformdiensten durch nat{\"u}rliche Personen},
  series = {ZD Zeitschrift f{\"u}r Datenschutz},
  volume    = {10},
  journal   = {ZD Zeitschrift f{\"u}r Datenschutz},
  number    = {8},
  editor    = {Hoeren, Thomas and Schneider, Jochen and Selmayr, Martin and Spies, Axel and Wybitul, Tim},
  publisher = {Beck},
  address   = {M{\"u}nchen},
  isbn      = {2192-5593},
  pages     = {397 -- 403},
  year      = {2020},
  language  = {de}
}
@article{Golland2020,
  author    = {Golland, Alexander},
  title     = {Weckruf f{\"u}r deutsche Großunternehmen? - Der neue Entwurf des IT-Sicherheitsgesetz 2.0},
  series = {K\&R Kommunikation \& Recht},
  volume    = {23},
  journal   = {K\&R Kommunikation \& Recht},
  number    = {7-8},
  publisher = {DFV Mediengruppe},
  address   = {Frankfurt a.M.},
  isbn      = {1434-6354},
  pages     = {I},
  year      = {2020},
  language  = {de}
}