Homepage
Tomasz Jurkiewicz
Max Planck Institute for Informatics
Department 1: Algorithms and Complexity
Campus E1 4, Room 314
66123 Saarbrücken
Germany
Email:
Get my email address via email
Phone: +49 681 9325 1111
Fax: +49 681 9325 199
- Computational Complexity of the Virtual Address Translation
- Applications of Multicore and Parallel Algorithms
- External Memory Algorithms
- Graph Algorithms
- Low-resource Algorithms
- Tomasz Jurkiewicz, Kurt Mehlhorn: Computational complexity of the virtual address translation.
Manuscript.
- E. Amaldi, C. Iuliano, T. Jurkiewicz, K. Mehlhorn, and R. Rizzi: Breaking through the O(m^2n) Barrier for Minimum Cycle Bases.
Submitted to a journal. A preliminary version of this work appeared in ESA 2009, volume 5757 of LNCS, pages 301-312.
August 2011.
- Tomasz Jurkiewicz, Piotr Danilewski: Efficient 2D Convex Hull for MSIMD and CUDA.
Manuscript.
- Tomasz Jurkiewicz: MSIMD as a Practical Model for Computations on Multicores with External Memory.
Manuscript.
