The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pavel Tvrdík: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Radim Ballner, Pavel Tvrdík
    MOOSS: CPU Architecture with Memory Protection and Support for OOP. [Citation Graph (0, 0)][DBLP]
    Asia-Pacific Computer Systems Architecture Conference, 2003, pp:97-111 [Conf]
  2. Martin Kacer, D. Langr, Pavel Tvrdík
    Clondike: Linux cluster of non-dedicated workstations. [Citation Graph (0, 0)][DBLP]
    CCGRID, 2005, pp:574-581 [Conf]
  3. Martin Kacer, Pavel Tvrdík
    Load Balancing by Remote Execution of Short Processes on Linux Clusters. [Citation Graph (0, 0)][DBLP]
    CCGRID, 2002, pp:276-277 [Conf]
  4. Pavel Tvrdík
    On Incomplete Hypercubes. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1992, pp:13-24 [Conf]
  5. Ondrej Medek, Pavel Tvrdík, Jaroslav Kruis
    Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2004, pp:734-741 [Conf]
  6. Petr Salinger, Pavel Tvrdík
    Broadcasting in All-Port Wormhole 3-D Meshes of Trees (Research Note). [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2000, pp:931-934 [Conf]
  7. Petr Salinger, Pavel Tvrdík
    All-to-all Scatter in Kautz Networks. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1998, pp:1057-1061 [Conf]
  8. Michal Soch, Pavel Tvrdík
    Optimal Gossip in Store-and-Forward Noncombining 2-D Tori. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1997, pp:234-241 [Conf]
  9. Michal Soch, Pavel Tvrdík
    Time-Optimal Gossip in Noncombining 2-D Tori with Constant Buffers. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1998, pp:1047-1050 [Conf]
  10. Jan Trdlicka, Pavel Tvrdík
    Embedding Complete k-ary Trees into 2-dimensional Meshes and Tori. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1997, pp:226-233 [Conf]
  11. Jan Trdlicka, Pavel Tvrdík
    Optimal k-ary Divide and Conquer Computations on Wormhole 2-D and 3-D Meshes. [Citation Graph (0, 0)][DBLP]
    HiPC, 1999, pp:253-260 [Conf]
  12. Tomas Liska, Pavel Tvrdík
    Intelligent Mobile Agent Based E-Auctions. [Citation Graph (0, 0)][DBLP]
    ICWI, 2002, pp:209-216 [Conf]
  13. Pavel Kopriva, Pavel Tvrdík
    Decompositions of de Bruijn Networks. [Citation Graph (0, 0)][DBLP]
    ICPADS, 1998, pp:580-0 [Conf]
  14. Ondrej Medek, Pavel Tvrdík
    Variable Reordering for a Parallel Envelope Method. [Citation Graph (0, 0)][DBLP]
    ICPP Workshops, 2004, pp:254-261 [Conf]
  15. Ivan Simecek, Pavel Tvrdík
    Analytical Model for Analysis of Cache Behavior during Cholesky Factorization and Its Variants. [Citation Graph (0, 0)][DBLP]
    ICPP Workshops, 2004, pp:190-197 [Conf]
  16. Petr Salinger, Pavel Tvrdík
    Optimal Broadcasting in All-Port Meshes of Trees with Distance-Insensitive Routing. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2000, pp:353-358 [Conf]
  17. Pavel Tvrdík, Ivan Simecek
    Performance Optimization and Evaluation for Linear Codes. [Citation Graph (0, 0)][DBLP]
    NAA, 2004, pp:566-573 [Conf]
  18. Ondrej Medek, Pavel Tvrdík
    Quality Balancing Heuristics with Three Variants of Sloan Algorithm. [Citation Graph (0, 0)][DBLP]
    Parallel and Distributed Computing and Networks, 2005, pp:644-650 [Conf]
  19. Libor Bus, Pavel Tvrdík
    Distributed Memory Auction Algorithms for the Linear Assignment Problem. [Citation Graph (0, 0)][DBLP]
    IASTED PDCS, 2002, pp:137-142 [Conf]
  20. Pavel Tvrdík, Ivan Simecek
    Analytical Modeling of Optimized Sparse Linear Code. [Citation Graph (0, 0)][DBLP]
    PPAM, 2003, pp:207-216 [Conf]
  21. Pavel Tvrdík, Ivan Simecek
    A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices. [Citation Graph (0, 0)][DBLP]
    PPAM, 2005, pp:164-171 [Conf]
  22. Libor Bus, Pavel Tvrdík
    A Parallel Algorithm for Connected Components on Distributed Memory Machines. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2001, pp:280-287 [Conf]
  23. Michal Soch, Jan Trdlicka, Pavel Tvrdík
    PVM, Computational Geometry, and Parallel Computing Course. [Citation Graph (0, 0)][DBLP]
    PVM, 1996, pp:38-44 [Conf]
  24. Michal Soch, Pavel Tvrdík, Martin Volf
    Parallel Graph-Partitioning Using the Mob Heuristic. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 1997, pp:383-389 [Conf]
  25. José D. P. Rolim, Pavel Tvrdík, Jan Trdlicka, Imrich Vrto
    Bisecting de Bruijn and Kautz Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1995, pp:211-222 [Conf]
  26. Petr Salinger, Pavel Tvrdík
    Broadcasting in all-output-port cube-connected cycles with distance-insensitive routing. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:321-336 [Conf]
  27. Michal Soch, Pavel Tvrdík
    Optimal gossip in noncombining 2D-meshes. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:253-265 [Conf]
  28. Michal Soch, Pavel Tvrdík
    Time-optimal gossip in noncombining 3-D tori. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:259-271 [Conf]
  29. Pavel Tvrdík
    Necklace-based Factorization of de Bruijn Digraphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1996, pp:255-168 [Conf]
  30. Pavel Tvrdík, Ivan Simecek
    A New Approach for Accelerating the Sparse Matrix-Vector Multiplication. [Citation Graph (0, 0)][DBLP]
    SYNASC, 2006, pp:156-163 [Conf]
  31. Petr Salinger, Pavel Tvrdík
    All-to-All Scatter in de Bruijn and Kautz Networks. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 2001, v:20, n:4, pp:- [Journal]
  32. José D. P. Rolim, Pavel Tvrdík, Jan Trdlicka, Imrich Vrto
    Bisecting De Bruijn and Kautz Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:85, n:1, pp:87-97 [Journal]
  33. Pavel Tvrdík, Rabah Harbane, Marie-Claude Heydemann
    Uniform homomorphisms of de Bruijn and Kautz networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:279-301 [Journal]
  34. Petr Salinger, Pavel Tvrdík
    Broadcasting in All-Output-Port Meshes of Trees with Distance-Insensitive Switching. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2002, v:62, n:8, pp:1272-1294 [Journal]
  35. Jan Trdlicka, Pavel Tvrdík
    Embedding of k-ary Complete Trees into Hypercubes with Uniform Load. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:52, n:2, pp:120-131 [Journal]
  36. Petr Salinger, Pavel Tvrdík
    Broadcasting in all-output-port cube-connected cycles with distance-insensitive switching. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2006, v:66, n:8, pp:1103-1110 [Journal]
  37. Petr Salinger, Pavel Tvrdík
    Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2002, v:28, n:4, pp:627-647 [Journal]
  38. Jan Trdlicka, Pavel Tvrdík
    Embedding complete k-ary trees into k-square 2-D meshes with optimal edge congestion. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2000, v:26, n:6, pp:783-790 [Journal]
  39. Michal Soch, Pavel Tvrdík
    Time-Optimal Gossip of Large Packets in Noncombining 2D Tori and Meshes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1999, v:10, n:12, pp:1252-1261 [Journal]
  40. Michal Kostal, Pavel Tvrdík
    System for trading processors' quanta on a digital market. [Citation Graph (0, 0)][DBLP]
    ISCA PDCS, 2007, pp:133-138 [Conf]

  41. Multi-core Code in a Cluster - A Meaningful Option? [Citation Graph (, )][DBLP]


  42. File System Security in the Environment of Non-dedicated Computer Clusters. [Citation Graph (, )][DBLP]


  43. Sparse Matrix-Vector Multiplication - Final Solution?. [Citation Graph (, )][DBLP]


  44. Market-Based Batch System. [Citation Graph (, )][DBLP]


Search in 0.015secs, Finished in 0.017secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002