Sören Riechers

According to our database, Sören Riechers authored at least 16 papers between 2014 and 2018.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2018

Scheduling shared continuous resources on many-cores.

Ernst Althaus, André Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Jirí Sgall, Tim Süß

J. Sched., 2018

Fully-Dynamic Bin Packing with Little Repacking.

Björn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, David Wajc

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Scheduling with scarce resources (Scheduling mit knappen Ressourcen)

Sören Riechers

PhD thesis, 2017

Continuous speed scaling with variability: A simple and direct approach.

Antonios Antoniadis, Peter Kling, Sebastian Ott, Sören Riechers

Theor. Comput. Sci., 2017

A Tight Approximation for Fully Dynamic Bin Packing without Bundling.

Björn Feldkord, Matthias Feldotto, Sören Riechers

CoRR, 2017

Non-clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.

Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers

Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource.

Peter Kling, Alexander Mäcker, Sören Riechers, Alexander Skopalik

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Monitoring of Domain-Related Problems in Distributed Data Streams.

Pascal Bemmann, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann, Steffen Knorr, Nils Kothe, Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers, Johannes Schaefer, Jannik Sundermeier

Proceedings of the Structural Information and Communication Complexity, 2017

Pure Nash Equilibria in Restricted Budget Games.

Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

Cost-Efficient Scheduling on Machines from the Cloud.

Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers

Proceedings of the Combinatorial Optimization and Applications, 2016

Scheduling with Interjob Communication on Parallel Processors.

Jürgen König, Alexander Mäcker, Friedhelm Meyer auf der Heide, Sören Riechers

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Non-preemptive Scheduling on Machines with Setup Times.

Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.

Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Towards Flexible Demands in Online Leasing Problems.

Shouwei Li, Alexander Mäcker, Christine Markarian, Friedhelm Meyer auf der Heide, Sören Riechers

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

Scheduling shared continuous resources on many-cores.

André Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Tim Süß

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Budget-Restricted Utility Games with Ordered Strategic Decisions.

Maximilian Drees, Sören Riechers, Alexander Skopalik

Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014