Håkan Lennerstad

Available identifiers

zbMath Open lennerstad.hakanMaRDI QIDQ712250

List of research outcomes

Publication	Date of Publication	Type
Combinatorics for multiprocessor scheduling optimization and other contexts in computer architecture	2024-07-05	Paper
List graphs and distance-consistent node labelings	2021-08-23	Paper
The n-dimensional Stern–Brocot tree	2019-07-04	Paper
Generalized upper bounds on the minimum distance of PSK block codes	2015-07-27	Paper
https://portal.mardi4nfdi.de/entity/Q5403015	2014-03-25	Paper
Decomposing rational numbers	2011-01-11	Paper
Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization	2010-10-28	Paper
The maximum gain of increasing the number of preemptions in multiprocessor scheduling	2009-08-10	Paper
Optimal scheduling combinatorics	2007-04-26	Paper
Guaranteeing response times for aperiodic tasks in global multiprocessor scheduling	2007-01-25	Paper
Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making	2005-08-17	Paper
Optimal recovery schemes in fault tolerant distributed computing	2005-05-12	Paper
https://portal.mardi4nfdi.de/entity/Q4365942	2002-11-24	Paper
Optimal Worst Case Formulas Comparing Cache Memory Associativity	2000-10-18	Paper
Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems	2000-10-18	Paper
An upper bound on the minimum Euclidean distance for block-coded phase-shift keying	2000-09-07	Paper
Optimal bounds on the gain of permitting dynamic allocation of communication channels in distributed computing	2000-02-01	Paper
https://portal.mardi4nfdi.de/entity/Q4209155	1998-10-14	Paper
https://portal.mardi4nfdi.de/entity/Q5284899	1997-01-22	Paper

Research outcomes over time

This page was built for person: Håkan Lennerstad