Pavel Tvrdík

Orcid: 0000-0002-7195-4579

Affiliations:
  • Czech Technical University in Prague, Faculty of Information Technology, Czech Republic


According to our database1, Pavel Tvrdík authored at least 77 papers between 1992 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Data center network monitoring framework.
Proceedings of the IEEE International Conference on Cloud Engineering, 2024

2023
Hierarchical Semi-Sparse Cubes - Parallel Framework for Storing Multi-Modal Big Data in HDF5.
IEEE Access, 2023

Efficient fuzz testing of web services.
Proceedings of the 23rd IEEE International Conference on Software Quality, 2023

2022
Enhancing Reactive Ad Hoc Routing Protocols with Trust.
Future Internet, 2022

Spectroscopic redshift determination with Bayesian convolutional networks.
Astron. Comput., 2022

2021
HiSS-Cube: A scalable framework for Hierarchical Semi-Sparse Cubes preserving uncertainties.
Astron. Comput., 2021

2020
Active deep learning method for the discovery of objects of interest in large spectroscopic surveys.
CoRR, 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
Efficient algorithm for representations of U(3) in U(N).
Comput. Phys. Commun., 2019

2017
Time Series Cube Data Model.
CoRR, 2017

Using Bootstraping Principles of Contemporary P2P File-Sharing Protocols in Large-Scale Grid Computing Systems.
Proceedings of the 25th Euromicro International Conference on Parallel, 2017

Application of neural networks for decision making and evaluation of trust in ad-hoc networks.
Proceedings of the 13th International Wireless Communications and Mobile Computing Conference, 2017

Blockchain-Based Multi-Level Scoring System for P2P Clusters.
Proceedings of the 46th International Conference on Parallel Processing Workshops, 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

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

2014
Algorithm 947: Paraperm - Parallel Generation of Random Permutations with MPI.
ACM Trans. Math. Softw., 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

A new code transformation technique for nested loops.
Comput. Sci. Inf. Syst., 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

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

Dynamic loop reversal - the new code transformation technique.
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.
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

Different Approaches to Distributed Compilation.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 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

2010
Multi-core Code in a Cluster - A Meaningful Option?
Proceedings of the Advances in Grid and Pervasive Computing, 5th International Conference, 2010

2009
Towards auction algorithms for large dense assignment problems.
Comput. Optim. Appl., 2009

Security System for Overlapping Non-dedicated Clusters.
Proceedings of the IEEE International Symposium on Parallel and Distributed Processing with Applications, 2009

Market-Based Batch System.
Proceedings of the Third International Conference on the Digital Society (ICDS 2009), 2009

2007
Sparse Matrix-Vector Multiplication - Final Solution?.
Proceedings of the Parallel Processing and Applied Mathematics, 2007

File System Security in the Environment of Non-dedicated Computer Clusters.
Proceedings of the Eighth International Conference on Parallel and Distributed Computing, 2007

System for trading processors' quanta on a digital market.
Proceedings of the ISCA 20th International Conference on Parallel and Distributed Computing Systems, 2007

2006
Broadcasting in all-output-port cube-connected cycles with distance-insensitive switching.
J. Parallel Distributed Comput., 2006

A New Approach for Accelerating the Sparse Matrix-Vector Multiplication.
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.
Proceedings of the Parallel Processing and Applied Mathematics, 2005

Quality Balancing Heuristics with Three Variants of Sloan Algorithm.
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2005

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

2004
Performance Optimization and Evaluation for Linear Codes.
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.
Proceedings of the 33rd International Conference on Parallel Processing Workshops (ICPP 2004 Workshops), 2004

Variable Reordering for a Parallel Envelope Method.
Proceedings of the 33rd International Conference on Parallel Processing Workshops (ICPP 2004 Workshops), 2004

Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method.
Proceedings of the Euro-Par 2004 Parallel Processing, 2004

2003
Analytical Modeling of Optimized Sparse Linear Code.
Proceedings of the Parallel Processing and Applied Mathematics, 2003

MOOSS: CPU Architecture with Memory Protection and Support for OOP.
Proceedings of the Advances in Computer Systems Architecture, 2003

2002
Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing.
Parallel Comput., 2002

Broadcasting in All-Output-Port Meshes of Trees with Distance-Insensitive Switching.
J. Parallel Distributed Comput., 2002

Distributed Memory Auction Algorithms for the Linear Assignment Problem.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

Intelligent Mobile Agent Based E-Auctions.
Proceedings of the IADIS International Conference WWW/Internet 2002, 2002

Load Balancing by Remote Execution of Short Processes on Linux Clusters.
Proceedings of the 2nd IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2002), 2002

2001
All-to-All Scatter in de Bruijn and Kautz Networks.
Comput. Artif. Intell., 2001

Broadcasting in all-output-port cube-connected cycles with distance-insensitive routing.
Proceedings of the SIROCCO 8, 2001

A Parallel Algorithm for Connected Components on Distributed Memory Machines.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2001

2000
Embedding complete k-ary trees into k-square 2-D meshes with optimal edge congestion.
Parallel Comput., 2000

Optimal Broadcasting in All-Port Meshes of Trees with Distance-Insensitive Routing.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

Broadcasting in All-Port Wormhole 3-D Meshes of Trees (Research Note).
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1999
Time-Optimal Gossip of Large Packets in Noncombining 2D Tori and Meshes.
IEEE Trans. Parallel Distributed Syst., 1999

Optimal k-ary Divide and Conquer Computations on Wormhole 2-D and 3-D Meshes.
Proceedings of the High Performance Computing, 1999

1998
Embedding of k-ary Complete Trees into Hypercubes with Uniform Load.
J. Parallel Distributed Comput., 1998

Uniform homomorphisms of de Bruijn and Kautz networks.
Discret. Appl. Math., 1998

Bisecting De Bruijn and Kautz Graphs.
Discret. Appl. Math., 1998

Time-optimal gossip in noncombining 3-D tori.
Proceedings of the SIROCCO'98, 1998

Decompositions of de Bruijn Networks.
Proceedings of the International Conference on Parallel and Distributed Systems, 1998

Time-Optimal Gossip in Noncombining 2-D Tori with Constant Buffers.
Proceedings of the Euro-Par '98 Parallel Processing, 1998

All-to-all Scatter in Kautz Networks.
Proceedings of the Euro-Par '98 Parallel Processing, 1998

1997
Optimal gossip in noncombining 2D-meshes.
Proceedings of the SIROCCO'97, 1997

Parallel Graph-Partitioning Using the Mob Heuristic.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 1997

Embedding Complete <i>k</i>-ary Trees into 2-dimensional Meshes and Tori.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

Optimal Gossip in Store-and-Forward Noncombining 2-D Tori.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

1996
Embedding of k-ary complete trees into hypercubes with optimal load.
Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, 1996

Necklace-based Factorization of de Bruijn Digraphs.
Proceedings of the SIROCCO'96, 1996

PVM, Computational Geometry, and Parallel Computing Course.
Proceedings of the Parallel Virtual Machine, 1996

1994
Necklaces and scalability of Kautz digraphs.
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

1992
On Incomplete Hypercubes.
Proceedings of the Parallel Processing: CONPAR 92, 1992


  Loading...