Håkan Lennerstad

33 papers A 3B 1C 3Misc 1Journal 15Unranked 8

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