Håkan Lennerstad

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

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 Electronic Journal of Graph Theory and Applications	2021-08-23	Paper
The \(n\)-dimensional Stern-Brocot tree International Journal of Number Theory	2019-07-04	Paper
Generalized upper bounds on the minimum distance of PSK block codes IMA Journal of Mathematical Control and Information	2015-07-27	Paper
Optimal computer crash performance precaution	2014-03-25	Paper
Decomposing rational numbers Acta Arithmetica	2011-01-11	Paper
Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization Discrete Mathematics	2010-10-28	Paper
The maximum gain of increasing the number of preemptions in multiprocessor scheduling Acta Informatica	2009-08-10	Paper
Optimal scheduling combinatorics Electronic Notes in Discrete Mathematics	2007-04-26	Paper
Guaranteeing response times for aperiodic tasks in global multiprocessor scheduling Real-Time Systems	2007-01-25	Paper
Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making Lecture Notes in Computer Science	2005-08-17	Paper
Optimal recovery schemes in fault tolerant distributed computing Acta Informatica	2005-05-12	Paper
scientific article; zbMATH DE number 1089241 (Why is no real title available?)	2002-11-24	Paper
Optimal Worst Case Formulas Comparing Cache Memory Associativity SIAM Journal on Computing	2000-10-18	Paper
Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems SIAM Journal on Computing	2000-10-18	Paper
An upper bound on the minimum Euclidean distance for block-coded phase-shift keying IEEE Transactions on Information Theory	2000-09-07	Paper
Optimal bounds on the gain of permitting dynamic allocation of communication channels in distributed computing Acta Informatica	2000-02-01	Paper
scientific article; zbMATH DE number 1206104 (Why is no real title available?)	1998-10-14	Paper
scientific article; zbMATH DE number 969496 (Why is no real title available?)	1997-01-22	Paper

Research outcomes over time

This page was built for person: Håkan Lennerstad