Håkan Lennerstad

Publication Activity (10 Years)

Years Active: 1994-2021
Publications (10 Years): 6

Top Topics

Energy Minimization

Top Venues

Electron. J. Graph Theory Appl.

Publications

Henrik Fredriksson, Mattias Dahl, Benny Lövström, Johan Holmgren, Håkan Lennerstad
Modeling of road traffic flows in the neighboring regions. EUSPN/ICTH (2021)
Lars Lundberg, Håkan Lennerstad, Veselka Boeva, Eva García-Martín
Handling Non-linear Relations in Support Vector Machines through Hyperplane Folding. ICMLC (2019)
Håkan Lennerstad, Mattias V. Eriksson
List graphs and distance-consistent node labelings. Electron. J. Graph Theory Appl. 6 (1) (2018)
Julia Sidorova, Lars Sköld, Håkan Lennerstad, Lars Lundberg
The Use of Fuzzy Logic in Creating a Visual Data Summary of a Telecom Operator's Customer Base. INTAP (2018)
Christine Niyizamwiyitira, Lars Lundberg, Håkan Lennerstad
Utilization-Based Schedulability Test of Real-Time Systems on Virtual Multiprocessors. ICPP Workshops (2015)
Efraim Laksman, Håkan Lennerstad, Magnus Nilsson
Generalized upper bounds on the minimum distance of PSK block codes. IMA J. Math. Control. Inf. 32 (2) (2015)
Håkan Lennerstad
Local Linear Time Convergence of Primal-Dual Energy Minimization Algorithm for Parallel Processing. ISPDC (2014)
Efraim Laksman, Håkan Lennerstad, Lars Lundberg
Optimal Computer Crash Performance Precaution. Discret. Math. Theor. Comput. Sci. 14 (1) (2012)
Efraim Laksman, Håkan Lennerstad, Magnus Nilsson
Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization. Discret. Math. 310 (22) (2010)
Kamilla Klonowska, Lars Lundberg, Håkan Lennerstad
The maximum gain of increasing the number of preemptions in multiprocessor scheduling. Acta Informatica 46 (4) (2009)
Lars Lundberg, Håkan Lennerstad
Slack-based global multiprocessor scheduling of aperiodic tasks in parallel embedded real-time systems. AICCSA (2008)
Lars Lundberg, Håkan Lennerstad
Guaranteeing Response Times for Aperiodic Tasks in Global Multiprocessor Scheduling. Real Time Syst. 35 (2) (2007)
Kamilla Klonowska, Lars Lundberg, Håkan Lennerstad, Charlie Svahnberg
Extended Golomb Rulers as the New Recovery Schemes in Distributed Dependable Computing. IPDPS (2005)
Kamilla Klonowska, Håkan Lennerstad, Lars Lundberg, Charlie Svahnberg
Optimal recovery schemes in fault tolerant distributed computing. Acta Informatica 41 (6) (2005)
Kamilla Klonowska, Lars Lundberg, Håkan Lennerstad, Charlie Svahnberg
Using Modulo Rulers for Optimal Recovery Schemes in Distributed Computing. PRDC (2004)
Kamilla Klonowska, Lars Lundberg, Håkan Lennerstad, Magnus Broberg
Comparing the Optimal Performance of Parallel Architectures. Comput. J. 47 (5) (2004)
Lars Lundberg, Håkan Lennerstad, Kamilla Klonowska, Göran Gustafsson
Using Optimal Golomb Rulers for Minimizing Collisions in Closed Hashing. ASIAN (2004)
Lars Lundberg, Håkan Lennerstad
Global Multiprocessor Scheduling of Aperiodic Tasks using Time-Independent Priorities. IEEE Real Time Technology and Applications Symposium (2003)
Kamilla Klonowska, Lars Lundberg, Håkan Lennerstad
Using Golomb Rulers for Optimal Recovery Schemes in Fault Tolerant Distributed Computing. IPDPS (2003)
Lars Lundberg, Kamilla Klonowska, Magnus Broberg, Håkan Lennerstad
Comparing the Optimal Performance of Multiprocessor Architectures. Applied Informatics (2003)
Magnus Nilsson, Håkan Lennerstad
An upper bound on the minimum Euclidean distance for block-coded phase-shift keying. IEEE Trans. Inf. Theory 46 (2) (2000)
Håkan Lennerstad, Lars Lundberg
Optimal Worst Case Formulas Comparing Cache Memory Associativity. SIAM J. Comput. 30 (3) (2000)
Håkan Lennerstad, Lars Lundberg
Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems. SIAM J. Comput. 29 (6) (2000)
Lars Lundberg, Håkan Lennerstad
Optimal Bounds on the Gain of Permitting Dynamic Allocation of Communication Channels in Distributed Computing. Acta Informatica 36 (6) (1999)
Lars Lundberg, Håkan Lennerstad
Comparing the Optimal Performance of Different MIMD Multiprocessor Architectures. IPPS/SPDP (1998)
Lars Lundberg, Håkan Lennerstad
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors. IEEE Trans. Parallel Distributed Syst. 9 (4) (1998)
Lars Lundberg, Håkan Lennerstad
Bounding the Gain of Changing the Number of Memory Modules in Shared Memory Multiprocessors. Nord. J. Comput. 4 (2) (1997)
Lars Lundberg, Håkan Lennerstad
Optimal Bounds on the Gain of Permitting Dynamic Allocation of Communication Channels in Distributed Processing. OPODIS (1997)
Håkan Lennerstad, Lars Lundberg
An Optimal Execution Time Estimate of Static Versus Dynamic Allocation in Multiprocessor Systems. SIAM J. Comput. 24 (4) (1995)
Håkan Lennerstad, Lars Lundberg
Combinatorics for Multiprocessor Scheduling Optimization and Oter Contexts in Computer Architecture. Combinatorics and Computer Science (1995)
Lars Lundberg, Håkan Lennerstad
An optimal upper bound on the minimal completion time in distributed supercomputing. International Conference on Supercomputing (1994)