PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Speck, Jochen"

Author of the publication

copydeleteadd this publication to your clipboard
Malleable Sorting.

, , and . IPDPS, page 418-426. IEEE Computer Society, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Univ. -Prof. Dr. rer. nat. Thomas Speck University of Stuttgart

Dr. Jochen Seidel University of Stuttgart

Hon. -Prof. Dr. Peter Speck University of Stuttgart

Friedrich-Wilhelm Speckmann University of Stuttgart

Hon. -Prof. Dr. Jochen Mannhart University of Stuttgart

 

Other publications of authors with the same name

Constraint-based large neighborhood search for machine reassignment - A solution approach to the ROADEF/EURO challenge 2012., , and . Annals OR, 242 (1): 63-91 (2016)Full Bandwidth Broadcast, Reduction and Scan with Only Two Trees., , and . PVM/MPI, volume 4757 of Lecture Notes in Computer Science, page 17-26. Springer, (2007)Work-efficient matrix inversion in polylogarithmic time., , and . SPAA, page 214-221. ACM, (2013)Efficient Parallel Scheduling of Malleable Tasks., and . IPDPS, page 1156-1166. IEEE, (2011)Malleable Sorting., , and . IPDPS, page 418-426. IEEE Computer Society, (2013)Two-tree algorithms for full bandwidth broadcast, reduction and scan., , and . Parallel Computing, 35 (12): 581-594 (2009)Theory and Engineering of Scheduling Parallel Jobs.. Karlsruhe Institute of Technology, Germany, (2018)Locality Aware DAG-Scheduling for LU-Decomposition., , and . IPDPS, page 82-92. IEEE Computer Society, (2015)Work-Efficient Matrix Inversion in Polylogarithmic Time., , and . TOPC, 2 (3): 15:1-15:29 (2015)Energy Efficient Frequency Scaling and Scheduling for Malleable Tasks., and . Euro-Par, volume 7484 of Lecture Notes in Computer Science, page 167-178. Springer, (2012)