We stand with Ukraine

We stand with Ukraine

Ivan Simecek

Orcid: 0000-0002-8948-8721

According to our database¹, Ivan Simecek authored at least 39 papers between 2003 and 2023.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of five.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on orcid.org

On csauthors.net:

Bibliography

2023

Design of a modern fast Fourier transform and cache effective bit-reversal algorithm.

[BibT_eX]

[DOI]

,

Int. J. Parallel Emergent Distributed Syst., May, 2023

A parallel algorithm for approximating the silhouette using a ball tree.

[BibT_eX]

[DOI]

,

Claudio Kozický

J. Parallel Distributed Comput., March, 2023

2021

Joint direct and transposed sparse matrix-vector multiplication for multithreaded CPUs.

[BibT_eX]

[DOI]

Claudio Kozický

,

Concurr. Comput. Pract. Exp., 2021

2020

Space-Efficient k-d Tree-Based Storage Format for Sparse Tensors.

[BibT_eX]

[DOI]

,

Claudio Kozický

,

,

Proceedings of the HPDC '20: The 29th International Symposium on High-Performance Parallel and Distributed Computing, 2020

2018

Analysis of Memory Footprints of Sparse Matrices Partitioned Into Uniformly-Sized Blocks.

[BibT_eX]

[DOI]

,

Scalable Comput. Pract. Exp., 2018

Improved Corners with Multi-Channel Signed Distance Fields.

[BibT_eX]

[DOI]

Viktor Chlumský

,

,

Comput. Graph. Forum, 2018

2017

Effective Construction of Convex Hull Algorithms.

[BibT_eX]

[DOI]

,

,

Proceedings of the 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2017

Multilayer Approach for Joint Direct and Transposed Sparse Matrix Vector Multiplication for Multithreaded CPUs.

[BibT_eX]

[DOI]

,

,

Proceedings of the Parallel Processing and Applied Mathematics, 2017

On Memory Footprints of Partitioned Sparse Matrices.

[BibT_eX]

[DOI]

,

Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, 2017

2016

AQsort: Scalable Multi-Array In-Place Sorting with OpenMP.

[BibT_eX]

[DOI]

,

,

Scalable Comput. Pract. Exp., 2016

Parallel Solver of Large Systems of Linear Inequalities Using Fourier-Motzkin Elimination.

[BibT_eX]

[DOI]

,

Richard Fritsch

,

,

Róbert Lórencz

Comput. Informatics, 2016

Efficient parallel evaluation of block properties of sparse matrices.

[BibT_eX]

[DOI]

,

Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, 2016

Block Iterators for Sparse Matrices.

[BibT_eX]

[DOI]

,

,

Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, 2016

2015

Downsampling Algorithms for Large Sparse Matrices.

[BibT_eX]

[DOI]

,

,

,

Int. J. Parallel Program., 2015

Space and Execution Efficient Formats for Modern Processor Architectures.

[BibT_eX]

[DOI]

,

Proceedings of the 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2015

GPU Solver for Systems of Linear Equations with Infinite Precision.

[BibT_eX]

[DOI]

,

,

Róbert Lórencz

Proceedings of the 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2015

2014

Tree-based Space Efficient Formats for Storing the Structure of Sparse Matrices.

[BibT_eX]

[DOI]

,

Scalable Comput. Pract. Exp., 2014

Large-Scale Visualization of Sparse Matrices.

[BibT_eX]

[DOI]

,

,

,

Scalable Comput. Pract. Exp., 2014

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

[BibT_eX]

[DOI]

,

,

CoRR, 2014

A new code transformation technique for nested loops.

[BibT_eX]

[DOI]

,

Comput. Sci. Inf. Syst., 2014

Efficient Converting of Large Sparse Matrices to Quadtree Format.

[BibT_eX]

[DOI]

,

,

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.

[BibT_eX]

[DOI]

,

,

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.

[BibT_eX]

[DOI]

,

,

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.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

Scalable Parallel Generation of Very Large Sparse Benchmark Matrices.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Parallel Processing and Applied Mathematics, 2013

Dynamic loop reversal - the new code transformation technique.

[BibT_eX]

[DOI]

,

Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

Storing Sparse Matrices to Files in the Adaptive-Blocking Hierarchical Storage Format.

[BibT_eX]

[DOI]

,

,

Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

2012

Minimal Quadtree Format for Compression of Sparse Matrices Storage.

[BibT_eX]

[DOI]

,

,

Proceedings of the 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2012

A New Approach for Indexing Powder Diffraction Data Suitable for GPGPU Execution.

[BibT_eX]

[DOI]

Proceedings of the Soft Computing Models in Industrial and Environmental Applications, 2012

Space-efficient Sparse Matrix Storage Formats for Massively Parallel Systems.

[BibT_eX]

[DOI]

,

,

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.

[BibT_eX]

[DOI]

,

,

,

,

Jerry P. Draayer

Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

A New Approach for Indexing Powder Diffraction Data Based on Dichotomy Method.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE International Conference on Computational Science and Engineering, 2012

2009

Sparse Matrix Computations Using the Quadtree Storage Format.

[BibT_eX]

[DOI]

Proceedings of the 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2009

2007

Sparse Matrix-Vector Multiplication - Final Solution?.

[BibT_eX]

[DOI]

,

Proceedings of the Parallel Processing and Applied Mathematics, 2007

2006

A New Approach for Accelerating the Sparse Matrix-Vector Multiplication.

[BibT_eX]

[DOI]

,

Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2006), 2006

2005

A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices.

[BibT_eX]

[DOI]

,

Proceedings of the Parallel Processing and Applied Mathematics, 2005

2004

Performance Optimization and Evaluation for Linear Codes.

[BibT_eX]

[DOI]

,

Proceedings of the Numerical Analysis and Its Applications, Third International Conference, 2004

Analytical Model for Analysis of Cache Behavior during Cholesky Factorization and Its Variants.

[BibT_eX]

[DOI]

,

Proceedings of the 33rd International Conference on Parallel Processing Workshops (ICPP 2004 Workshops), 2004

2003

Analytical Modeling of Optimized Sparse Linear Code.

[BibT_eX]

[DOI]

,

Proceedings of the Parallel Processing and Applied Mathematics, 2003

Loading...