Pavel Tvrdík

Publication Activity (10 Years)

Years Active: 1992-2023
Publications (10 Years): 15

Top Topics

Computing Systems

Sparse Matrices

Top Venues

Astron. Comput.

Scalable Comput. Pract. Exp.

Comput. Sci. Inf. Syst.

Publications

Matús Ferech, Pavel Tvrdík
Efficient fuzz testing of web services. QRS (2023)
Jirí Nádvorník, Petr Skoda, Pavel Tvrdík
Hierarchical Semi-Sparse Cubes - Parallel Framework for Storing Multi-Modal Big Data in HDF5. IEEE Access 11 (2023)
Yelena Trofimova, Pavel Tvrdík
Enhancing Reactive Ad Hoc Routing Protocols with Trust. Future Internet 14 (1) (2022)
Ondrej Podsztavek, Petr Skoda, Pavel Tvrdík
Spectroscopic redshift determination with Bayesian convolutional networks. Astron. Comput. 40 (2022)
Jirí Nádvorník, Petr Skoda, Pavel Tvrdík
HiSS-Cube: A scalable framework for Hierarchical Semi-Sparse Cubes preserving uncertainties. Astron. Comput. 36 (2021)
Ivan Simecek, Claudio Kozický, Daniel Langr, Pavel Tvrdík
Space-Efficient k-d Tree-Based Storage Format for Sparse Tensors. HPDC (2020)
Petr Skoda, Ondrej Podsztavek, Pavel Tvrdík
Active deep learning method for the discovery of objects of interest in large spectroscopic surveys. CoRR (2020)
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 (2019)
Josef Gattermayer, Pavel Tvrdík
Blockchain-Based Multi-Level Scoring System for P2P Clusters. ICPP Workshops (2017)
Jirí Nádvorník, Petr Skoda, Dave Morris, Pavel Tvrdík
Time Series Cube Data Model. CoRR (2017)
Josef Gattermayer, Pavel Tvrdík
Using Bootstraping Principles of Contemporary P2P File-Sharing Protocols in Large-Scale Grid Computing Systems. PDP (2017)
Yelena Trofimova, Alexandru Mihnea Moucha, Pavel Tvrdík
Application of neural networks for decision making and evaluation of trust in ad-hoc networks. IWCMC (2017)
Daniel Langr, Pavel Tvrdík
Evaluation Criteria for Sparse Matrix Storage Formats. IEEE Trans. Parallel Distributed Syst. 27 (2) (2016)
Daniel Langr, Pavel Tvrdík, Ivan Simecek
AQsort: Scalable Multi-Array In-Place Sorting with OpenMP. Scalable Comput. Pract. Exp. 17 (4) (2016)
Daniel Langr, Pavel Tvrdík, Ivan Simecek, Tomás Dytrych
Downsampling Algorithms for Large Sparse Matrices. Int. J. Parallel Program. 43 (5) (2015)
Daniel Langr, Ivan Simecek, Pavel Tvrdík
Loading Large Sparse Matrices Stored in Files in the Adaptive-Blocking Hierarchical Storage Format. CoRR (2014)
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) (2014)
Daniel Langr, Ivan Simecek, Pavel Tvrdík, Tomás Dytrych
Large-Scale Visualization of Sparse Matrices. Scalable Comput. Pract. Exp. 15 (1) (2014)
Ivan Simecek, Pavel Tvrdík
A new code transformation technique for nested loops. Comput. Sci. Inf. Syst. 11 (4) (2014)
Daniel Langr, Ivan Simecek, Pavel Tvrdík, Tomás Dytrych
Parallel Data Acquisition for Visualization of Very Large Sparse Matrices. SYNASC (2013)
Ivan Simecek, Pavel Tvrdík
Dynamic loop reversal - the new code transformation technique. FedCSIS (2013)
Daniel Langr, Pavel Tvrdík, Tomás Dytrych, Jerry P. Draayer
Fake Run-Time Selection of Template Arguments in C++. CoRR (2013)
Ivan Simecek, Daniel Langr, Pavel Tvrdík
Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures. SYNASC (2013)
Daniel Langr, Ivan Simecek, Pavel Tvrdík, Tomás Dytrych
Scalable Parallel Generation of Very Large Sparse Benchmark Matrices. PPAM (1) (2013)
Daniel Langr, Ivan Simecek, Pavel Tvrdík
Storing Sparse Matrices to Files in the Adaptive-Blocking Hierarchical Storage Format. FedCSIS (2013)
Ivan Simecek, Daniel Langr, Pavel Tvrdík
Space-efficient Sparse Matrix Storage Formats for Massively Parallel Systems. HPCC-ICESS (2012)
Josef Gattermayer, Pavel Tvrdík
Different Approaches to Distributed Compilation. IPDPS Workshops (2012)
Ivan Simecek, Daniel Langr, Pavel Tvrdík
Minimal Quadtree Format for Compression of Sparse Matrices Storage. SYNASC (2012)
Daniel Langr, Pavel Tvrdík, Tomás Dytrych, Jerry P. Draayer
Fake Run-Time Selection of Template Arguments in C++. TOOLS (50) (2012)
Daniel Langr, Ivan Simecek, Pavel Tvrdík, Tomás Dytrych, Jerry P. Draayer
Adaptive-Blocking Hierarchical Storage Format for Sparse Matrices. FedCSIS (2012)
Martin Stáva, Pavel Tvrdík
Multi-core Code in a Cluster - A Meaningful Option? GPC (2010)
Martin Stáva, Pavel Tvrdík
Security System for Overlapping Non-dedicated Clusters. ISPA (2009)
Michal Kostal, Pavel Tvrdík
Market-Based Batch System. ICDS (2009)
Libor Bus, Pavel Tvrdík
Towards auction algorithms for large dense assignment problems. Comput. Optim. Appl. 43 (3) (2009)
Martin Stáva, Pavel Tvrdík
File System Security in the Environment of Non-dedicated Computer Clusters. PDCAT (2007)
Michal Kostal, Pavel Tvrdík
System for trading processors' quanta on a digital market. PDCS (2007)
Ivan Simecek, Pavel Tvrdík
Sparse Matrix-Vector Multiplication - Final Solution?. PPAM (2007)
Petr Salinger, Pavel Tvrdík
Broadcasting in all-output-port cube-connected cycles with distance-insensitive switching. J. Parallel Distributed Comput. 66 (8) (2006)
Pavel Tvrdík, Ivan Simecek
A New Approach for Accelerating the Sparse Matrix-Vector Multiplication. SYNASC (2006)
Martin Kacer, Daniel Langr, Pavel Tvrdík
Clondike: Linux cluster of non-dedicated workstations. CCGRID (2005)
Ondrej Medek, Pavel Tvrdík
Quality Balancing Heuristics with Three Variants of Sloan Algorithm. Parallel and Distributed Computing and Networks (2005)
Pavel Tvrdík, Ivan Simecek
A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices. PPAM (2005)
Pavel Tvrdík, Ivan Simecek
Performance Optimization and Evaluation for Linear Codes. NAA (2004)
Ondrej Medek, Pavel Tvrdík
Variable Reordering for a Parallel Envelope Method. ICPP Workshops (2004)
Ivan Simecek, Pavel Tvrdík
Analytical Model for Analysis of Cache Behavior during Cholesky Factorization and Its Variants. ICPP Workshops (2004)
Ondrej Medek, Pavel Tvrdík, Jaroslav Kruis
Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method. Euro-Par (2004)
Radim Ballner, Pavel Tvrdík
MOOSS: CPU Architecture with Memory Protection and Support for OOP. Asia-Pacific Computer Systems Architecture Conference (2003)
Pavel Tvrdík, Ivan Simecek
Analytical Modeling of Optimized Sparse Linear Code. PPAM (2003)
Martin Kacer, Pavel Tvrdík
Load Balancing by Remote Execution of Short Processes on Linux Clusters. CCGRID (2002)
Libor Bus, Pavel Tvrdík
Distributed Memory Auction Algorithms for the Linear Assignment Problem. IASTED PDCS (2002)
Petr Salinger, Pavel Tvrdík
Broadcasting in All-Output-Port Meshes of Trees with Distance-Insensitive Switching. J. Parallel Distributed Comput. 62 (8) (2002)
Petr Salinger, Pavel Tvrdík
Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing. Parallel Comput. 28 (4) (2002)
Tomas Liska, Pavel Tvrdík
Intelligent Mobile Agent Based E-Auctions. ICWI (2002)
Libor Bus, Pavel Tvrdík
A Parallel Algorithm for Connected Components on Distributed Memory Machines. PVM/MPI (2001)
Petr Salinger, Pavel Tvrdík
Broadcasting in all-output-port cube-connected cycles with distance-insensitive routing. SIROCCO (2001)
Petr Salinger, Pavel Tvrdík
All-to-All Scatter in de Bruijn and Kautz Networks. Comput. Artif. Intell. 20 (4) (2001)
Petr Salinger, Pavel Tvrdík
Broadcasting in All-Port Wormhole 3-D Meshes of Trees (Research Note). Euro-Par (2000)
Jan Trdlicka, Pavel Tvrdík
Embedding complete k-ary trees into k-square 2-D meshes with optimal edge congestion. Parallel Comput. 26 (6) (2000)
Petr Salinger, Pavel Tvrdík
Optimal Broadcasting in All-Port Meshes of Trees with Distance-Insensitive Routing. IPDPS (2000)
Michal Soch, Pavel Tvrdík
Time-Optimal Gossip of Large Packets in Noncombining 2D Tori and Meshes. IEEE Trans. Parallel Distributed Syst. 10 (12) (1999)
Jan Trdlicka, Pavel Tvrdík
Optimal k-ary Divide and Conquer Computations on Wormhole 2-D and 3-D Meshes. HiPC (1999)
José D. P. Rolim, Pavel Tvrdík, Jan Trdlicka, Imrich Vrto
Bisecting De Bruijn and Kautz Graphs. Discret. Appl. Math. 85 (1) (1998)
Michal Soch, Pavel Tvrdík
Time-optimal gossip in noncombining 3-D tori. SIROCCO (1998)
Petr Salinger, Pavel Tvrdík
All-to-all Scatter in Kautz Networks. Euro-Par (1998)
Pavel Kopriva, Pavel Tvrdík
Decompositions of de Bruijn Networks. ICPADS (1998)
Jan Trdlicka, Pavel Tvrdík
Embedding of k-ary Complete Trees into Hypercubes with Uniform Load. J. Parallel Distributed Comput. 52 (2) (1998)
Michal Soch, Pavel Tvrdík
Time-Optimal Gossip in Noncombining 2-D Tori with Constant Buffers. Euro-Par (1998)
Pavel Tvrdík, Rabah Harbane, Marie-Claude Heydemann
Uniform homomorphisms of de Bruijn and Kautz networks. Discret. Appl. Math. 83 (1-3) (1998)
Michal Soch, Pavel Tvrdík, Martin Volf
Parallel Graph-Partitioning Using the Mob Heuristic. PVM/MPI (1997)
Michal Soch, Pavel Tvrdík
Optimal Gossip in Store-and-Forward Noncombining 2-D Tori. Euro-Par (1997)
Michal Soch, Pavel Tvrdík
Optimal gossip in noncombining 2D-meshes. SIROCCO (1997)
Jan Trdlicka, Pavel Tvrdík
-ary Trees into 2-dimensional Meshes and Tori. Euro-Par (1997)
Michal Soch, Jan Trdlicka, Pavel Tvrdík
PVM, Computational Geometry, and Parallel Computing Course. PVM (1996)
Pavel Tvrdík
Necklace-based Factorization of de Bruijn Digraphs. SIROCCO (1996)
Jan Trdlicka, Pavel Tvrdík
Embedding of k-ary complete trees into hypercubes with optimal load. SPDP (1996)
José D. P. Rolim, Pavel Tvrdík, Jan Trdlicka, Imrich Vrto
Bisecting de Bruijn and Kautz Graphs. SIROCCO (1995)
Pavel Tvrdík
Necklaces and scalability of Kautz digraphs. SPDP (1994)
Pavel Tvrdík
On Incomplete Hypercubes. CONPAR (1992)