The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

  
       
         
    STUDIA INFORMATICA - Issue no. 2 / 2000  
         
  Article:   PARALLEL VERIFICATION AND ENUMERATION OF TOURNAMENTS.

Authors:  GÁBOR PECSY, LÁSZLÓ SZUCS. 		 
       
         
  Abstract:  The area of tournaments is extensively discussed in literature. In this article the authors introduce asymptotically optimal sequential algo- rithms for the verification of score vectors and score sequences and a sequen- tial polynomial algorithm for enumeration of complete tournaments. The extensions of these algorithms to different parallel architectures including CREW PRAM, linear array, mesh and hypercube are also presented. It is shown that most of the parallel algorithms discussed here are work-optimal extensions of the sequential ones  
         
     
         
         
      Back to previous page