Sören Riechers
Sören Riechers
Heinz-Nixdorf-Institute, University of Paderborn
Bestätigte E-Mail-Adresse bei uni-paderborn.de
Titel
Zitiert von
Zitiert von
Jahr
Fully-dynamic bin packing with little repacking
B Feldkord, M Feldotto, A Gupta, G Guruganesh, A Kumar, S Riechers, ...
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
162018
Towards flexible demands in online leasing problems
S Li, A Mäcker, C Markarian, FM auf der Heide, S Riechers
International Computing and Combinatorics Conference, 277-288, 2015
162015
Towards flexible demands in online leasing problems
S Li, A Mäcker, C Markarian, FM auf der Heide, S Riechers
International Computing and Combinatorics Conference, 277-288, 2015
162015
Scheduling shared continuous resources on many-cores
A Brinkmann, P Kling, F Meyer auf der Heide, L Nagel, S Riechers, T Süß
Proceedings of the 26th ACM symposium on Parallelism in algorithms and …, 2014
112014
Non-preemptive scheduling on machines with setup times
A Mäcker, M Malatyali, FM auf der Heide, S Riechers
Workshop on Algorithms and Data Structures, 542-553, 2015
102015
Sharing is caring: Multiprocessor scheduling with a sharable resource
P Kling, A Mäcker, S Riechers, A Skopalik
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and …, 2017
82017
Cost-efficient scheduling on machines from the cloud
A Mäcker, M Malatyali, FM auf der Heide, S Riechers
Journal of Combinatorial Optimization 36 (4), 1168-1194, 2018
72018
Episodic clustering of data streams using a topology-learning neural network
M Tscherepanow, S Kühnel, S Riechers
Proceedings of the ECAI Workshop on Active and Incremental Learning (AIL), 2012
72012
Scheduling shared continuous resources on many-cores
E Althaus, A Brinkmann, P Kling, FM Auf der Heide, L Nagel, S Riechers, ...
Journal of Scheduling 21 (1), 77-92, 2018
62018
A tight approximation for fully dynamic bin packing without bundling
B Feldkord, M Feldotto, S Riechers
arXiv preprint arXiv:1711.01231, 2017
62017
Budget-restricted utility games with ordered strategic decisions
M Drees, S Riechers, A Skopalik
International Symposium on Algorithmic Game Theory, 110-121, 2014
62014
On existence and properties of approximate pure Nash equilibria in bandwidth allocation games
M Drees, M Feldotto, S Riechers, A Skopalik
International Symposium on Algorithmic Game Theory, 178-189, 2015
52015
Monitoring of domain-related problems in distributed data streams
P Bemmann, F Biermeier, J Bürmann, A Kemper, T Knollmann, S Knorr, ...
International Colloquium on Structural Information and Communication …, 2017
42017
An incremental on-line classifier for imbalanced, incomplete, and noisy data
M Tscherepanow, S Riechers
Proceedings of the ECAI Workshop on Active and Incremental Learning (AIL), 2012
42012
Non-clairvoyant scheduling to minimize max flow time on a machine with setup times
A Mäcker, M Malatyali, FM auf der Heide, S Riechers
International Workshop on Approximation and Online Algorithms, 207-222, 2017
32017
Pure Nash equilibria in restricted budget games
M Drees, M Feldotto, S Riechers, A Skopalik
Journal of combinatorial optimization 37 (2), 620-638, 2019
22019
Scheduling with interjob communication on parallel processors
J König, A Mäcker, FM auf der Heide, S Riechers
Journal of Combinatorial Optimization 36 (4), 1356-1379, 2018
22018
Continuous speed scaling with variability: A simple and direct approach
A Antoniadis, P Kling, S Ott, S Riechers
Theoretical Computer Science 678, 1-13, 2017
22017
Scheduling with Scarce Resources
S Riechers
Paderborn, Universität Paderborn, 2017
2017
On Scheduling with a Sharable Resource
P Kling, A Mäcker, S Riechers, A Skopalik
13th Workshop on Models and Algorithms for Planning and Scheduling Problems, 6, 2017
2017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20