pith. sign in

Jesper Larsson Tr\"aff

Identifiers

  • name variant Jesper Larsson Tr\"aff 0.60 · backfill

Papers (26)

  1. Effective MPI: User-defined Datatypes and Cartesian Communicators for Zero-copy All-to-all Communication in Multidimensional Tori cs.DC · 2026 · author #1
  2. Two Efficient Message-passing Exclusive Scan Algorithms cs.DS · 2026 · author #1
  3. More Parallelism in Dijkstra's Single-Source Shortest Path Algorithm cs.DC · 2019 · author #2
  4. Stamp-it: A more Thread-efficient, Concurrent Memory Reclamation Scheme in the C++ Memory Model cs.DC · 2018 · author #2
  5. Parallel Quicksort without Pairwise Element Exchange cs.DC · 2018 · author #1
  6. Memory Models for C/C++ Programmers cs.DC · 2018 · author #2
  7. A new and five older Concurrent Memory Reclamation Schemes in Comparison (Stamp-it) cs.DC · 2017 · author #2
  8. On Optimal Trees for Irregular Gather and Scatter Collectives cs.CC · 2017 · author #1
  9. VieM v1.00 -- Vienna Mapping and Sparse Quadratic Assignment User Guide cs.DC · 2017 · author #2
  10. Practical, Linear-time, Fully Distributed Algorithms for Irregular Gather and Scatter cs.DC · 2017 · author #1
  11. Better Process Mapping and Sparse Quadratic Assignment cs.DC · 2017 · author #2
  12. MPI Derived Datatypes: Performance Expectations and Status Quo cs.DC · 2016 · author #3
  13. Message-Combining Algorithms for Isomorphic, Sparse Collective Communication cs.DC · 2016 · author #1
  14. PGMPI: Automatically Verifying Self-Consistent MPI Performance Guidelines cs.DC · 2016 · author #4
  15. Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures cs.DS · 2016 · author #2
  16. The Shortest Path Problem with Edge Information Reuse is NP-Complete cs.CC · 2015 · author #1
  17. Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions cs.DS · 2015 · author #4
  18. The Lock-free $k$-LSM Relaxed Priority Queue cs.DS · 2015 · author #3
  19. An improved, easily computable combinatorial lower bound for weighted graph bipartitioning cs.DS · 2014 · author #1
  20. Data Structures for Task-based Priority Scheduling cs.DC · 2013 · author #4
  21. On the State and Importance of Reproducible Experimental Research in Parallel Computing cs.DC · 2013 · author #2
  22. Configurable Strategies for Work-stealing cs.DC · 2013 · author #3
  23. A Note on (Parallel) Depth- and Breadth-First Search by Arc Elimination cs.DS · 2013 · author #1
  24. Perfectly load-balanced, optimal, stable, parallel merge cs.DC · 2013 · author #2
  25. Simplified, stable parallel merging cs.DC · 2012 · author #1
  26. Work-stealing for mixed-mode parallelism by deterministic team-building cs.DC · 2010 · author #2

Mentions

  • 1509.05637 #1 · backfill · confidence 0.70 Jesper Larsson Tr\"aff
  • 1506.09100 #4 · backfill · confidence 0.70 Jesper Larsson Tr\"aff
  • 1503.05698 #3 · backfill · confidence 0.70 Jesper Larsson Tr\"aff
  • 1410.0462 #1 · backfill · confidence 0.70 Jesper Larsson Tr\"aff
  • 1312.2501 #4 · backfill · confidence 0.70 Jesper Larsson Tr\"aff
  • 2605.29970 #1 · arxiv_oai · confidence 0.70 Jesper Larsson Tr\"aff
  • 1308.3648 #2 · backfill · confidence 0.70 Jesper Larsson Tr\"aff
  • 1305.6474 #3 · backfill · confidence 0.70 Jesper Larsson Tr\"aff
  • 1305.1222 #1 · backfill · confidence 0.70 Jesper Larsson Tr\"aff
  • 1303.4312 #2 · backfill · confidence 0.70 Jesper Larsson Tr\"aff
  • 1202.6575 #1 · backfill · confidence 0.70 Jesper Larsson Tr\"aff
  • 1012.5030 #2 · backfill · confidence 0.70 Jesper Larsson Tr\"aff

Frequent Coauthors