default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHåkan Lennerstad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c16]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: 43-50
2010 – 2019
- 2019
- [c15]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: 137-141 - 2018
- [j15]Håkan Lennerstad, Mattias V. Eriksson:
List graphs and distance-consistent node labelings. Electron. J. Graph Theory Appl. 6(1): 152-165 (2018) - [c14]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: 301-312 - 2015
- [j14]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): 305-327 (2015) - [c13]Christine Niyizamwiyitira, Lars Lundberg, Håkan Lennerstad:
Utilization-Based Schedulability Test of Real-Time Systems on Virtual Multiprocessors. ICPP Workshops 2015: 267-276 - 2014
- [c12]Håkan Lennerstad:
Local Linear Time Convergence of Primal-Dual Energy Minimization Algorithm for Parallel Processing. ISPDC 2014: 135-139 - 2012
- [j13]Efraim Laksman, Håkan Lennerstad, Lars Lundberg:
Optimal Computer Crash Performance Precaution. Discret. Math. Theor. Comput. Sci. 14(1): 55-68 (2012) - 2010
- [j12]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): 3267-3275 (2010)
2000 – 2009
- 2009
- [j11]Kamilla Klonowska, Lars Lundberg, Håkan Lennerstad:
The maximum gain of increasing the number of preemptions in multiprocessor scheduling. Acta Informatica 46(4): 285-295 (2009) - 2008
- [c11]Lars Lundberg, Håkan Lennerstad:
Slack-based global multiprocessor scheduling of aperiodic tasks in parallel embedded real-time systems. AICCSA 2008: 465-472 - 2007
- [j10]Lars Lundberg, Håkan Lennerstad:
Guaranteeing Response Times for Aperiodic Tasks in Global Multiprocessor Scheduling. Real Time Syst. 35(2): 135-151 (2007) - 2005
- [j9]Kamilla Klonowska, Håkan Lennerstad, Lars Lundberg, Charlie Svahnberg:
Optimal recovery schemes in fault tolerant distributed computing. Acta Informatica 41(6): 341-365 (2005) - [c10]Kamilla Klonowska, Lars Lundberg, Håkan Lennerstad, Charlie Svahnberg:
Extended Golomb Rulers as the New Recovery Schemes in Distributed Dependable Computing. IPDPS 2005 - 2004
- [j8]Kamilla Klonowska, Lars Lundberg, Håkan Lennerstad, Magnus Broberg:
Comparing the Optimal Performance of Parallel Architectures. Comput. J. 47(5): 527-544 (2004) - [c9]Lars Lundberg, Håkan Lennerstad, Kamilla Klonowska, Göran Gustafsson:
Using Optimal Golomb Rulers for Minimizing Collisions in Closed Hashing. ASIAN 2004: 157-168 - [c8]Kamilla Klonowska, Lars Lundberg, Håkan Lennerstad, Charlie Svahnberg:
Using Modulo Rulers for Optimal Recovery Schemes in Distributed Computing. PRDC 2004: 133-142 - 2003
- [b1]Håkan Lennerstad, Lars Lundberg:
Optimal Scheduling Combinatorics. Elsevier 2003, pp. 1-214 - [c7]Lars Lundberg, Kamilla Klonowska, Magnus Broberg, Håkan Lennerstad:
Comparing the Optimal Performance of Multiprocessor Architectures. Applied Informatics 2003: 750-760 - [c6]Kamilla Klonowska, Lars Lundberg, Håkan Lennerstad:
Using Golomb Rulers for Optimal Recovery Schemes in Fault Tolerant Distributed Computing. IPDPS 2003: 213 - [c5]Lars Lundberg, Håkan Lennerstad:
Global Multiprocessor Scheduling of Aperiodic Tasks using Time-Independent Priorities. IEEE Real Time Technology and Applications Symposium 2003: 170-180 - 2000
- [j7]Håkan Lennerstad, Lars Lundberg:
Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems. SIAM J. Comput. 29(6): 1816-1838 (2000) - [j6]Håkan Lennerstad, Lars Lundberg:
Optimal Worst Case Formulas Comparing Cache Memory Associativity. SIAM J. Comput. 30(3): 872-905 (2000) - [j5]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): 656-662 (2000)
1990 – 1999
- 1999
- [j4]Lars Lundberg, Håkan Lennerstad:
Optimal Bounds on the Gain of Permitting Dynamic Allocation of Communication Channels in Distributed Computing. Acta Informatica 36(6): 425-446 (1999) - 1998
- [j3]Lars Lundberg, Håkan Lennerstad:
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors. IEEE Trans. Parallel Distributed Syst. 9(4): 346-358 (1998) - [c4]Lars Lundberg, Håkan Lennerstad:
Comparing the Optimal Performance of Different MIMD Multiprocessor Architectures. IPPS/SPDP 1998: 498-502 - 1997
- [j2]Lars Lundberg, Håkan Lennerstad:
Bounding the Gain of Changing the Number of Memory Modules in Shared Memory Multiprocessors. Nord. J. Comput. 4(2): 233-258 (1997) - [c3]Lars Lundberg, Håkan Lennerstad:
Optimal Bounds on the Gain of Permitting Dynamic Allocation of Communication Channels in Distributed Processing. OPODIS 1997: 29-44 - 1996
- [p1]Håkan Lennerstad, Lars Lundberg:
Optimal Scheduling Results for Parallel Computing. Applications on Advanced Architecture Computers 1996: 155-163 - 1995
- [j1]Håkan Lennerstad, Lars Lundberg:
An Optimal Execution Time Estimate of Static Versus Dynamic Allocation in Multiprocessor Systems. SIAM J. Comput. 24(4): 751-764 (1995) - [c2]Håkan Lennerstad, Lars Lundberg:
Combinatorics for Multiprocessor Scheduling Optimization and Oter Contexts in Computer Architecture. Combinatorics and Computer Science 1995: 341-347 - 1994
- [c1]Lars Lundberg, Håkan Lennerstad:
An optimal upper bound on the minimal completion time in distributed supercomputing. International Conference on Supercomputing 1994: 196-203
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
