Jesper Larsson Träff

From MaRDI portal
(Redirected from Jesper Larsson Träff)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Better Process Mapping and Sparse Quadratic Assignment
ACM Journal of Experimental Algorithmics
2023-05-23Paper
High-quality hierarchical process mapping2023-02-07Paper
Better process mapping and sparse quadratic assignment
(available as arXiv preprint)
2018-08-13Paper
VieM v1.00 -- Vienna Mapping and Sparse Quadratic Assignment User Guide2017-03-16Paper
VieM v1.00 -- Vienna Mapping and Sparse Quadratic Assignment User Guide
(available as arXiv preprint)
2017-01-01Paper
Perfectly load-balanced, stable, synchronization-free parallel merge
Parallel Processing Letters
2015-12-18Paper
Optimal broadcast for fully connected processor-node networks
Journal of Parallel and Distributed Computing
2012-07-26Paper
A practical minimum spanning tree algorithm using the cycle property
Lecture Notes in Computer Science
2010-03-03Paper
Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic
Operations Research Letters
2007-02-19Paper
scientific article; zbMATH DE number 2090670 (Why is no real title available?)2004-08-12Paper
scientific article; zbMATH DE number 1948475 (Why is no real title available?)2003-07-13Paper
scientific article; zbMATH DE number 1844526 (Why is no real title available?)2002-12-12Paper
A simple parallel algorithm for the single-source shortest path problem on planar digraphs
Journal of Parallel and Distributed Computing
2001-02-28Paper
A heuristic for blocking flow algorithms
European Journal of Operational Research
1999-07-05Paper
A parallel priority queue with constant time operations
Journal of Parallel and Distributed Computing
1998-11-05Paper
Partial memoization for obtaining linear time behavior of a 2DPDA
Theoretical Computer Science
1992-09-27Paper
Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem
Annals of Operations Research
1992-06-27Paper
scientific article; zbMATH DE number 4101166 (Why is no real title available?)1989-01-01Paper


Research outcomes over time


This page was built for person: Jesper Larsson Träff