On Incomplete Hypercubes. - Pavel Tvrdík (CONPAR, 1992)

Necklaces and scalability of Kautz digraphs. - Pavel Tvrdík (SPDP, 1994)

PVM, Computational Geometry, and Parallel Computing Course. - Michal Soch; Jan Trdlicka; Pavel Tvrdík (PVM, 1996)

Necklace-based Factorization of de Bruijn Digraphs. - Pavel Tvrdík (SIROCCO, 1996)

Embedding of k-ary complete trees into hypercubes with optimal load. - Jan Trdlicka; Pavel Tvrdík (SPDP, 1996)

Optimal Gossip in Store-and-Forward Noncombining 2-D Tori. - Michal Soch; Pavel Tvrdík (Euro-Par, 1997)

Embedding Complete k-ary Trees into 2-dimensional Meshes and Tori. - Jan Trdlicka; Pavel Tvrdík (Euro-Par, 1997)

Parallel Graph-Partitioning Using the Mob Heuristic. - Michal Soch; Pavel Tvrdík; Martin Volf (PVM/MPI, 1997)

Optimal gossip in noncombining 2D-meshes. - Michal Soch; Pavel Tvrdík (SIROCCO, 1997)

All-to-all Scatter in Kautz Networks. - Petr Salinger; Pavel Tvrdík (Euro-Par, 1998)

Time-Optimal Gossip in Noncombining 2-D Tori with Constant Buffers. - Michal Soch; Pavel Tvrdík (Euro-Par, 1998)

Decompositions of de Bruijn Networks. - Pavel Kopriva; Pavel Tvrdík (ICPADS, 1998)

Time-optimal gossip in noncombining 3-D tori. - Michal Soch; Pavel Tvrdík (SIROCCO, 1998)

Bisecting De Bruijn and Kautz Graphs. - José D. P. Rolim; Pavel Tvrdík; Jan Trdlicka; Imrich Vrto (Discret. Appl. Math., 1998)

Uniform homomorphisms of de Bruijn and Kautz networks. - Pavel Tvrdík; Rabah Harbane; Marie-Claude Heydemann (Discret. Appl. Math., 1998)

Embedding of k-ary Complete Trees into Hypercubes with Uniform Load. - Jan Trdlicka; Pavel Tvrdík (J. Parallel Distributed Comput., 1998)

Optimal k-ary Divide and Conquer Computations on Wormhole 2-D and 3-D Meshes. - Jan Trdlicka; Pavel Tvrdík (HiPC, 1999)

Time-Optimal Gossip of Large Packets in Noncombining 2D Tori and Meshes. - Michal Soch; Pavel Tvrdík (IEEE Trans. Parallel Distributed Syst., 1999)

Broadcasting in All-Port Wormhole 3-D Meshes of Trees (Research Note). - Petr Salinger; Pavel Tvrdík (Euro-Par, 2000)

Optimal Broadcasting in All-Port Meshes of Trees with Distance-Insensitive Routing. - Petr Salinger; Pavel Tvrdík (IPDPS, 2000)

Embedding complete k-ary trees into k-square 2-D meshes with optimal edge congestion. - Jan Trdlicka; Pavel Tvrdík (Parallel Comput., 2000)

A Parallel Algorithm for Connected Components on Distributed Memory Machines. - Libor Bus; Pavel Tvrdík (PVM/MPI, 2001)

Broadcasting in all-output-port cube-connected cycles with distance-insensitive routing. - Petr Salinger; Pavel Tvrdík (SIROCCO, 2001)

All-to-All Scatter in de Bruijn and Kautz Networks. - Petr Salinger; Pavel Tvrdík (Comput. Artif. Intell., 2001)

Load Balancing by Remote Execution of Short Processes on Linux Clusters. - Martin Kacer; Pavel Tvrdík (CCGRID, 2002)

Intelligent Mobile Agent Based E-Auctions. - Tomas Liska; Pavel Tvrdík (ICWI, 2002)

Distributed Memory Auction Algorithms for the Linear Assignment Problem. - Libor Bus; Pavel Tvrdík (IASTED PDCS, 2002)

Broadcasting in All-Output-Port Meshes of Trees with Distance-Insensitive Switching. - Petr Salinger; Pavel Tvrdík (J. Parallel Distributed Comput., 2002)

Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing. - Petr Salinger; Pavel Tvrdík (Parallel Comput., 2002)

MOOSS: CPU Architecture with Memory Protection and Support for OOP. - Radim Ballner; Pavel Tvrdík (Asia-Pacific Computer Systems Architecture Conference, 2003)

Analytical Modeling of Optimized Sparse Linear Code. - Pavel Tvrdík; Ivan Simecek (PPAM, 2003)

Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method. - Ondrej Medek; Pavel Tvrdík; Jaroslav Kruis (Euro-Par, 2004)

Variable Reordering for a Parallel Envelope Method. - Ondrej Medek; Pavel Tvrdík (ICPP Workshops, 2004)

Analytical Model for Analysis of Cache Behavior during Cholesky Factorization and Its Variants. - Ivan Simecek; Pavel Tvrdík (ICPP Workshops, 2004)

Performance Optimization and Evaluation for Linear Codes. - Pavel Tvrdík; Ivan Simecek (NAA, 2004)

Clondike: Linux cluster of non-dedicated workstations. - Martin Kacer; Daniel Langr; Pavel Tvrdík (CCGRID, 2005)

Quality Balancing Heuristics with Three Variants of Sloan Algorithm. - Ondrej Medek; Pavel Tvrdík (Parallel and Distributed Computing and Networks, 2005)

A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices. - Pavel Tvrdík; Ivan Simecek (PPAM, 2005)

A New Approach for Accelerating the Sparse Matrix-Vector Multiplication. - Pavel Tvrdík; Ivan Simecek (SYNASC, 2006)

Broadcasting in all-output-port cube-connected cycles with distance-insensitive switching. - Petr Salinger; Pavel Tvrdík (J. Parallel Distributed Comput., 2006)

System for trading processors' quanta on a digital market. - Michal Kostal; Pavel Tvrdík (PDCS, 2007)

File System Security in the Environment of Non-dedicated Computer Clusters. - Martin Stáva; Pavel Tvrdík (PDCAT, 2007)

Sparse Matrix-Vector Multiplication - Final Solution?. - Ivan Simecek; Pavel Tvrdík (PPAM, 2007)

Market-Based Batch System. - Michal Kostal; Pavel Tvrdík (ICDS, 2009)

Security System for Overlapping Non-dedicated Clusters. - Martin Stáva; Pavel Tvrdík (ISPA, 2009)

Towards auction algorithms for large dense assignment problems. - Libor Bus; Pavel Tvrdík (Comput. Optim. Appl., 2009)

Multi-core Code in a Cluster - A Meaningful Option? - Martin Stáva; Pavel Tvrdík (GPC, 2010)

Adaptive-Blocking Hierarchical Storage Format for Sparse Matrices. - Daniel Langr; Ivan Simecek; Pavel Tvrdík; Tomás Dytrych; Jerry P. Draayer (FedCSIS, 2012)

Space-efficient Sparse Matrix Storage Formats for Massively Parallel Systems. - Ivan Simecek; Daniel Langr; Pavel Tvrdík (HPCC-ICESS, 2012)

Different Approaches to Distributed Compilation. - Josef Gattermayer; Pavel Tvrdík (IPDPS Workshops, 2012)

Minimal Quadtree Format for Compression of Sparse Matrices Storage. - Ivan Simecek; Daniel Langr; Pavel Tvrdík (SYNASC, 2012)

Fake Run-Time Selection of Template Arguments in C++. - Daniel Langr; Pavel Tvrdík; Tomás Dytrych; Jerry P. Draayer (TOOLS (50), 2012)

Storing Sparse Matrices to Files in the Adaptive-Blocking Hierarchical Storage Format. - Daniel Langr; Ivan Simecek; Pavel Tvrdík (FedCSIS, 2013)

Dynamic loop reversal - the new code transformation technique. - Ivan Simecek; Pavel Tvrdík (FedCSIS, 2013)

Scalable Parallel Generation of Very Large Sparse Benchmark Matrices. - Daniel Langr; Ivan Simecek; Pavel Tvrdík; Tomás Dytrych (PPAM (1), 2013)

Parallel Data Acquisition for Visualization of Very Large Sparse Matrices. - Daniel Langr; Ivan Simecek; Pavel Tvrdík; Tomás Dytrych (SYNASC, 2013)

Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures. - Ivan Simecek; Daniel Langr; Pavel Tvrdík (SYNASC, 2013)

A new code transformation technique for nested loops. - Ivan Simecek; Pavel Tvrdík (Comput. Sci. Inf. Syst., 2014)

Loading Large Sparse Matrices Stored in Files in the Adaptive-Blocking Hierarchical Storage Format. - Daniel Langr; Ivan Simecek; Pavel Tvrdík (CoRR, 2014)

Large-Scale Visualization of Sparse Matrices. - Daniel Langr; Ivan Simecek; Pavel Tvrdík; Tomás Dytrych (Scalable Comput. Pract. Exp., 2014)

Algorithm 947: Paraperm - Parallel Generation of Random Permutations with MPI. - Daniel Langr; Pavel Tvrdík; Tomás Dytrych; Jerry P. Draayer (ACM Trans. Math. Softw., 2014)

Downsampling Algorithms for Large Sparse Matrices. - Daniel Langr; Pavel Tvrdík; Ivan Simecek; Tomás Dytrych (Int. J. Parallel Program., 2015)

AQsort: Scalable Multi-Array In-Place Sorting with OpenMP. - Daniel Langr; Pavel Tvrdík; Ivan Simecek (Scalable Comput. Pract. Exp., 2016)

Evaluation Criteria for Sparse Matrix Storage Formats. - Daniel Langr; Pavel Tvrdík (IEEE Trans. Parallel Distributed Syst., 2016)

Blockchain-Based Multi-Level Scoring System for P2P Clusters. - Josef Gattermayer; Pavel Tvrdík (ICPP Workshops, 2017)

Application of neural networks for decision making and evaluation of trust in ad-hoc networks. - Yelena Trofimova; Alexandru Mihnea Moucha; Pavel Tvrdík (IWCMC, 2017)

Using Bootstraping Principles of Contemporary P2P File-Sharing Protocols in Large-Scale Grid Computing Systems. - Josef Gattermayer; Pavel Tvrdík (PDP, 2017)

Time Series Cube Data Model. - Jirí Nádvorník; Petr Skoda 004; Dave Morris; Pavel Tvrdík (CoRR, 2017)

Efficient algorithm for representations of U(3) in U(N). - Daniel Langr; Tomás Dytrych; Jerry P. Draayer; Kristina D. Launey; Pavel Tvrdík (Comput. Phys. Commun., 2019)

Space-Efficient k-d Tree-Based Storage Format for Sparse Tensors. - Ivan Simecek; Claudio Kozický; Daniel Langr; Pavel Tvrdík (HPDC, 2020)

Active deep learning method for the discovery of objects of interest in large spectroscopic surveys. - Petr Skoda 004; Ondrej Podsztavek; Pavel Tvrdík (CoRR, 2020)

HiSS-Cube: A scalable framework for Hierarchical Semi-Sparse Cubes preserving uncertainties. - Jirí Nádvorník; Petr Skoda 004; Pavel Tvrdík (Astron. Comput., 2021)

Spectroscopic redshift determination with Bayesian convolutional networks. - Ondrej Podsztavek; Petr Skoda 004; Pavel Tvrdík (Astron. Comput., 2022)

Enhancing Reactive Ad Hoc Routing Protocols with Trust. - Yelena Trofimova; Pavel Tvrdík (Future Internet, 2022)

Efficient fuzz testing of web services. - Matús Ferech; Pavel Tvrdík (QRS, 2023)

Hierarchical Semi-Sparse Cubes - Parallel Framework for Storing Multi-Modal Big Data in HDF5. - Jirí Nádvorník; Petr Skoda 004; Pavel Tvrdík (IEEE Access, 2023)

Real Data Center Network Traffic Dataset and Analysis. - Michal Polak; Daniel Sedlak; Jan Fesl; Pavel Tvrdík (CloudNet, 2024)

Automatic Miscalibration Diagnosis: Interpreting Probability Integral Transform (PIT) Histograms. - Ondrej Podsztavek; Alexander I. Jordan; Pavel Tvrdík; Kai Lars Polsterer (ESANN, 2024)

Data center network monitoring framework. - Daniel Sedlak; Michal Polak; Jan Fesl; Pavel Tvrdík (IC2E, 2024)