The following pages link to Håkan Lennerstad (Q712250):
Displaying 18 items.
- Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization (Q712251) (← links)
- Guaranteeing response times for aperiodic tasks in global multiprocessor scheduling (Q862988) (← links)
- Optimal scheduling combinatorics (Q878329) (← links)
- Optimal recovery schemes in fault tolerant distributed computing (Q1777226) (← links)
- Optimal bounds on the gain of permitting dynamic allocation of communication channels in distributed computing (Q1818299) (← links)
- The maximum gain of increasing the number of preemptions in multiprocessor scheduling (Q2390934) (← links)
- Decomposing rational numbers (Q3066617) (← links)
- (Q4209155) (← links)
- (Q4365942) (← links)
- An upper bound on the minimum Euclidean distance for block-coded phase-shift keying (Q4503543) (← links)
- Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems (Q4507326) (← links)
- Optimal Worst Case Formulas Comparing Cache Memory Associativity (Q4507376) (← links)
- List graphs and distance-consistent node labelings (Q5009976) (← links)
- The n-dimensional Stern–Brocot tree (Q5223031) (← links)
- Generalized upper bounds on the minimum distance of PSK block codes (Q5264367) (← links)
- (Q5284899) (← links)
- (Q5403015) (← links)
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making (Q5463921) (← links)
