Friedhelm Meyer auf der Heide
Friedhelm Meyer auf der Heide.
A polynomial linear search algorithm for the
n
-dimensional knapsack problem.
Journal of the ACM
, 31(3):668-676, July 1984.
Citations.
Friedhelm Meyer auf der Heide.
Lower bounds for solving linear Diophantine equations on random access machines.
Journal of the ACM
, 32(4):929-937, October 1985.
Citations.
Friedhelm Meyer auf der Heide.
Fast algorithms for
N
-dimensional restrictions of hard problems.
Journal of the ACM
, 35(3):740-747, July 1988.
Citations.
Shortcuts:
Journal of the ACM homepage
Bibliography top level
Journal of the ACM Author Index
Search the HBP database