An optimal upper bound on the minimal completion time in distributed supercomputing. - Lars Lundberg; Håkan Lennerstad (International Conference on Supercomputing, 1994)

Combinatorics for Multiprocessor Scheduling Optimization and Oter Contexts in Computer Architecture. - Håkan Lennerstad; Lars Lundberg (Combinatorics and Computer Science, 1995)

An Optimal Execution Time Estimate of Static Versus Dynamic Allocation in Multiprocessor Systems. - Håkan Lennerstad; Lars Lundberg (SIAM J. Comput., 1995)

Optimal Scheduling Results for Parallel Computing. - Håkan Lennerstad; Lars Lundberg (Applications on Advanced Architecture Computers, 1996)

Optimal Bounds on the Gain of Permitting Dynamic Allocation of Communication Channels in Distributed Processing. - Lars Lundberg; Håkan Lennerstad (OPODIS, 1997)

Bounding the Gain of Changing the Number of Memory Modules in Shared Memory Multiprocessors. - Lars Lundberg; Håkan Lennerstad (Nord. J. Comput., 1997)

Comparing the Optimal Performance of Different MIMD Multiprocessor Architectures. - Lars Lundberg; Håkan Lennerstad (IPPS/SPDP, 1998)

Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors. - Lars Lundberg; Håkan Lennerstad (IEEE Trans. Parallel Distributed Syst., 1998)

Optimal Bounds on the Gain of Permitting Dynamic Allocation of Communication Channels in Distributed Computing. - Lars Lundberg; Håkan Lennerstad (Acta Informatica, 1999)

Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems. - Håkan Lennerstad; Lars Lundberg (SIAM J. Comput., 2000)

Optimal Worst Case Formulas Comparing Cache Memory Associativity. - Håkan Lennerstad; Lars Lundberg (SIAM J. Comput., 2000)

An upper bound on the minimum Euclidean distance for block-coded phase-shift keying. - Magnus Nilsson; Håkan Lennerstad (IEEE Trans. Inf. Theory, 2000)

Optimal Scheduling Combinatorics - Håkan Lennerstad; Lars Lundberg (Elsevier, 2003)

Comparing the Optimal Performance of Multiprocessor Architectures. - Lars Lundberg; Kamilla Klonowska; Magnus Broberg; Håkan Lennerstad (Applied Informatics, 2003)

Using Golomb Rulers for Optimal Recovery Schemes in Fault Tolerant Distributed Computing. - Kamilla Klonowska; Lars Lundberg; Håkan Lennerstad (IPDPS, 2003)

Global Multiprocessor Scheduling of Aperiodic Tasks using Time-Independent Priorities. - Lars Lundberg; Håkan Lennerstad (IEEE Real Time Technology and Applications Symposium, 2003)

Using Optimal Golomb Rulers for Minimizing Collisions in Closed Hashing. - Lars Lundberg; Håkan Lennerstad; Kamilla Klonowska; Göran Gustafsson (ASIAN, 2004)

Using Modulo Rulers for Optimal Recovery Schemes in Distributed Computing. - Kamilla Klonowska; Lars Lundberg; Håkan Lennerstad; Charlie Svahnberg (PRDC, 2004)

Comparing the Optimal Performance of Parallel Architectures. - Kamilla Klonowska; Lars Lundberg; Håkan Lennerstad; Magnus Broberg (Comput. J., 2004)

Extended Golomb Rulers as the New Recovery Schemes in Distributed Dependable Computing. - Kamilla Klonowska; Lars Lundberg; Håkan Lennerstad; Charlie Svahnberg (IPDPS, 2005)

Optimal recovery schemes in fault tolerant distributed computing. - Kamilla Klonowska; Håkan Lennerstad; Lars Lundberg; Charlie Svahnberg (Acta Informatica, 2005)

Guaranteeing Response Times for Aperiodic Tasks in Global Multiprocessor Scheduling. - Lars Lundberg; Håkan Lennerstad (Real Time Syst., 2007)

Slack-based global multiprocessor scheduling of aperiodic tasks in parallel embedded real-time systems. - Lars Lundberg; Håkan Lennerstad (AICCSA, 2008)

The maximum gain of increasing the number of preemptions in multiprocessor scheduling. - Kamilla Klonowska; Lars Lundberg; Håkan Lennerstad (Acta Informatica, 2009)

Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization. - Efraim Laksman; Håkan Lennerstad; Magnus Nilsson (Discret. Math., 2010)

Optimal Computer Crash Performance Precaution. - Efraim Laksman; Håkan Lennerstad; Lars Lundberg (Discret. Math. Theor. Comput. Sci., 2012)

Local Linear Time Convergence of Primal-Dual Energy Minimization Algorithm for Parallel Processing. - Håkan Lennerstad (ISPDC, 2014)

Utilization-Based Schedulability Test of Real-Time Systems on Virtual Multiprocessors. - Christine Niyizamwiyitira; Lars Lundberg; Håkan Lennerstad (ICPP Workshops, 2015)

Generalized upper bounds on the minimum distance of PSK block codes. - Efraim Laksman; Håkan Lennerstad; Magnus Nilsson (IMA J. Math. Control. Inf., 2015)

The Use of Fuzzy Logic in Creating a Visual Data Summary of a Telecom Operator's Customer Base. - Julia Sidorova; Lars Sköld; Håkan Lennerstad; Lars Lundberg (INTAP, 2018)

List graphs and distance-consistent node labelings. - Håkan Lennerstad; Mattias V. Eriksson (Electron. J. Graph Theory Appl., 2018)

Handling Non-linear Relations in Support Vector Machines through Hyperplane Folding. - Lars Lundberg; Håkan Lennerstad; Veselka Boeva; Eva García-Martín (ICMLC, 2019)

Modeling of road traffic flows in the neighboring regions. - Henrik Fredriksson; Mattias Dahl; Benny Lövström; Johan Holmgren; Håkan Lennerstad (EUSPN/ICTH, 2021)