default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Langr
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Daniel Langr
, Tomás Dytrych:
Parallel multithreaded deduplication of data sequences in nuclear structure calculations. Int. J. High Perform. Comput. Appl. 38(1): 5-16 (2024)- 2022
- [j15]Daniel Langr, Klára Schovánková:
CPP11sort: A parallel quicksort based on C++ threading. Concurr. Comput. Pract. Exp. 34(4) (2022) - [j14]Alexis Mercenne, Kristina D. Launey, Tomás Dytrych, Jutta E. Escher, Sofia Quaglioni, Grigor H. Sargsyan, Daniel Langr, Jerry P. Draayer:
Efficacy of the symmetry-adapted basis for ab initio nucleon-nucleus interactions for light- and intermediate-mass nuclei. Comput. Phys. Commun. 280: 108476 (2022) - [c19]Daniel Langr, Tomás Dytrych:
Parallel Identification of Unique Sequences in Nuclear Structure Calculations. PPAM (2) 2022: 357-369 - 2021
- [j13]Tomás Dytrych, Daniel Langr, Jerry P. Draayer, Kristina D. Launey, Daniel Gazda:
SU3lib: A C++ library for accurate computation of Wigner and Racah coefficients of SU(3). Comput. Phys. Commun. 269: 108137 (2021) - 2020
- [j12]Daniel Langr, Martin Kocicka:
Reducing the Impact of Intensive Dynamic Memory Allocations in Parallel Multi-Threaded Programs. IEEE Trans. Parallel Distributed Syst. 31(5): 1152-1164 (2020) - [c18]Ivan Simecek, Claudio Kozický, Daniel Langr, Pavel Tvrdík:
Space-Efficient k-d Tree-Based Storage Format for Sparse Tensors. HPDC 2020: 29-33
2010 – 2019
- 2019
- [j11]Daniel Langr, Tomás Dytrych, Jerry P. Draayer, Kristina D. Launey, Pavel Tvrdík:
Efficient algorithm for representations of U(3) in U(N). Comput. Phys. Commun. 244: 442-447 (2019) - [j10]Daniel Langr, Tomás Dytrych, Kristina D. Launey, Jerry P. Draayer:
Accelerating many-nucleon basis generation for high performance computing enabled ab initio nuclear structure studies. Int. J. High Perform. Comput. Appl. 33(3) (2019) - 2018
- [j9]Daniel Langr, Ivan Simecek:
Analysis of Memory Footprints of Sparse Matrices Partitioned Into Uniformly-Sized Blocks. Scalable Comput. Pract. Exp. 19(3): 275-292 (2018) - 2017
- [c17]Daniel Langr, Ivan Simecek:
On Memory Footprints of Partitioned Sparse Matrices. FedCSIS 2017: 513-521 - [c16]Ivan Simecek, Daniel Langr, Ivan Kotenkov:
Multilayer Approach for Joint Direct and Transposed Sparse Matrix Vector Multiplication for Multithreaded CPUs. PPAM (1) 2017: 47-56 - [c15]Daniel Langr, Tomás Dytrych, Tomás Oberhuber, Frantisek Knapp:
Efficient Parallel Generation of Many-Nucleon Basis for Large-Scale Ab Initio Nuclear Structure Calculations. PPAM (2) 2017: 341-350 - 2016
- [j8]Ivan Simecek, Richard Fritsch, Daniel Langr, Róbert Lórencz:
Parallel Solver of Large Systems of Linear Inequalities Using Fourier-Motzkin Elimination. Comput. Informatics 35(6): 1307-1337 (2016) - [j7]Tomás Dytrych, Pieter Maris, Kristina D. Launey, Jerry P. Draayer, James P. Vary, Daniel Langr, Erik Saule, Mark A. Caprio, Ümit V. Çatalyürek, Masha Sosonkina:
Efficacy of the SU(3) scheme for ab initio large-scale calculations beyond the lightest nuclei. Comput. Phys. Commun. 207: 202-210 (2016) - [j6]Daniel Langr, Pavel Tvrdík, Ivan Simecek:
AQsort: Scalable Multi-Array In-Place Sorting with OpenMP. Scalable Comput. Pract. Exp. 17(4): 369-391 (2016) - [j5]Daniel Langr, Pavel Tvrdík:
Evaluation Criteria for Sparse Matrix Storage Formats. IEEE Trans. Parallel Distributed Syst. 27(2): 428-440 (2016) - [c14]Daniel Langr, Ivan Simecek, Tomás Dytrych:
Block Iterators for Sparse Matrices. FedCSIS 2016: 695-704 - [c13]Ivan Simecek, Daniel Langr:
Efficient parallel evaluation of block properties of sparse matrices. FedCSIS 2016: 709-716 - [i3]Daniel Langr:
On Memory Footprints of Partitioned Sparse Matrices. CoRR abs/1609.04585 (2016) - 2015
- [j4]Daniel Langr, Pavel Tvrdík, Ivan Simecek, Tomás Dytrych:
Downsampling Algorithms for Large Sparse Matrices. Int. J. Parallel Program. 43(5): 679-702 (2015) - [c12]Ivan Simecek, Daniel Langr:
Space and Execution Efficient Formats for Modern Processor Architectures. SYNASC 2015: 98-105 - 2014
- [j3]Daniel Langr, Ivan Simecek, Pavel Tvrdík, Tomás Dytrych:
Large-Scale Visualization of Sparse Matrices. Scalable Comput. Pract. Exp. 15(1) (2014) - [j2]Ivan Simecek, Daniel Langr:
Tree-based Space Efficient Formats for Storing the Structure of Sparse Matrices. Scalable Comput. Pract. Exp. 15(1) (2014) - [j1]Daniel Langr, Pavel Tvrdík, Tomás Dytrych, Jerry P. Draayer:
Algorithm 947: Paraperm - Parallel Generation of Random Permutations with MPI. ACM Trans. Math. Softw. 41(1): 5:1-5:26 (2014) - [c11]Ivan Simecek, Daniel Langr, Jan Trdlicka:
Efficient Converting of Large Sparse Matrices to Quadtree Format. SYNASC 2014: 122-129 - [i2]Daniel Langr, Ivan Simecek, Pavel Tvrdík:
Loading Large Sparse Matrices Stored in Files in the Adaptive-Blocking Hierarchical Storage Format. CoRR abs/1412.8299 (2014) - 2013
- [c10]Daniel Langr, Ivan Simecek, Pavel Tvrdík:
Storing Sparse Matrices to Files in the Adaptive-Blocking Hierarchical Storage Format. FedCSIS 2013: 479-486 - [c9]Daniel Langr, Ivan Simecek, Pavel Tvrdík, Tomás Dytrych:
Scalable Parallel Generation of Very Large Sparse Benchmark Matrices. PPAM (1) 2013: 178-187 - [c8]Ivan Simecek, Daniel Langr, Erik Srnec:
The Study of Impact of Matrix-Processor Mapping on the Parallel Sparse Matrix-Vector Multiplication. SYNASC 2013: 321-328 - [c7]Daniel Langr, Ivan Simecek, Pavel Tvrdík, Tomás Dytrych:
Parallel Data Acquisition for Visualization of Very Large Sparse Matrices. SYNASC 2013: 336-343 - [c6]Ivan Simecek, Daniel Langr, Pavel Tvrdík:
Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures. SYNASC 2013: 344-351 - [i1]Daniel Langr, Pavel Tvrdík, Tomás Dytrych, Jerry P. Draayer:
Fake Run-Time Selection of Template Arguments in C++. CoRR abs/1306.5142 (2013) - 2012
- [c5]Daniel Langr, Ivan Simecek, Pavel Tvrdík, Tomás Dytrych, Jerry P. Draayer:
Adaptive-Blocking Hierarchical Storage Format for Sparse Matrices. FedCSIS 2012: 545-551 - [c4]Ivan Simecek, Daniel Langr, Pavel Tvrdík:
Space-efficient Sparse Matrix Storage Formats for Massively Parallel Systems. HPCC-ICESS 2012: 54-60 - [c3]Ivan Simecek, Daniel Langr, Pavel Tvrdík:
Minimal Quadtree Format for Compression of Sparse Matrices Storage. SYNASC 2012: 359-364 - [c2]Daniel Langr, Pavel Tvrdík, Tomás Dytrych, Jerry P. Draayer:
Fake Run-Time Selection of Template Arguments in C++. TOOLS (50) 2012: 140-154
2000 – 2009
- 2005
- [c1]Martin Kacer, Daniel Langr, Pavel Tvrdík:
Clondike: Linux cluster of non-dedicated workstations. CCGRID 2005: 574-581
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
