default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPavel Tvrdík
Person information
- affiliation: Czech Technical University in Prague, Faculty of Information Technology, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j21]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: 119876-119897 (2023)- [c53]Matús Ferech, Pavel Tvrdík:
Efficient fuzz testing of web services. QRS 2023: 291-300 - 2022
- [j20]Ondrej Podsztavek, Petr Skoda, Pavel Tvrdík:
Spectroscopic redshift determination with Bayesian convolutional networks. Astron. Comput. 40: 100615 (2022) - [j19]Yelena Trofimova, Pavel Tvrdík:
Enhancing Reactive Ad Hoc Routing Protocols with Trust. Future Internet 14(1): 28 (2022) - 2021
- [j18]Jirí Nádvorník, Petr Skoda, Pavel Tvrdík:
HiSS-Cube: A scalable framework for Hierarchical Semi-Sparse Cubes preserving uncertainties. Astron. Comput. 36: 100463 (2021) - 2020
- [c52]Ivan Simecek, Claudio Kozický, Daniel Langr, Pavel Tvrdík:
Space-Efficient k-d Tree-Based Storage Format for Sparse Tensors. HPDC 2020: 29-33 - [i4]Petr Skoda, Ondrej Podsztavek, Pavel Tvrdík:
Active deep learning method for the discovery of objects of interest in large spectroscopic surveys. CoRR abs/2009.03219 (2020)
2010 – 2019
- 2019
- [j17]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) - 2017
- [c51]Josef Gattermayer, Pavel Tvrdík:
Blockchain-Based Multi-Level Scoring System for P2P Clusters. ICPP Workshops 2017: 301-308 - [c50]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: 371-377 - [c49]Josef Gattermayer, Pavel Tvrdík:
Using Bootstraping Principles of Contemporary P2P File-Sharing Protocols in Large-Scale Grid Computing Systems. PDP 2017: 214-218 - [i3]Jirí Nádvorník, Petr Skoda, Dave Morris, Pavel Tvrdík:
Time Series Cube Data Model. CoRR abs/1702.01393 (2017) - 2016
- [j16]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) - [j15]Daniel Langr, Pavel Tvrdík:
Evaluation Criteria for Sparse Matrix Storage Formats. IEEE Trans. Parallel Distributed Syst. 27(2): 428-440 (2016) - 2015
- [j14]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) - 2014
- [j13]Ivan Simecek, Pavel Tvrdík:
A new code transformation technique for nested loops. Comput. Sci. Inf. Syst. 11(4): 1381-1416 (2014) - [j12]Daniel Langr, Ivan Simecek, Pavel Tvrdík, Tomás Dytrych:
Large-Scale Visualization of Sparse Matrices. Scalable Comput. Pract. Exp. 15(1) (2014) - [j11]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) - [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
- [c48]Daniel Langr, Ivan Simecek, Pavel Tvrdík:
Storing Sparse Matrices to Files in the Adaptive-Blocking Hierarchical Storage Format. FedCSIS 2013: 479-486 - [c47]Ivan Simecek, Pavel Tvrdík:
Dynamic loop reversal - the new code transformation technique. FedCSIS 2013: 1575-1582 - [c46]Daniel Langr, Ivan Simecek, Pavel Tvrdík, Tomás Dytrych:
Scalable Parallel Generation of Very Large Sparse Benchmark Matrices. PPAM (1) 2013: 178-187 - [c45]Daniel Langr, Ivan Simecek, Pavel Tvrdík, Tomás Dytrych:
Parallel Data Acquisition for Visualization of Very Large Sparse Matrices. SYNASC 2013: 336-343 - [c44]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
- [c43]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 - [c42]Ivan Simecek, Daniel Langr, Pavel Tvrdík:
Space-efficient Sparse Matrix Storage Formats for Massively Parallel Systems. HPCC-ICESS 2012: 54-60 - [c41]Josef Gattermayer, Pavel Tvrdík:
Different Approaches to Distributed Compilation. IPDPS Workshops 2012: 1128-1134 - [c40]Ivan Simecek, Daniel Langr, Pavel Tvrdík:
Minimal Quadtree Format for Compression of Sparse Matrices Storage. SYNASC 2012: 359-364 - [c39]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 - 2010
- [c38]Martin Stáva, Pavel Tvrdík:
Multi-core Code in a Cluster - A Meaningful Option? GPC 2010: 15-26
2000 – 2009
- 2009
- [j10]Libor Bus, Pavel Tvrdík:
Towards auction algorithms for large dense assignment problems. Comput. Optim. Appl. 43(3): 411-436 (2009) - [c37]Michal Kostal, Pavel Tvrdík:
Market-Based Batch System. ICDS 2009: 202-207 - [c36]Martin Stáva, Pavel Tvrdík:
Security System for Overlapping Non-dedicated Clusters. ISPA 2009: 272-281 - 2007
- [c35]Michal Kostal, Pavel Tvrdík:
System for trading processors' quanta on a digital market. PDCS 2007: 133-138 - [c34]Martin Stáva, Pavel Tvrdík:
File System Security in the Environment of Non-dedicated Computer Clusters. PDCAT 2007: 445-452 - [c33]Ivan Simecek, Pavel Tvrdík:
Sparse Matrix-Vector Multiplication - Final Solution?. PPAM 2007: 156-165 - 2006
- [j9]Petr Salinger, Pavel Tvrdík:
Broadcasting in all-output-port cube-connected cycles with distance-insensitive switching. J. Parallel Distributed Comput. 66(8): 1103-1110 (2006) - [c32]Pavel Tvrdík, Ivan Simecek:
A New Approach for Accelerating the Sparse Matrix-Vector Multiplication. SYNASC 2006: 156-163 - 2005
- [c31]Martin Kacer, Daniel Langr, Pavel Tvrdík:
Clondike: Linux cluster of non-dedicated workstations. CCGRID 2005: 574-581 - [c30]Ondrej Medek, Pavel Tvrdík:
Quality Balancing Heuristics with Three Variants of Sloan Algorithm. Parallel and Distributed Computing and Networks 2005: 644-650 - [c29]Pavel Tvrdík, Ivan Simecek:
A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices. PPAM 2005: 164-171 - 2004
- [c28]Ondrej Medek, Pavel Tvrdík, Jaroslav Kruis:
Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method. Euro-Par 2004: 734-741 - [c27]Ivan Simecek, Pavel Tvrdík:
Analytical Model for Analysis of Cache Behavior during Cholesky Factorization and Its Variants. ICPP Workshops 2004: 190-197 - [c26]Ondrej Medek, Pavel Tvrdík:
Variable Reordering for a Parallel Envelope Method. ICPP Workshops 2004: 254-261 - [c25]Pavel Tvrdík, Ivan Simecek:
Performance Optimization and Evaluation for Linear Codes. NAA 2004: 566-573 - 2003
- [c24]Radim Ballner, Pavel Tvrdík:
MOOSS: CPU Architecture with Memory Protection and Support for OOP. Asia-Pacific Computer Systems Architecture Conference 2003: 97-111 - [c23]Pavel Tvrdík, Ivan Simecek:
Analytical Modeling of Optimized Sparse Linear Code. PPAM 2003: 207-216 - 2002
- [j8]Petr Salinger, Pavel Tvrdík:
Broadcasting in All-Output-Port Meshes of Trees with Distance-Insensitive Switching. J. Parallel Distributed Comput. 62(8): 1272-1294 (2002) - [j7]Petr Salinger, Pavel Tvrdík:
Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing. Parallel Comput. 28(4): 627-647 (2002) - [c22]Martin Kacer, Pavel Tvrdík:
Load Balancing by Remote Execution of Short Processes on Linux Clusters. CCGRID 2002: 276-277 - [c21]Tomas Liska, Pavel Tvrdík:
Intelligent Mobile Agent Based E-Auctions. ICWI 2002: 209-216 - [c20]Libor Bus, Pavel Tvrdík:
Distributed Memory Auction Algorithms for the Linear Assignment Problem. IASTED PDCS 2002: 137-142 - 2001
- [j6]Petr Salinger, Pavel Tvrdík:
All-to-All Scatter in de Bruijn and Kautz Networks. Comput. Artif. Intell. 20(4): 371-393 (2001) - [c19]Libor Bus, Pavel Tvrdík:
A Parallel Algorithm for Connected Components on Distributed Memory Machines. PVM/MPI 2001: 280-287 - [c18]Petr Salinger, Pavel Tvrdík:
Broadcasting in all-output-port cube-connected cycles with distance-insensitive routing. SIROCCO 2001: 321-336 - 2000
- [j5]Jan Trdlicka, Pavel Tvrdík:
Embedding complete k-ary trees into k-square 2-D meshes with optimal edge congestion. Parallel Comput. 26(6): 783-790 (2000) - [c17]Petr Salinger, Pavel Tvrdík:
Broadcasting in All-Port Wormhole 3-D Meshes of Trees (Research Note). Euro-Par 2000: 931-934 - [c16]Petr Salinger, Pavel Tvrdík:
Optimal Broadcasting in All-Port Meshes of Trees with Distance-Insensitive Routing. IPDPS 2000: 353-358
1990 – 1999
- 1999
- [j4]Michal Soch, Pavel Tvrdík:
Time-Optimal Gossip of Large Packets in Noncombining 2D Tori and Meshes. IEEE Trans. Parallel Distributed Syst. 10(12): 1252-1261 (1999) - [c15]Jan Trdlicka, Pavel Tvrdík:
Optimal k-ary Divide and Conquer Computations on Wormhole 2-D and 3-D Meshes. HiPC 1999: 253-260 - 1998
- [j3]Pavel Tvrdík, Rabah Harbane, Marie-Claude Heydemann:
Uniform homomorphisms of de Bruijn and Kautz networks. Discret. Appl. Math. 83(1-3): 279-301 (1998) - [j2]José D. P. Rolim, Pavel Tvrdík, Jan Trdlicka, Imrich Vrto:
Bisecting De Bruijn and Kautz Graphs. Discret. Appl. Math. 85(1): 87-97 (1998) - [j1]Jan Trdlicka, Pavel Tvrdík:
Embedding of k-ary Complete Trees into Hypercubes with Uniform Load. J. Parallel Distributed Comput. 52(2): 120-131 (1998) - [c14]Michal Soch, Pavel Tvrdík:
Time-Optimal Gossip in Noncombining 2-D Tori with Constant Buffers. Euro-Par 1998: 1047-1050 - [c13]Petr Salinger, Pavel Tvrdík:
All-to-all Scatter in Kautz Networks. Euro-Par 1998: 1057-1061 - [c12]Pavel Kopriva, Pavel Tvrdík:
Decompositions of de Bruijn Networks. ICPADS 1998: 580- - [c11]Michal Soch, Pavel Tvrdík:
Time-optimal gossip in noncombining 3-D tori. SIROCCO 1998: 259-271 - 1997
- [c10]Jan Trdlicka, Pavel Tvrdík:
Embedding Complete k-ary Trees into 2-dimensional Meshes and Tori. Euro-Par 1997: 226-233 - [c9]Michal Soch, Pavel Tvrdík:
Optimal Gossip in Store-and-Forward Noncombining 2-D Tori. Euro-Par 1997: 234-241 - [c8]Michal Soch, Pavel Tvrdík, Martin Volf:
Parallel Graph-Partitioning Using the Mob Heuristic. PVM/MPI 1997: 383-389 - [c7]Michal Soch, Pavel Tvrdík:
Optimal gossip in noncombining 2D-meshes. SIROCCO 1997: 253-265 - 1996
- [c6]Michal Soch, Jan Trdlicka, Pavel Tvrdík:
PVM, Computational Geometry, and Parallel Computing Course. PVM 1996: 38-44 - [c5]Pavel Tvrdík:
Necklace-based Factorization of de Bruijn Digraphs. SIROCCO 1996: 255-168 - [c4]Jan Trdlicka, Pavel Tvrdík:
Embedding of k-ary complete trees into hypercubes with optimal load. SPDP 1996: 600-607 - 1995
- [c3]José D. P. Rolim, Pavel Tvrdík, Jan Trdlicka, Imrich Vrto:
Bisecting de Bruijn and Kautz Graphs. SIROCCO 1995: 211-222 - 1994
- [c2]Pavel Tvrdík:
Necklaces and scalability of Kautz digraphs. SPDP 1994: 409-415 - 1992
- [c1]Pavel Tvrdík:
On Incomplete Hypercubes. CONPAR 1992: 13-24
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-08-05 21:20 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:
