Håkan Lennerstad, Lars Lundberg Combinatorics for Multiprocessor Scheduling Optimization and Oter Contexts in Computer Architecture. [Citation Graph (0, 0)][DBLP] Combinatorics and Computer Science, 1995, pp:341-347 [Conf]
Lars Lundberg, Håkan Lennerstad An optimal upper bound on the minimal completion time in distributed supercomputing. [Citation Graph (0, 0)][DBLP] International Conference on Supercomputing, 1994, pp:196-203 [Conf]
Lars Lundberg, Håkan Lennerstad Optimal Bounds on the Gain of Permitting Dynamic Allocation of Communication Channels in Distributed Processing. [Citation Graph (0, 0)][DBLP] OPODIS, 1997, pp:29-44 [Conf]
Lars Lundberg, Håkan Lennerstad Global Multiprocessor Scheduling of Aperiodic Tasks using Time-Independent Priorities. [Citation Graph (0, 0)][DBLP] IEEE Real Time Technology and Applications Symposium, 2003, pp:170-180 [Conf]
Lars Lundberg, Håkan Lennerstad Optimal Bounds on the Gain of Permitting Dynamic Allocation of Communication Channels in Distributed Computing. [Citation Graph (0, 0)][DBLP] Acta Inf., 1999, v:36, n:6, pp:425-446 [Journal]
Magnus Nilsson, Håkan Lennerstad An upper bound on the minimum Euclidean distance for block-coded phase-shift keying. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:2, pp:656-662 [Journal]
Lars Lundberg, Håkan Lennerstad Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors. [Citation Graph (0, 0)][DBLP] IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:4, pp:346-358 [Journal]
Slack-based global multiprocessor scheduling of aperiodic tasks in parallel embedded real-time systems. [Citation Graph (, )][DBLP]
The maximum gain of increasing the number of preemptions in multiprocessor scheduling. [Citation Graph (, )][DBLP]
Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP