Daniel Langr

Orcid: 0000-0001-9760-7068

According to our database1, Daniel Langr authored at least 37 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Parallel multithreaded deduplication of data sequences in nuclear structure calculations.
Int. J. High Perform. Comput. Appl., January, 2024

2022
Efficacy of the symmetry-adapted basis for <i>ab initio</i> nucleon-nucleus interactions for light- and intermediate-mass nuclei.
Comput. Phys. Commun., 2022

CPP11sort: A parallel quicksort based on C++ threading.
Concurr. Comput. Pract. Exp., 2022

Parallel Identification of Unique Sequences in Nuclear Structure Calculations.
Proceedings of the Parallel Processing and Applied Mathematics, 2022

2021
SU3lib: A C++ library for accurate computation of Wigner and Racah coefficients of SU(3).
Comput. Phys. Commun., 2021

2020
Reducing the Impact of Intensive Dynamic Memory Allocations in Parallel Multi-Threaded Programs.
IEEE Trans. Parallel Distributed Syst., 2020

Space-Efficient k-d Tree-Based Storage Format for Sparse Tensors.
Proceedings of the HPDC '20: The 29th International Symposium on High-Performance Parallel and Distributed Computing, 2020

2019
Accelerating many-nucleon basis generation for high performance computing enabled ab initio nuclear structure studies.
Int. J. High Perform. Comput. Appl., 2019

Efficient algorithm for representations of U(3) in U(N).
Comput. Phys. Commun., 2019

2018
Analysis of Memory Footprints of Sparse Matrices Partitioned Into Uniformly-Sized Blocks.
Scalable Comput. Pract. Exp., 2018

2017
Multilayer Approach for Joint Direct and Transposed Sparse Matrix Vector Multiplication for Multithreaded CPUs.
Proceedings of the Parallel Processing and Applied Mathematics, 2017

Efficient Parallel Generation of Many-Nucleon Basis for Large-Scale Ab Initio Nuclear Structure Calculations.
Proceedings of the Parallel Processing and Applied Mathematics, 2017

On Memory Footprints of Partitioned Sparse Matrices.
Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, 2017

2016
Evaluation Criteria for Sparse Matrix Storage Formats.
IEEE Trans. Parallel Distributed Syst., 2016

AQsort: Scalable Multi-Array In-Place Sorting with OpenMP.
Scalable Comput. Pract. Exp., 2016

Efficacy of the SU(3) scheme for ab initio large-scale calculations beyond the lightest nuclei.
Comput. Phys. Commun., 2016

On Memory Footprints of Partitioned Sparse Matrices.
CoRR, 2016

Parallel Solver of Large Systems of Linear Inequalities Using Fourier-Motzkin Elimination.
Comput. Informatics, 2016

Efficient parallel evaluation of block properties of sparse matrices.
Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, 2016

Block Iterators for Sparse Matrices.
Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, 2016

2015
Downsampling Algorithms for Large Sparse Matrices.
Int. J. Parallel Program., 2015

Space and Execution Efficient Formats for Modern Processor Architectures.
Proceedings of the 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2015

2014
Algorithm 947: Paraperm - Parallel Generation of Random Permutations with MPI.
ACM Trans. Math. Softw., 2014

Tree-based Space Efficient Formats for Storing the Structure of Sparse Matrices.
Scalable Comput. Pract. Exp., 2014

Large-Scale Visualization of Sparse Matrices.
Scalable Comput. Pract. Exp., 2014

Loading Large Sparse Matrices Stored in Files in the Adaptive-Blocking Hierarchical Storage Format.
CoRR, 2014

Efficient Converting of Large Sparse Matrices to Quadtree Format.
Proceedings of the 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2014

2013
Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures.
Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

The Study of Impact of Matrix-Processor Mapping on the Parallel Sparse Matrix-Vector Multiplication.
Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

Parallel Data Acquisition for Visualization of Very Large Sparse Matrices.
Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

Scalable Parallel Generation of Very Large Sparse Benchmark Matrices.
Proceedings of the Parallel Processing and Applied Mathematics, 2013

Storing Sparse Matrices to Files in the Adaptive-Blocking Hierarchical Storage Format.
Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

2012
Fake Run-Time Selection of Template Arguments in C++.
Proceedings of the Objects, Models, Components, Patterns - 50th International Conference, 2012

Minimal Quadtree Format for Compression of Sparse Matrices Storage.
Proceedings of the 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2012

Space-efficient Sparse Matrix Storage Formats for Massively Parallel Systems.
Proceedings of the 14th IEEE International Conference on High Performance Computing and Communication & 9th IEEE International Conference on Embedded Software and Systems, 2012

Adaptive-Blocking Hierarchical Storage Format for Sparse Matrices.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

2005
Clondike: Linux cluster of non-dedicated workstations.
Proceedings of the 5th International Symposium on Cluster Computing and the Grid (CCGrid 2005), 2005


  Loading...