Lower bounds for solving linear diophantine equations on random access machines
In: Journal of the Association for Computing Machinery, Jg. 1985, S. 929-937
Lower time bounds for solving linear diophantine equations on several parallel computational models
In: Information and Control, Jg. 1985, S. 195-211Mobile resource allocation
Elektronische Ressource, Paderborn, 2020Models and algorithms for hybrid networks and hybrid programmable matter
Elektronische Ressource, Paderborn, 2021Nondeterministic versus probabilistic linear search algorithms
In: FOCS 1985, Jg. 1985, S. 65-73On Cloud Assisted, Restricted, and Resource Constrained Scheduling
Elektronische Ressource, Paderborn, 2023On genuinely time bounded computations
In: STACS 1989, Jg. 1989, S. 1-16On scheduling with setup times
Elektronische Ressource, Paderborn, 2019On-The-Fly Computing
Individualized IT-services in dynamic markets : Collaborative Research Centre 901 (2011 - 2023)Elektronische Ressource, Paderborn : Heinz Nixdorf Institut, 2023Online algorithms for allocating heterogeneous resources
Elektronische Ressource, Paderborn, 2023Parallel fixed parameter tractable problems
Elektronische Ressource, Paderborn, 2017A polynomial linear search algorithm for the N-dimensional Knapsack problem
In: Conference record of the ... annual ACM Symposium on Theory of Computing, Jg. 1983, S. 70-79A polynomial linear search algorithm for the N-dimensional Knapsack problem
In: Journal of the Association for Computing Machinery, Jg. 1984, S. 668-676Reconfigurable accelerators in the world of general-purpose computing
Elektronische Ressource, Paderborn, 2016